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: 3.17). 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: We develop a framework for optimal control policy synthesis for non-deterministic transition systems subject to temporal logic specifications. We use a fragment of temporal logic to specify tasks such as safe navigation, response to the environment, persistence, and surveillance. By restricting specifications to this fragment, we avoid a potentially doubly-exponential automaton construction. We compute feasible control policies for non-deterministic transition systems in time polynomial in the size of the system and specification. We also compute optimal control policies for average, minimax (bottleneck), and average cost-per-task-cycle cost functions. We highlight several interesting cases when optimal policies can be computed in time polynomial in the size of the system and specification. Additionally, we make connections between computing optimal control policies for an average cost-per-task-cycle cost function and the generalized traveling salesman problem. We give simulation results for motion planning problems.
    2013 IEEE 52nd Annual Conference on Decision and Control (CDC); 12/2013
  • [Show abstract] [Hide abstract]
    ABSTRACT: Abstraction-based approaches to the design of complex control systems construct finite-state models that are formally related to the original control systems, then leverage symbolic techniques from finite-state synthesis to compute controllers satisfying specifications given in a temporal logic, and finally refine the obtained control schemes back to the given concrete complex models. While such approaches have been successfully used to perform synthesis over non-probabilistic control systems, there are only few results available for probabilistic models: hence the goal of this paper, which considers continuous-time controlled stochastic differential equations. We show that for every stochastic control system satisfying a stochastic version of incremental input-to-state stability, and for every ε > 0, there exists a finite-state abstraction that is ε-approximate bisimilar to the stochastic control system (in the sense of moments). We demonstrate the effectiveness of the construction by synthesizing a controller for a stochastic control system with respect to linear temporal logic specifications. Since stochastic control systems are a common mathematical models for many complex safety critical systems subject to uncertainty, our techniques promise to enable a new, automated, correct-by-construction controller synthesis approach for these systems.
    2013 IEEE 52nd Annual Conference on Decision and Control (CDC); 12/2013
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper addresses the motion planning problem using hybrid symbolic techniques. The proposed approach develops a unified hierarchical hybrid control framework using a bismulation-based abstraction technique over the partitioned motion space that can be applied to autonomous aerial robots (3-D symbolic motion planning) or ground vehicles (2-D symbolic motion planning). The bisimulation relation between the abstracted model and the original continuous system guarantees that their behaviors are the same. This allows to design a discrete supervisor for the abstracted model, and then, the designed supervisor can be applied to the original system while the closed-loop behavior does not change. To apply the discrete supervisor to the original continuous system, an interface layer is developed, which on the one hand translates discrete commands of the supervisor to a continuous form applicable to the continuous plant and on the other hand, abstracts the continuous signals of the continuous low layer to discrete symbols understandable by the supervisor. The proposed algorithm is verified through implementation of a hybrid symbolic algorithm for the formation control of unmanned aerial vehicles.
    Asian Journal of Control 10/2014; · 1.41 Impact Factor


Available from