Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · math/0502031

On feedback classification of control-affine systems with one and two-dimensional inputs

Andrei Agrachev·Igor Zelenko
View original source ↗Read source document ↗Export metadata ↓

Abstract

The paper is devoted to the local classification of generic control-affine systems on an n-dimensional manifold with scalar input for any n>3 or with two inputs for n=4 and n=5, up to state-feedback transformations, preserving the affine structure. First using the Poincare series of moduli numbers we introduce the intrinsic numbers of functional moduli of each prescribed number of variables on which a classification problem depends. In order to classify affine systems with scalar input we associate with such a system the canonical frame by normalizing some structural functions in a commutative relation of the vector fields, which define our control system. Then, using this canonical frame, we introduce the canonical coordinates and find a complete system of state-feedback invariants of the system. It also gives automatically the micro-local (i.e. local in state-input space) classification of the generic non-affine n-dimensional control system with scalar input for n>2. Further we show how the problem of feedback-equivalence of affine systems with two-dimensional input in state space of dimensions 4 and 5 can be reduced to the same problem for affine systems with scalar input. In order to make this reduction we distinguish the subsystem of our control system, consisting of the directions of all extremals in dimension 4 and all abnormal extremals in dimension 5 of the time optimal problem, defined by the original control system. In each classification problem under consideration we find the intrinsic numbers of functional moduli of each prescribed number of variables according to its Poincare series.

Explore related subjects

math.OCmath.DG

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Andrei Agrachev, Igor Zelenko. 2005-02-02. On feedback classification of control-affine systems with one and two-dimensional inputs. https://arxiv.org/abs/math/0502031

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Strategic Inference in Stackelberg Games: Optimal Control for Revealing Adversary Intent

We study a continuous-time stochastic Stackelberg game in which a leader seeks to accomplish a primary objective while inferring a hidden parameter of a rational follower. The follower solves an entropy-regularized linear-quadratic tracking problem and responds to the leader's trajectory with a randomized policy. Anticipating this response, the leader designs informative controls to maximize the estimation efficiency for the follower's latent intent, through maximum likelihood estimation. Unlike prior work on discrete-time or finite-candidate inverse learning, our framework enables continuous parameter inference without prior assumptions and endogenizes the information source through the follower's strategic feedback. We derive semi-explicit solutions, prove well-posedness, and develop recurrent neural network algorithms to approximate the leader's path-dependent control. Numerical experiments demonstrate how the leader balances task performance and information gain, highlighting the practical value of our approach for adversarial strategic inference.

math.OC↗
arXiv2026

Stratification for Nonlinear Semidefinite Programming

This paper introduces a stratification framework for nonlinear semidefinite programming (NLSDP) that reveals and utilizes the geometry behind the nonsmooth KKT system. Based on the index stratification of $\mathbb{S}^n$ and its lift to the primal-dual space, a stratified variational analysis is developed. Specifically, we define the stratum-restricted regularity property, characterize it by the verifiable weak second order condition (W-SOC) and weak strict Robinson constraint qualification (W-SRCQ), and interpret the W-SRCQ geometrically via transversality, with stability along strata. The interactions of these properties across neighboring strata are further examined, leading to the conclusion that classical strong-form regularity conditions correspond to the local uniform validity of stratum-restricted counterparts. On the algorithmic side, a stratified Gauss--Newton method with normal steps and a correction mechanism is proposed for globally solving the KKT equation through a least-squares merit function. We demonstrate that the algorithm converges globally to directional stationary points. Moreover, under the second order sufficient condition (SOSC) and the strict Robinson constraint qualification (SRCQ) at an accumulation point, with a suitable correction threshold, the whole sequence converges superlinearly to this point, which is a KKT pair, and eventually identifies the active stratum. The rate is quadratic if the problem data are additionally of class $LC^2$ near the solution.

math.OC↗
arXiv2026

Convergence Rate Analysis of SOAP with Arbitrary Orthogonal Projection Matrices

In this short note, we establish, for the first time, the convergence rate of SOAP, an efficient and popular matrix-based optimizer for training deep neural networks. Our analysis extends to a more general variant of SOAP that admits arbitrary orthogonal projection matrices and requires only that these matrices be conditionally independent of the current stochastic gradient at each iteration. For example, they may be constructed from information available up to the preceding step.

math.OC↗