Skip to content
DraconiticResearch
Search Sources API
186,546 studies31 sourcesUpdated 51 min ago
PreprintCC BY-NC-ND 4.0arXiv

Networked Admissibility-Preserving Control for Directed Safe Coordination

Abstract

This paper addresses safety-critical coordination for scalar agents whose distributed commands are implemented through constrained physical-input dynamics. Agents communicate over a fixed weighted digraph with a directed spanning tree, while their outputs must remain inside a common moving safety corridor and their realized inputs must satisfy heterogeneous asymmetric bounds. We propose a networked Admissibility-Preserving Control (APC) architecture in which an Admissibility-Preserving Input Realization (APIR) governs physical inputs and a logarithmic barrier coordinate represents the safety corridor. The synthesis yields an exact cascade in which exponentially decaying realization errors drive nonsymmetric consensus dynamics. For every compatible compact initial set, the closed-loop system admits a unique complete solution, renders the moving corridor and actuator intervals forward invariant with uniform margins, keeps commands bounded, and achieves exponential consensus. We derive direction-specific sufficient conditions under which positive and negative control demands remain within their corresponding actuator limits. The analysis yields a closed-form barrier-coordinate limit determined by the left Perron vector and initial APIR mismatch. Under strong connectivity and the stated gain and compatibility conditions, partial pinning propagates a constant barrier reference from a nonempty informed subset and assigns the induced safety corridor trajectory. A non-weight-balanced example illustrates the directional certificate and predicted collective motion.

Related

  1. Admissibility-Preserving Constraint Lifting for Conditional Deadbeat Control of Discrete-Time Nonlinear Systems
    Jhon Manuel Portella Delgado, Ankit Goel
    arXivPreprintCC BY-NC-SA 4.0Full textOptimisation & controlarXiv
  2. Admissibility-Preserving Control for Multi-Input Systems with Joint Capacity Constraints
    Saurabh Kumar, Lohitvel Gopikannan, Shashi Ranjan Kumar +1
    arXivPreprintCC BY-NC-ND 4.0Full textDynamical systemsOptimisation & controlarXiv
  3. A Theory of Information Architecture for Networked Decisions: Freshness, Locality, and Coordination
    Scott Moeller, Bhaskar Krishnamachari
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  4. Additive mappings of unweighted directed graphs preserving individual values of the cycle length
    Alexander Vlasov, Alexander Guterman, Svetlana Zhilina
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  5. Admissibility and Complete Classes for False Discovery Rate Control with E-values
    Liulei Sun, Ruodu Wang
    arXivPreprintarXiv licenceFull textStatisticsarXiv
BibTeX
@misc{sinha2026networked,
  title = {{Networked Admissibility-Preserving Control for Directed Safe Coordination}},
  author = {Abhinav Sinha and Lohitvel Gopikannan and Shashi Ranjan Kumar},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.09384},
  eprint = {2609.09384},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.09384},
  note = {CC BY-NC-ND 4.0},
}
RIS
TY  - UNPB
TI  - Networked Admissibility-Preserving Control for Directed Safe Coordination
AU  - Abhinav Sinha
AU  - Lohitvel Gopikannan
AU  - Shashi Ranjan Kumar
PY  - 2026
DA  - 2026/09/08
PB  - arXiv
DO  - 10.48550/arxiv.2609.09384
UR  - https://arxiv.org/abs/2609.09384
AB  - This paper addresses safety-critical coordination for scalar agents whose distributed commands are implemented through constrained physical-input dynamics. Agents communicate over a fixed weighted digraph with a directed spanning tree, while their outputs must remain inside a common moving safety corridor and their realized inputs must satisfy heterogeneous asymmetric bounds. We propose a networked Admissibility-Preserving Control (APC) architecture in which an Admissibility-Preserving Input Realization (APIR) governs physical inputs and a logarithmic barrier coordinate represents the safety corridor. The synthesis yields an exact cascade in which exponentially decaying realization errors drive nonsymmetric consensus dynamics. For every compatible compact initial set, the closed-loop system admits a unique complete solution, renders the moving corridor and actuator intervals forward invariant with uniform margins, keeps commands bounded, and achieves exponential consensus. We derive direction-specific sufficient conditions under which positive and negative control demands remain within their corresponding actuator limits. The analysis yields a closed-form barrier-coordinate limit determined by the left Perron vector and initial APIR mismatch. Under strong connectivity and the stated gain and compatibility conditions, partial pinning propagates a constant barrier reference from a nonempty informed subset and assigns the induced safety corridor trajectory. A non-weight-balanced example illustrates the directional certificate and predicted collective motion.
ER  -