9 research outputs found
An Optimal Controller Architecture for Poset-Causal Systems
We propose a novel and natural architecture for decentralized control that is
applicable whenever the underlying system has the structure of a partially
ordered set (poset). This controller architecture is based on the concept of
Moebius inversion for posets, and enjoys simple and appealing separation
properties, since the closed-loop dynamics can be analyzed in terms of
decoupled subsystems. The controller structure provides rich and interesting
connections between concepts from order theory such as Moebius inversion and
control-theoretic concepts such as state prediction, correction, and
separability. In addition, using our earlier results on H_2-optimal
decentralized control for arbitrary posets, we prove that the H_2-optimal
controller in fact possesses the proposed structure, thereby establishing the
optimality of the new controller architecture.Comment: 32 pages, 9 figures, submitted to IEEE Transactions on Automatic
Contro
Stabilization of Networked Control Systems with Sparse Observer-Controller Networks
In this paper we provide a set of stability conditions for linear
time-invariant networked control systems with arbitrary topology, using a
Lyapunov direct approach. We then use these stability conditions to provide a
novel low-complexity algorithm for the design of a sparse observer-based
control network. We employ distributed observers by employing the output of
other nodes to improve the stability of each observer dynamics. To avoid
unbounded growth of controller and observer gains, we impose bounds on their
norms. The effects of relaxation of these bounds is discussed when trying to
find the complete decentralization conditions
Localized LQR Optimal Control
This paper introduces a receding horizon like control scheme for localizable
distributed systems, in which the effect of each local disturbance is limited
spatially and temporally. We characterize such systems by a set of linear
equality constraints, and show that the resulting feasibility test can be
solved in a localized and distributed way. We also show that the solution of
the local feasibility tests can be used to synthesize a receding horizon like
controller that achieves the desired closed loop response in a localized manner
as well. Finally, we formulate the Localized LQR (LLQR) optimal control problem
and derive an analytic solution for the optimal controller. Through a numerical
example, we show that the LLQR optimal controller, with its constraints on
locality, settling time, and communication delay, can achieve similar
performance as an unconstrained H2 optimal controller, but can be designed and
implemented in a localized and distributed way.Comment: Extended version for 2014 CDC submissio
Optimal Output Feedback Architecture for Triangular LQG Problems
Distributed control problems under some specific information constraints can
be formulated as (possibly infinite dimensional) convex optimization problems.
The underlying motivation of this work is to develop an understanding of the
optimal decision making architecture for such problems. In this paper, we
particularly focus on the N-player triangular LQG problems and show that the
optimal output feedback controllers have attractive state space realizations.
The optimal controller can be synthesized using a set of stabilizing solutions
to 2N linearly coupled algebraic Riccati equations, which turn out to be easily
solvable under reasonable assumptions.Comment: To be presented at 2014 American Control Conferenc
Fast M\"obius and Zeta Transforms
M\"obius inversion of functions on partially ordered sets (posets)
is a classical tool in combinatorics. For finite posets it
consists of two, mutually inverse, linear transformations called zeta and
M\"obius transform, respectively. In this paper we provide novel fast
algorithms for both that require time and space, where and is the width (length of longest antichain) of
, compared to for a direct computation. Our approach
assumes that is given as directed acyclic graph (DAG)
. The algorithms are then constructed using a chain
decomposition for a one time cost of , where is the number of
edges in the DAG's transitive reduction. We show benchmarks with
implementations of all algorithms including parallelized versions. The results
show that our algorithms enable M\"obius inversion on posets with millions of
nodes in seconds if the defining DAGs are sufficiently sparse.Comment: 16 pages, 7 figures, submitted for revie
Recommended from our members
Control Theory: Mathematical Perspectives on Complex Networked Systems
Control theory is an interdisciplinary field that is located at the crossroads of pure and applied mathematics with systems engineering and the sciences. Its range of applicability and its techniques evolve rapidly with new developments in communication systems and electronic data processing. Thus, in recent years networked control systems emerged as a new fundamental topic, which combines complex communication structures with classical control methods and requires new mathematical methods. A substantial number of contributions to this workshop was devoted to the control of networks of systems. This was complemented by a series of lectures on other current topics like fundamentals of nonlinear control systems, model reduction and identification, algorithmic aspects in control, as well as open problems in control
Stability and Control in Complex Networks of Dynamical Systems
Stability analysis of networked dynamical systems has been of interest in many disciplines such as biology and physics and chemistry with applications such as LASER cooling and plasma stability. These large networks are often modeled to have a completely random (Erdös-Rényi) or semi-random (Small-World) topologies. The former model is often used due to mathematical tractability while the latter has been shown to be a better model for most real life networks. The recent emergence of cyber physical systems, and in particular the smart grid, has given rise to a number of engineering questions regarding the control and optimization of such networks. Some of the these questions are: How can the stability of a random network be characterized in probabilistic terms? Can the effects of network topology and system dynamics be separated? What does it take to control a large random network? Can decentralized (pinning) control be effective? If not, how large does the control network needs to be? How can decentralized or distributed controllers be designed? How the size of control network would scale with the size of networked system? Motivated by these questions, we began by studying the probability of stability of synchronization in random networks of oscillators. We developed a stability condition separating the effects of topology and node dynamics and evaluated bounds on the probability of stability for both Erdös-Rényi (ER) and Small-World (SW) network topology models. We then turned our attention to the more realistic scenario where the dynamics of the nodes and couplings are mismatched. Utilizing the concept of ε-synchronization, we have studied the probability of synchronization and showed that the synchronization error, ε, can be arbitrarily reduced using linear controllers. We have also considered the decentralized approach of pinning control to ensure stability in such complex networks. In the pinning method, decentralized controllers are used to control a fraction of the nodes in the network. This is different from traditional decentralized approaches where all the nodes have their own controllers. While the problem of selecting the minimum number of pinning nodes is known to be NP-hard and grows exponentially with the number of nodes in the network we have devised a suboptimal algorithm to select the pinning nodes which converges linearly with network size. We have also analyzed the effectiveness of the pinning approach for the synchronization of oscillators in the networks with fast switching, where the network links disconnect and reconnect quickly relative to the node dynamics. To address the scaling problem in the design of distributed control networks, we have employed a random control network to stabilize a random plant network. Our results show that for an ER plant network, the control network needs to grow linearly with the size of the plant network
Coordination Control of Linear Systems
Schuppen, J.H. van [Promotor]Ran, A.C.M. [Promotor