Metraipolis › archive › dc_284ecf4686f2
On the Reduced Rank Hypersurface Germ Condition for Near-Controllability of Bilinear Systems — arXiv:2608.24029
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.24029
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T06:46:36.745Z
- SHA-256 of the archived text
7779196359cda6f068bd7f009c1c757d25eb8b140a844e15e5658feac856db27- Stable URL of this page
https://metraipolis.com/documento/dc_284ecf4686f2
How to cite
On the Reduced Rank Hypersurface Germ Condition for Near-Controllability of Bilinear Systems — arXiv:2608.24029 — arXiv (en), https://arxiv.org/abs/2608.24029 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_284ecf4686f2 (Metraipolis archive dc_284ecf4686f2, sha256 7779196359cda6f068bd7f009c1c757d25eb8b140a844e15e5658feac856db27)
BibTeX
@misc{dc284ecf4686f2,
title = {On the Reduced Rank Hypersurface Germ Condition for Near-Controllability of Bilinear Systems — arXiv:2608.24029},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.24029},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_284ecf4686f2; sha256 7779196359cda6f068bd7f009c1c757d25eb8b140a844e15e5658feac856db27},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.24029. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Controllability of nonlinear systems has been extensively studied by using the Lie algebra methods. Although local controllability can be proved, global controllability is in general hard to obtain even for bilinear systems. Recently, a new approach is developed to study controllability of bilinear systems by checking whether the reduced rank points corresponding to the bilinear terms form hyperplanes or hypersurfaces, so that near-controllability, in the global sense, can be algebraically verified once no hypersurface exists. In this paper, we show that there is a flaw in the algorithm for checking the reduced rank hypersurface germ condition (RRHGC) that some special cases are overlooked. We thus propose a new algorithm for testing the RRHGC based on a Darboux-polynomial characterization, which can be used to deal with all cases. An example is provided to demonstrate the proposed new algorithm. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-26 in math.OC). Categorie arXiv: Systems and Control (eess.SY) ; Optimization and Control (math.OC). Pagina del lavoro: https://arxiv.org/abs/2608.24029 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-18T06:39:24.040Z dalla pagina https://arxiv.org/catchup/math.OC/2026-08-26?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).