Controlling a Class of Nonlinear Systems on Rectangles

Departments of Manuf. & Aerosp. & Mech. Eng., Boston Univ., Brookline, MA
IEEE Transactions on Automatic Control (Impact Factor: 2.72). 12/2006; DOI: 10.1109/TAC.2006.884957
Source: IEEE Xplore

ABSTRACT In this paper, we focus on a particular class of nonlinear affine control systems of the form xdot=f(x)+Bu, where the drift f is a multi-affine vector field (i.e., affine in each state component), the control distribution B is constant, and the control u is constrained to a convex set. For such a system, we first derive necessary and sufficient conditions for the existence of a multiaffine feedback control law keeping the system in a rectangular invariant. We then derive sufficient conditions for driving all initial states in a rectangle through a desired facet in finite time. If the control constraints are polyhedral, we show that all these conditions translate to checking the feasibility of systems of linear inequalities to be satisfied by the control at the vertices of the state rectangle. This work is motivated by the need to construct discrete abstractions for continuous and hybrid systems, in which analysis and control tasks specified in terms of reachability of sets of states can be reduced to searches on finite graphs. We show the application of our results to the problem of controlling the angular velocity of an aircraft with gas jet actuators

  • [Show abstract] [Hide abstract]
    ABSTRACT: The aim of the safety controller synthesis problem is to synthesize a feedback controller that results in closed-loop trajectories that meet certain criteria, namely, the state or output trajectories terminate in a Goal set without entering an Unsafe set. We propose a formal method for synthesizing such a controller using finitely many human generated trajectories. The main theoretical idea behind our results is the concept of trajectory robustness, which is established using the theory of approximate bisimulation. Approximate bisimulation has been used to establish robustness (in the L∞ sense) of execution trajectories of dynamical systems and hybrid systems, resulting in trajectory-based safety verification procedures. The work reported in this paper builds on our earlier work where the dynamics of the system is assumed to be affine linear. We extend the existing results to special classes of nonlinear dynamical systems, feedback linearizable and differentially flat systems. For both cases, we present some examples where it is possible to synthesize the controller using human generated trajectories, which are obtained through interactive computer programs with graphical interface (computer games).
    American Control Conference (ACC), 2012; 06/2012
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Symbolic models have recently spurred the interest of the research community because they offer a correct-by-design approach to the control of embedded and cyber-physical systems. In this paper we address construction of symbolic models for networks of discrete-time nonlinear control systems. The main result of the paper shows that under some small gain theorem-type conditions, a network of symbolic models can be constructed which approximates a network of incrementally stable control systems in the sense of approximate bisimulation with any desired accuracy. Compositional design of quantization parameters of the symbolic models is also derived and based on the topological properties of the network.
  • [Show abstract] [Hide abstract]
    ABSTRACT: Motivated by robotic motion planning, we develop a framework for control policy synthesis for both non-deterministic transition systems and Markov decision processes that are subject to temporal logic task specifications. We introduce a fragment of linear temporal logic that can be used to specify common motion planning tasks such as safe navigation, response to the environment, persistent coverage, and surveillance. This fragment is computationally efficient; the complexity of control policy synthesis is a doubly-exponential improvement over standard linear temporal logic for both non-deterministic transition systems and Markov decision processes. This improvement is possible because we compute directly on the original system, as opposed to the automata-based approach commonly used. We give simulation results for representative motion planning tasks and compare to generalized reactivity(1).
    Robotics and Automation (ICRA), 2013 IEEE International Conference on; 01/2013


Available from