THE ACCESSIBLE SETS OF FREE NILPOTENT CONTROL SYSTEMS
Topic: All
27 septembre 2010, Salle V115, à l'Ecole des Mines, Paris.
14h00 : Arthur J. KRENER, Department of Applied Mathematics, Naval Postgraduate School, Monterey, CA, USA
We consider the problem of describing the accessible set of some simple control systems, the free nilpotent ones. We review what is known about linear free nilpotent control systems and the simplest quadratic free nilpotent control system. In these cases the accessible sets are cell complexes and the boundary cells are completely known. We are particularly interested in a quadratic free nilpotent system that is a extension of the famous system of Fuller. In this case the accessible sets are harder to describe because there are boundary points that can only be reached by chattering bang bang trajectories. A bang bang trajectory is chattering if it has an infinite number of switches in finite time. We offer some insights and conjectures about the accessible sets of the extended Fuller system.
14h00 : Arthur J. KRENER, Department of Applied Mathematics, Naval Postgraduate School, Monterey, CA, USA
We consider the problem of describing the accessible set of some simple control systems, the free nilpotent ones. We review what is known about linear free nilpotent control systems and the simplest quadratic free nilpotent control system. In these cases the accessible sets are cell complexes and the boundary cells are completely known. We are particularly interested in a quadratic free nilpotent system that is a extension of the famous system of Fuller. In this case the accessible sets are harder to describe because there are boundary points that can only be reached by chattering bang bang trajectories. A bang bang trajectory is chattering if it has an infinite number of switches in finite time. We offer some insights and conjectures about the accessible sets of the extended Fuller system.