Submodularity in Systems with Higher Order Consensus with Absolute Information

TL;DR

This paper analyzes higher-order consensus systems with absolute information, establishing stability conditions, deriving coherence expressions, and demonstrating that leader selection for optimal coherence is a submodular optimization problem solvable by greedy algorithms.

Contribution

It introduces a submodular set function framework for leader selection in higher-order consensus systems, enabling efficient near-optimal solutions.

Findings

Stability conditions for second, third, and fourth order systems derived.

Set functions for coherence are proven to be submodular.

Greedy algorithms achieve near-optimal leader sets for coherence optimization.

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.