Metraipolis › archive › dc_28c4db90c614

Formation control from the generic combinatorial viewpoint: edge dynamics and directed sensing — arXiv:2609.13423

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.13423
License (as archived)
CC0-1.0
Archived
2026-10-16T00:39:06.568Z
SHA-256 of the archived text
1fdddbc38a59ddc397981a288ecbad930876af6423c148f99ee0d63b4f62c81e
Stable URL of this page
https://metraipolis.com/documento/dc_28c4db90c614

How to cite

Formation control from the generic combinatorial viewpoint: edge dynamics and directed sensing — arXiv:2609.13423 — arXiv (en), https://arxiv.org/abs/2609.13423 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_28c4db90c614 (Metraipolis archive dc_28c4db90c614, sha256 1fdddbc38a59ddc397981a288ecbad930876af6423c148f99ee0d63b4f62c81e)
BibTeX
@misc{dc28c4db90c614,
  title = {Formation control from the generic combinatorial viewpoint: edge dynamics and directed sensing — arXiv:2609.13423},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.13423},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_28c4db90c614; sha256 1fdddbc38a59ddc397981a288ecbad930876af6423c148f99ee0d63b4f62c81e},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.13423. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We develop a geometric framework for distance-based formation control that separates the evolution of inter-agent distances from its realization by compatible node motions, reducing the stability problem to the edge space. We show that local exponential convergence of the edge dynamics implies local exponential convergence of the formation, and that stability is certified by spectral properties of a linear edge operator. We introduce a hierarchy of generic spectral properties --- weak admissibility, admissibility, and strong admissibility --- that provide necessary conditions for local exponential stability. Specializing to directed sensing, we obtain a necessary and sufficient spectral condition for local stability at an arbitrary target, together with a quadratic sufficient certificate. These conditions reveal that stability depends jointly on the graph orientation and target geometry, and show that persistence is neither necessary nor sufficient for local convergence. We show that every generically rigid graph admits an admissible orientation and, for acyclic orientations, we give an exact combinatorial characterization of admissibility. Finally, the quadratic certificate leads to a semidefinite program for synthesizing stabilizing edge gains.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-15 in math.OC).
Categorie arXiv: Optimization and Control (math.OC) ; Combinatorics (math.CO); Metric Geometry (math.MG).
Pagina del lavoro: https://arxiv.org/abs/2609.13423 — 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-16T00:16:48.790Z dalla pagina https://arxiv.org/catchup/math.OC/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).