A symbolic approach to the design of nonlinear networked control systems

Networked control systems (NCS) are spatially distributed systems where communication among plants, sensors, actuators and controllers occurs in a shared communication network. NCS have been studied for the last ten years and important research results have been obtained. These results are in the area of stability and stabilizability. However, while important, these results must be complemented in different areas to be able to design effective NCS. In this paper we approach the control design of NCS using symbolic (finite) models. Symbolic models are abstract descriptions of continuous systems where one symbol corresponds to an "aggregate" of continuous states. We consider a fairly general multiple-loop network architecture where plants communicate with digital controllers through a shared, non-ideal, communication network characterized by variable sampling and transmission intervals, variable communication delays, quantization errors, packet losses and limited bandwidth. We first derive a procedure to obtain symbolic models that are proven to approximate NCS in the sense of alternating approximate bisimulation. We then use these symbolic models to design symbolic controllers that realize specifications expressed in terms of automata on infinite strings. An example is provided where we address the control design of a pair of nonlinear control systems sharing a common communication network. The closed--loop NCS obtained is validated through the OMNeT++ network simulation framework.

[1]  Stephan Merz,et al.  Model Checking , 2000 .

[2]  Eduardo Sontag,et al.  Forward Completeness, Unboundedness Observability, and their Lyapunov Characterizations , 1999 .

[3]  George J. Pappas,et al.  Discrete abstractions of hybrid systems , 2000, Proceedings of the IEEE.

[4]  Paulo Tabuada,et al.  Symbolic Models for Nonlinear Control Systems: Alternating Approximate Bisimulations , 2007, SIAM J. Control. Optim..

[5]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[6]  Antoine Girard,et al.  Approximation Metrics for Discrete and Continuous Systems , 2006, IEEE Transactions on Automatic Control.

[7]  Wpmh Maurice Heemels,et al.  Stability and stabilization of networked control systems , 2010 .

[8]  Mark R. Greenstreet,et al.  Hybrid Systems: Computation and Control , 2002, Lecture Notes in Computer Science.

[9]  Rudolf Hornig,et al.  An overview of the OMNeT++ simulation environment , 2008, Simutools 2008.

[10]  João Pedro Hespanha,et al.  A Survey of Recent Results in Networked Control Systems , 2007, Proceedings of the IEEE.

[11]  Maria Domenica Di Benedetto,et al.  Integrated Design of Symbolic Controllers for Nonlinear Systems , 2012, IEEE Transactions on Automatic Control.

[12]  Nathan van de Wouw,et al.  Comparison of overapproximation methods for stability analysis of networked control systems , 2010, HSCC '10.

[13]  Paulo Tabuada,et al.  Backstepping Design for Incremental Stability , 2010, IEEE Transactions on Automatic Control.

[14]  M. Mahmoud Robust Control and Filtering for Time-Delay Systems , 2000 .

[15]  Thomas A. Henzinger,et al.  Alternating Refinement Relations , 1998, CONCUR.

[16]  Paulo Tabuada,et al.  Approximately bisimilar symbolic models for nonlinear control systems , 2007, Autom..

[17]  Manuel Mazo,et al.  Symbolic Models for Nonlinear Control Systems Without Stability Assumptions , 2010, IEEE Transactions on Automatic Control.

[18]  Paulo Tabuada,et al.  Symbolic models for nonlinear time-delay systems using approximate bisimulations , 2010, Syst. Control. Lett..

[19]  Paulo Tabuada,et al.  Verification and Control of Hybrid Systems - A Symbolic Approach , 2009 .

[20]  David Angeli,et al.  A Lyapunov approach to incremental stability properties , 2002, IEEE Trans. Autom. Control..

[21]  Paulo Tabuada An Approximate Simulation Approach to Symbolic Control , 2008, IEEE Transactions on Automatic Control.

[22]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.