Combinatorial Admissibility in Control-Affine Networks
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866910202317504512 |
|---|---|
| author | Zelazo, Daniel Theran, Louis |
| author_facet | Zelazo, Daniel Theran, Louis |
| contents | We study synchronization of heterogeneous control-affine nonlinear agents interconnected through diffusive (relative-output) measurements. We separate the design into an edge-space step, specifying a stabilizing model evolution for relative outputs, and a lift step, realizing the prescribed edge motion using the agents' allowable input directions, constrained by the control-affine geometry of the agents. We introduce an admissibility notion that characterizes when an edge-driven diffusive design is feasible. We derive checkable combinatorial certificates that connect graph topology and actuation limits directly to admissibility, so that feasible edge dynamics can be verified in a practical and transparent way. The results are illustrated on synchronization of nonlinear oscillators. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_17129 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Combinatorial Admissibility in Control-Affine Networks Zelazo, Daniel Theran, Louis Optimization and Control We study synchronization of heterogeneous control-affine nonlinear agents interconnected through diffusive (relative-output) measurements. We separate the design into an edge-space step, specifying a stabilizing model evolution for relative outputs, and a lift step, realizing the prescribed edge motion using the agents' allowable input directions, constrained by the control-affine geometry of the agents. We introduce an admissibility notion that characterizes when an edge-driven diffusive design is feasible. We derive checkable combinatorial certificates that connect graph topology and actuation limits directly to admissibility, so that feasible edge dynamics can be verified in a practical and transparent way. The results are illustrated on synchronization of nonlinear oscillators. |
| title | Combinatorial Admissibility in Control-Affine Networks |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2603.17129 |