Finite-time connectivity preservation rendezvous with disturbance rejection

This paper introduces a discontinuous rendezvous algorithm for multi-agent systems which allows a group of agents to achieve finite-time rendezvous with connectivity preservation as well as disturbance rejection. The proposed discontinuous rendezvous algorithm is based on a class of general communication functions with certain available information range. Nonsmooth stability analysis and graph theory are employed to obtain the finite-time rendezvous. An upper bound on the convergence time is also given. Our result simultaneously satisfies the three features: connectivity preservation, disturbance rejection and finite-time convergence.

[1]  Wenwu Yu,et al.  An Overview of Recent Progress in the Study of Distributed Multi-Agent Coordination , 2012, IEEE Transactions on Industrial Informatics.

[2]  Soon-Jo Chung,et al.  Cooperative Robot Control and Concurrent Synchronization of Lagrangian Systems , 2007, IEEE Transactions on Robotics.

[3]  F. Clarke Optimization And Nonsmooth Analysis , 1983 .

[4]  Xiaoming Hu,et al.  Sufficient conditions for connectivity maintenance and rendezvous in leader-follower networks , 2010, Autom..

[5]  Brian D. O. Anderson,et al.  The Multi-Agent Rendezvous Problem. Part 2: The Asynchronous Case , 2007, SIAM J. Control. Optim..

[6]  Gang Feng,et al.  Rendezvous of mobile agents with constrained energy and intermittent communication , 2012 .

[7]  Alessandro Giua,et al.  Finite-Time Consensus With Disturbance Rejection by Discontinuous Local Interactions in Directed Graphs , 2015, IEEE Transactions on Automatic Control.

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

[9]  Richard M. Murray,et al.  Recent Research in Cooperative Control of Multivehicle Systems , 2007 .

[10]  Francesco Bullo,et al.  Coordination and Geometric Optimization via Distributed Dynamical Systems , 2003, SIAM J. Control. Optim..

[11]  Dennis S. Bernstein,et al.  Finite-Time Stability of Continuous Autonomous Systems , 2000, SIAM J. Control. Optim..

[12]  Aleksej F. Filippov,et al.  Differential Equations with Discontinuous Righthand Sides , 1988, Mathematics and Its Applications.

[13]  Sonia Martínez,et al.  Robust rendezvous for mobile autonomous agents via proximity graphs in arbitrary dimensions , 2006, IEEE Transactions on Automatic Control.

[14]  Jianbin Qiu,et al.  A novel approach to coordination of multiple robots with communication failures via proximity graph , 2011, Autom..

[15]  Dimos V. Dimarogonas,et al.  On the Rendezvous Problem for Multiple Nonholonomic Agents , 2007, IEEE Transactions on Automatic Control.

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

[17]  A. Bacciotti,et al.  Stability and Stabilization of Discontinuous Systems and Nonsmooth Lyapunov Functions , 1999 .

[18]  Randy A. Freeman,et al.  Decentralized Environmental Modeling by Mobile Sensor Networks , 2008, IEEE Transactions on Robotics.

[19]  Long Wang,et al.  Connectivity preservation for multi-agent rendezvous with link failure , 2012, Autom..

[20]  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.

[21]  S. Sastry,et al.  A calculus for computing Filippov's differential inclusion with application to the variable structure control of robot manipulators , 1987 .