Rendezvous with connectivity preservation of mobile agents subject to uniform time-delays

This paper investigates the problem of rendezvous with connectivity preservation for a group of mobile agents subject to both unknown input delay and unknown communication delay. We propose a new potential function and design a potential function based distributed control law. To tackle unknown time-delays, we introduce a control gain in the control law and develop an energy functional to characterize the energy of the whole system. By analyzing the energy change, the control gain is designed. It is shown that as long as the communication network is connected at the initial time, the proposed control law can make all agents reach the same location and maintain connectivity of the communication network for all time. Meanwhile, it can accommodate arbitrarily bounded uniform constant input delay and communication delay.

[1]  Yi Dong,et al.  Leader-Following Connectivity Preservation Rendezvous of Multiple Double Integrator Systems Based on Position Measurement Only , 2014, IEEE Transactions on Automatic Control.

[2]  Guanrong Chen,et al.  A connectivity-preserving flocking algorithm for multi-agent systems based only on position measurements , 2009, Int. J. Control.

[3]  Gang Feng,et al.  Virtual neighbor based connectivity preserving of multi-agent systems with bounded control inputs in the presence of unreliable communication links , 2013, Autom..

[4]  Magnus Egerstedt,et al.  Distributed Coordination Control of Multiagent Systems While Preserving Connectedness , 2007, IEEE Transactions on Robotics.

[5]  Meng Ji,et al.  Connectedness preserving distributed coordination control over dynamic graphs , 2005, Proceedings of the 2005, American Control Conference, 2005..

[6]  George J. Pappas,et al.  Potential Fields for Maintaining Connectivity of Mobile Networks , 2007, IEEE Transactions on Robotics.

[7]  Weiping Li,et al.  Applied Nonlinear Control , 1991 .

[8]  Jie Lin,et al.  Coordination of groups of mobile autonomous agents using nearest neighbor rules , 2003, IEEE Trans. Autom. Control..

[9]  Zhiyong Chen,et al.  How Much Control is Enough for Network Connectivity Preservation and Collision Avoidance? , 2015, IEEE Transactions on Cybernetics.

[10]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.

[11]  Yi Dong,et al.  A leader-following rendezvous problem of double integrator multi-agent systems , 2013, Autom..

[12]  L. Moreau,et al.  Stability of continuous-time distributed consensus algorithms , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

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

[14]  Xiao Fan Wang,et al.  Rendezvous of multiple mobile agents with preserved network connectivity , 2010, Syst. Control. Lett..

[15]  Frédéric Mazenc,et al.  Backstepping design for time-delay nonlinear systems , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[16]  Mark W. Spong,et al.  Preserving Strong Connectivity in Directed Proximity Graphs , 2017, IEEE Transactions on Automatic Control.

[17]  Youfeng Su,et al.  Leader-following rendezvous with connectivity preservation and disturbance rejection via internal model approach , 2015, Autom..

[18]  Michael M. Zavlanos,et al.  Distributed Intermittent Connectivity Control of Mobile Robot Networks , 2017, IEEE Transactions on Automatic Control.

[19]  Jie Huang,et al.  The leader-following rendezvous with connectivity preservation via a self-tuning adaptive distributed observer , 2016, ICIA.

[20]  Guoqiang Hu,et al.  Connectivity-preserving rendezvous of multi-agent systems with event-triggered controllers , 2015, 2015 54th IEEE Conference on Decision and Control (CDC).