Distributed constrained connectivity control for proximity networks based on a receding horizon scheme

In this paper, we propose a distributed constrained connectivity control algorithm for a network of dynamically decoupled agents with constrained discrete-time linear dynamics. This control algorithm works based on a receding horizon control (RHC) scheme and acts as a middleware that modifies the set-points defined by the user or by high-level control units whenever their direct application would violate system constraints. To guarantee the connectivity of the communication graph, the algorithm enforces that a specific spanning tree exists at each time. The algorithm is allowed, under certain conditions, to switch between interaction graphs in order to enhance system performance. Among all possible spanning trees, we propose to use the Euclidean Minimum Spanning Tree (EMST), and we study its advantages. The overall algorithm is described, and some of its properties are pointed out. Some simulations conclude the paper and show the effectiveness of the proposed method.