17th International Symposium on
Mathematical Theory of Networks and Systems
Kyoto International Conference Hall, Kyoto, Japan, July 24-28, 2006

MTNS 2006 Paper Abstract


Paper TuP13.2

Kawski, Matthias (Arizona State Univ.)

On the Problem Whether Controllability Is Finitely Determined

Scheduled for presentation during the Regular Session "Linear Systems I" (TuP13), Tuesday, July 25, 2006, 15:45−16:10, Room 101

17th International Symposium on Mathematical Theory of Networks and Systems, July 24-28, 2006, Kyoto, Japan

This information is tentative and subject to change. Compiled on May 27, 2023

Keywords Algebraic and differential geometry, Control of nonlinear systems, Optimal control


Controllability of finite dimensional linear systems can be decided via a finite number of matrix operations, with an a-priori known bound on this number of operations. For both polynomial and general nonlinear analytic systems that are affine in the control it remains an open problem whether controllability can at all be decided by a finite number of differentiations of the data. This is closely related to the question whether the value function of the minimum-time optimal control problem is Hoelder continuous. This paper briefly surveys some of the historical background behind the questions, and then presents recent progress, with focus on some unexpected properties of custom-designed polynomial systems.