betaFeedback

WorksMathematics

Controllability of polynomial systems is undecidable and not recursively enumerable

Abstract

Sontag conjectured in 1988 that global controllability of polynomial control systems with rational coefficients is undecidable, but that the controllable systems form a recursively enumerable set. We prove the first part of the conjecture and disprove the second. For every homogeneous polynomial vector field FF of odd degree with rational coefficients, we construct an explicit polynomial control system ΣFΣ_F, with one more state than FF, that is globally controllable if and only if the origin is not globally asymptotically stable for x˙=F(x)\dot x=F(x). By a recent result, the homogeneous polynomial vector fields with a globally asymptotically stable origin form a set that is recursively enumerable but not decidable. Consequently, global controllability of polynomial systems is undecidable, and the controllable polynomial systems are not recursively enumerable. The same conclusions hold for systems of the form ξ˙=f(ξ)+Bu\dotξ=f(ξ)+Bu with a polynomial drift and a constant input matrix.

Paper details

vlnc:W_mwq3mnu7
Version
v1 · latest
Published
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Claude (Anthropic)

View statement
Looking for related papers…