• Corpus ID: 237592839

Optimal Control for Linear Networked Control Systems with Information Transmission Constraints

  title={Optimal Control for Linear Networked Control Systems with Information Transmission Constraints},
  author={Antoine Aspeel and Kwesi J. Rutledge and Rapha{\"e}l M. Jungers and Beno{\^i}t Macq and Necmiye Ozay},
This paper addresses the problem of robust control of a linear discrete-time system subject to bounded disturbances and to measurement and control budget constraints. Using Q-parameterization and a polytope containment method, we prove that the co-design of an affine feedback controller, a measurement schedule and a control schedule can be exactly formulated as a mixed integer linear program with 2 binary variables per time step. As a consequence, this problem can be solved efficiently, even… 

Figures and Tables from this paper


Design of Affine Controllers via Convex Optimization
This work addresses the problem of designing a general affine causal controller, in which the control input is an affine function of all previous measurements, in order to minimize a convex objective, in either a stochastic or worst-case setting.
Robust output feedback control with guaranteed constraint satisfaction
We propose a method to control linear time-varying (LTV) discrete-time systems subject to bounded process disturbances and measurable outputs with bounded noise, and polyhedral constraints over
A Characterization of Convex Problems in Decentralized Control$^ast$
The notion of quadratic invariance of a constraint set with respect to a system is defined, and it is shown that if the constraint set has this property, then the constrained minimum-norm problem may be solved via convex programming.
Scheduling and feedback co-design for networked control systems
This work defines the basic concepts of network scheduling in NCSs and forms the optimal scheduling problem under both rate-monotonic-schedulability constraints and NCS-stability constraints, and gives an example of how such optimization is carried out.
A System-Level Approach to Controller Synthesis
A new “system level” (SL) approach involving three complementary SL elements that provide an alternative to the Youla parameterization of all stabilizing controllers and the responses they achieve, and combine with SL constraints (SLCs) to parameterize the largest known class of constrained stabilization controllers that admit a convex characterization, generalizing quadratic invariance.
Finite horizon constrained control and bounded-error estimation in the presence of missing data
An optimization-based design technique for constrained control and bounded-error state estimation for affine systems in the presence of intermittent measurements is proposed and a novel property, equalized recovery, is introduced that generalizes the equalized performance property and that allows us to tolerate missing observations.
Networked Control Systems With Communication Constraints: Tradeoffs Between Transmission Intervals, Delays and Performance
A newly developed NCS model including all these network phenomena is provided, including communication constraints, to provide an explicit construction of a continuum of Lyapunov functions that guarantee stability of the NCS in the presence of communication constraints.
Quadratic invariance is necessary and sufficient for convexity
In decentralized control problems, a standard approach is to specify the set of allowable decentralized controllers as a closed subspace of linear operators. This then induces a corresponding set of
Observability and Controllability Analysis of Linear Systems Subject to Data Losses
An algorithm for deciding observability (or the absence of it) for systems subject to data losses is proposed, and it is shown how this algorithm can be used also to decide other properties including constructibility, controllability, reachability, null-controllability, detectability, and stabilizability by means of relations that are established among these properties.
Robust solutions of uncertain linear programs
It is shown that the RC of an LP with ellipsoidal uncertainty set is computationally tractable, since it leads to a conic quadratic program, which can be solved in polynomial time.