Submodularity in Systems with Higher Order Consensus with Absolute Information
Preprint
Abstract
We investigate the performance of m-th order consensus systems with stochastic external perturbations, where a subset of leader nodes incorporates absolute information into their control laws. The system performance is measured by its coherence, an $H_2$ norm that quantifies the total steady-state variance of the deviation from the desired trajectory. We first give conditions under which such systems are stable, and we derive expressions for coherence in stable second, third, and fourth order systems. We next study the problem of how to identify a set of leaders that optimizes coherence. To address this problem, we define set functions that quantify each system's coherence and prove that these functions are submodular. This allows the use of an efficient greedy algorithm that to find a leader set with which coherence is within a constant bound of optimal. We demonstrate the performance of the greedy algorithm empirically, and further, we show that the optimal leader sets for the different orders of consensus dynamics do not necessarily coincide.
Keywords
All Related Versions
This publication has 22 references indexed in Scilit:
- Necessary and sufficient conditions for consensus in third order multi-agent systemsIEEE/CAA Journal of Automatica Sinica, 2018
- Third-order consensus in vehicles platoon with heterogeneous time-varying delaysIFAC-PapersOnLine, 2015
- Second-Order Consensus of Leader-Following Multi-Agent Systems with Jointly Connected Topologies and Time-Varying DelaysArabian Journal for Science and Engineering, 2013
- Stability and robustness of large platoons of vehicles with double‐integrator models and nearest neighbor interactionInternational Journal of Robust and Nonlinear Control, 2012
- Coherence in Large-Scale Networks: Dimension-Dependent Limitations of Local FeedbackIEEE Transactions on Automatic Control, 2012
- Passivity-based formation control of autonomous underwater vehiclesIET Control Theory & Applications, 2012
- High-Order Consensus Algorithms in Cooperative Vehicle Systems2006
- Graph properties for splitting with grounded Laplacian matricesBIT Numerical Mathematics, 1993
- An analysis of approximations for maximizing submodular set functions—IMathematical Programming, 1978
- Ueber die Bedingungen, unter welchen eine Gleichung nur Wurzeln mit negativen reellen Theilen besitztMathematische Annalen, 1895