A Rendezvous Algorithm for Multi-agent Systems in Disconnected Network Topologies

This paper addresses the problem of having a multi-agent system converging to a rendezvous location for networks of agents without any type of localization sensor. A central node or tower is able to determine the noisy position of each agent and transmit it using a directional antenna. Given the asynchronous communication setup, the topology will not be connected in general, which precludes the use of set-consensus algorithms available in the literature. By devising a flocking rule with mechanisms to prevent collisions, nodes explore the mission plane while maintaining the current connectivity. The process is followed by a convergence phase using a modified set-consensus algorithm with collision-free guarantees and asymptotic convergence. Results are also presented that, if there is a sufficient density of nodes, convergence occurs to a single cluster. The performance of the proposed algorithm is assessed through simulations, illustrating the cases where convergence occurs to a single or multiple clusters.

[1]  Karl Henrik Johansson,et al.  Event-triggered control for multi-agent systems , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[2]  Carlos Silvestre,et al.  Desynchronization for Decentralized Medium Access Control based on Gauss-Seidel Iterations , 2019, 2019 American Control Conference (ACC).

[3]  Carlos Silvestre,et al.  Broadcast and Gossip Stochastic Average Consensus Algorithms in Directed Topologies , 2019, IEEE Transactions on Control of Network Systems.

[4]  Carlos Silvestre,et al.  Self-Triggered and Event-Triggered Set-Valued Observers , 2018, Inf. Sci..

[5]  Carlos Silvestre,et al.  Stochastic and deterministic fault detection for randomized gossip algorithms , 2017, Autom..

[6]  Daniel Silvestre OPTool - An optimization toolbox for iterative algorithms , 2020, SoftwareX.

[7]  J. Hespanha,et al.  Set‐based fault detection and isolation for detectable linear parameter‐varying systems , 2017 .

[8]  Ruggero Carli,et al.  Quantized average consensus via dynamic coding/decoding schemes , 2008, 2008 47th IEEE Conference on Decision and Control.

[9]  Karl Henrik Johansson,et al.  Distributed self-triggered control for multi-agent systems , 2010, 49th IEEE Conference on Decision and Control (CDC).

[10]  Magnus Egerstedt,et al.  Set-valued protocols for almost consensus of multiagent systems with uncertain interagent communication , 2014, 2014 American Control Conference.

[11]  Carlos Silvestre,et al.  Set-Consensus using Set-Valued Observers , 2015 .

[12]  Sandro Zampieri,et al.  Average consensus with packet drop communication , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[13]  Amr El Abbadi,et al.  Convergence Rates of Distributed Average Consensus With Stochastic Link Failures , 2010, IEEE Transactions on Automatic Control.

[14]  Carlos Silvestre,et al.  Fault detection for LPV systems using Set-Valued Observers: A coprime factorization approach , 2017, Syst. Control. Lett..

[15]  Richard M. Murray,et al.  Consensus problems in networks of agents with switching topology and time-delays , 2004, IEEE Transactions on Automatic Control.

[16]  Carlos Silvestre,et al.  Average consensus and gossip algorithms in networks with stochastic asymmetric communications , 2011, IEEE Conference on Decision and Control and European Control Conference.

[17]  Jeff S. Shamma,et al.  Set-valued observers and optimal disturbance rejection , 1999, IEEE Trans. Autom. Control..