Design Guarantees for Resilient Robot Formations on Lattices

This letter presents guarantees to satisfy resilience on the communication network of robot formations. In these resilient networks, cooperative robots can achieve consensus in the presence of faulty or malicious robots. We propose a design framework on triangular and square lattices, providing an underlying structure for proximity-based robot networks. We present sufficient conditions on the robot communication range to guarantee resilient consensus. Our results can be used to design robot formations considering obstacles, number of robots, and energy usage. Additionally, robot networks with homogeneous and heterogeneous communication range are studied. We support our theoretical analysis with simulations on selected scenarios.

[1]  Ali Jadbabaie,et al.  Decentralized Control of Connectivity for Multi-Agent Systems , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[2]  Reza Olfati-Saber,et al.  Flocking for multi-agent dynamic systems: algorithms and theory , 2006, IEEE Transactions on Automatic Control.

[3]  E.M. Atkins,et al.  A survey of consensus problems in multi-agent coordination , 2005, Proceedings of the 2005, American Control Conference, 2005..

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

[5]  Shreyas Sundaram,et al.  Robustness of information diffusion algorithms to locally bounded adversaries , 2011, 2012 American Control Conference (ACC).

[6]  Nak Young Chong,et al.  A geometric approach to deploying robot swarms , 2008, Annals of Mathematics and Artificial Intelligence.

[7]  Shreyas Sundaram,et al.  A Notion of Robustness in Complex Networks , 2015, IEEE Transactions on Control of Network Systems.

[8]  Vijay Kumar,et al.  Formations for Resilient Robot Teams , 2017, IEEE Robotics and Automation Letters.

[9]  Vijay Kumar,et al.  Triangular Networks for Resilient Formations , 2016, DARS.

[10]  Vijay Kumar,et al.  Resilient consensus for time-varying networks of dynamic agents , 2017, 2017 American Control Conference (ACC).

[11]  Vijay Kumar,et al.  Connectivity management in mobile robot teams , 2008, 2008 IEEE International Conference on Robotics and Automation.

[12]  Magnus Egerstedt,et al.  POSITIVSTELLENSATZ CERTIFICATES FOR NON-FEASIBILITY OF CONNECTIVITY GRAPHS IN MULTI-AGENT COORDINATION , 2005 .

[13]  Reza Olfati-Saber,et al.  Consensus and Cooperation in Networked Multi-Agent Systems , 2007, Proceedings of the IEEE.

[14]  Shreyas Sundaram,et al.  Resilient Asymptotic Consensus in Robust Networks , 2013, IEEE Journal on Selected Areas in Communications.

[15]  Luis Guerrero-Bonilla,et al.  Resilient Backbones in Hexagonal Robot Formations , 2018, DARS.

[16]  Xenofon D. Koutsoukos,et al.  Algorithms for determining network robustness , 2013, HiCoNS '13.

[17]  Shreyas Sundaram,et al.  Robustness and Algebraic Connectivity of Random Interdependent Networks , 2015, ArXiv.

[18]  Antonio Bicchi,et al.  On the robust synthesis of logical consensus algorithms for distributed intrusion detection , 2013, Autom..

[19]  Seth Hutchinson,et al.  A distributed robust convergence algorithm for multi-robot systems in the presence of faulty robots , 2015, 2015 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).

[20]  Vijay Kumar,et al.  ModQuad: The Flying Modular Structure that Self-Assembles in Midair , 2018, 2018 IEEE International Conference on Robotics and Automation (ICRA).

[21]  Vijay Kumar,et al.  Resilient Flocking for Mobile Robot Teams , 2017, IEEE Robotics and Automation Letters.