Managing Data Flow to Boost Cyber-Physical System Performance
For Immediate Release
Researchers from North Carolina State University have developed a suite of algorithms to improve the performance of cyber-physical systems – from autonomous vehicles to smart power grids – by balancing each component’s need for data with how fast that data can be sent and received.
“Cyber-physical systems integrate sensors, devices, and communications tools, allowing all of the elements of a system to share information and coordinate their activities in order to accomplish goals,” says Aranya Chakrabortty, co-author of a paper on the new algorithms and a professor of electrical and computer engineering at NC State. “These systems have tremendous potential – the National Science Foundation refers to them as ‘enabling a smart and connected world’ – but these systems also pose challenges.
“Specifically, the physical agents in a system – the devices – need a lot of communication links in order to function effectively. This leads to large volumes of data flowing through the communication network, which causes routing and queuing delays. These delays can cause long waiting times for the agents to take action, thereby degrading the quality of the system. In other words, there’s so much data, being passed through so many links, that a system may not be able to accomplish its established goals – the lag time is just too long.”
This creates a dilemma. Reducing communication can hurt the quality of the system’s performance, because each element of the system will be operating with less information. On the other hand, reducing communication means that each element of the system would be able to get that information more quickly.
“So, it’s all a trade-off,” Chakrabortty says. “The right balance needs to be struck between all three variables – namely, the right amount of communication sparsity, the optimal delay, and the best achievable performance of the agents. Striking this fine balance to carry out the mission in the best possible way while also ensuring safe and stable operation of every agent is not easy. This is where our algorithms come in.”
Chakrabortty and graduate student Nandini Negi developed three algorithms that, taken together, reduce the overall number of data requests from each node in a system, but ensure that each node receives enough information, quickly enough, to achieve system goals.
“There is no one-size-fits-all solution that will apply to every cyber-physical system,” Negi says. “But our algorithms allow users to identify the optimal communications solution for any system.”
The paper, “Sparsity-Promoting Optimal Control of Cyber-Physical Systems over Shared Communication Networks,” is published in the journal Automatica. Negi is first author of the paper. The work was funded in part by the National Science Foundation under grant number 1544871.
Note to Editors: The study abstract follows.
“Sparsity-Promoting Optimal Control of Cyber-Physical Systems over Shared Communication Networks”
Authors: Nandini Negi and Aranya Chakrabortty, North Carolina State University
Published: Aug. 29, Automatica
Abstract: Recent years have seen several new directions in the design of sparse control of cyber-physical systems (CPSs) driven by the objective of reducing communication costs. One common assumption made in these designs is that the communication happens over a dedicated network. For many practical applications, however, communication must occur over shared networks, leading to two critical design challenges, namely – time-delays in the feedback and fair sharing of bandwidth among users. In this paper, we present a set of sparse H2 control designs under these two design constraints. An essential aspect of our design is that the delay itself can be a function of sparsity, which leads to an interesting pattern of trade-offs in the H2 performance. We present three distinct algorithms. The first algorithm preconditions the assignable bandwidth to the network and produces an initial guess for a stabilizing controller. This is followed by our second algorithm, which sparsifies this controller while simultaneously adapting the feedback delay and optimizing the H2 performance using alternating directions method of multipliers (ADMM). The third algorithm extends this approach to a multiple user scenario where an optimal number of communication links, whose total sum is fixed, is distributed fairly among users by minimizing the variance of their H2 performances. The problem is cast as a difference-of-convex (DC) program with mixed-integer linear program (MILP) constraints. We provide theorems to prove the convergence of these algorithms, followed by validation through numerical simulations.