Fliess series, a generalization of the Ree's theorem, and an algebraic approach to a homogeneous approximation problem
From MaRDI portal
Publication:3542974
DOI10.1080/00207170701561427zbMath1152.93334OpenAlexW2017942945MaRDI QIDQ3542974
Svetlana Ignatovich, Grigory M. Sklyar
Publication date: 1 December 2008
Published in: International Journal of Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207170701561427
Related Items (6)
Realizable growth vectors of affine control systems ⋮ Normalization of homogeneous approximations of symmetric affine control systems with two controls ⋮ Subspaces of maximal singularity for homogeneous control systems ⋮ Free algebras and noncommutative power series in the analysis of nonlinear control systems: an application to approximation problems ⋮ Implementation of the algorithm for constructing homogeneous approximations of nonlinear control systems ⋮ Time-optimal control problem for a special class of control systems: optimal controls and approximation in the sense of time optimality
Cites Work
- Unnamed Item
- Lie elements and an algebra associated with shuffles
- Algebraic and multiple integral identities
- Local invariants of smooth control systems
- Representations of control systems in the Fliess algebra and in the algebra of nonlinear power moments.
- Orthogonal projection onto the free Lie algebra
- Graded Approximations and Controllability Along a Trajectory
- Solvable Approximations to Control Systems
- Nilpotent and High-Order Approximations of Vector Field Systems
- On the Garsia Lie Idempotent
- Realizations of nonlinear systems and abstract transitive Lie algebras
- Approximation of Time-Optimal Control Problems via Nonlinear Power Moment Problems
- Moment Approach to Nonlinear Time Optimality
- Local Realizations of Nonlinear Causal Operators
- Controllability of nonlinear systems
This page was built for publication: Fliess series, a generalization of the Ree's theorem, and an algebraic approach to a homogeneous approximation problem