Combined Top-down and Bottom-up Approach to Cooperative Distributed Multi-agent Control with Connectivity Constraints

Abstract We propose a novel framework to synthesize coordination and control strategies for multi-agent systems from team tasks that are in the form of regular languages specifying service requests. The framework incorporates top-down design approaches with bottom-up control schemes: on one hand, a formal approach is applied to distribute the local tasks based on service capabilities of each agent and to synthesize local supervisors associated with each agent to fulfill the local tasks; on the other hand, by modeling the physical motion dynamics of an agent as a single integrator system, a connectivity-preserving controller with only position measurements is designed such that motion behaviors of cooperating agents are subject to communication constraints. The performance of the underlying framework is guaranteed by using a technique that is inspired by compositional verification while the communication constraints can always be obeyed. A motion and mission co-planning example of a robotic system is presented.

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

[2]  Karl Henrik Johansson,et al.  Bounded control of network connectivity in multi-agent systems , 2010 .

[3]  Hai Lin,et al.  Learning based supervisor synthesis of POMDP for PCTL specifications , 2015, 2015 54th IEEE Conference on Decision and Control (CDC).

[4]  Christos G. Cassandras,et al.  Introduction to Discrete Event Systems , 1999, The Kluwer International Series on Discrete Event Dynamic Systems.

[5]  Warren E. Dixon,et al.  Network Connectivity Preserving Formation Stabilization and Obstacle Avoidance via a Decentralized Controller , 2012, IEEE Transactions on Automatic Control.

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

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

[8]  R.M. Murray,et al.  Motion planning with wireless network constraints , 2005, Proceedings of the 2005, American Control Conference, 2005..

[9]  George J. Pappas,et al.  Hybrid Control for Connectivity Preserving Flocking , 2009, IEEE Transactions on Automatic Control.

[10]  Calin Belta,et al.  Automatic Deployment of Distributed Teams of Robots From Temporal Logic Motion Specifications , 2010, IEEE Transactions on Robotics.

[11]  Xinping Guan,et al.  Connectivity-Preserving Consensus Algorithms for Multi-agent Systems , 2011 .

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

[13]  Richard M. Murray,et al.  Information flow and cooperative control of vehicle formations , 2004, IEEE Transactions on Automatic Control.

[14]  Mario F. M. Campos,et al.  Decentralized motion planning for multiple robots subject to sensing and communication constraints , 2003 .

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

[16]  Wei Ren On Consensus Algorithms for Double-Integrator Dynamics , 2008, IEEE Trans. Autom. Control..

[17]  Magnus Egerstedt,et al.  Graph-theoretic connectivity control of mobile robot networks , 2011, Proceedings of the IEEE.

[18]  Vijay Kumar,et al.  Decentralized Feedback Controllers for Multiagent Teams in Environments With Obstacles , 2010, IEEE Trans. Robotics.

[19]  Hai Lin,et al.  Automatic synthesis of cooperative multi-agent systems , 2014, 53rd IEEE Conference on Decision and Control.

[20]  Daniel E. Koditschek,et al.  Exact robot navigation using artificial potential functions , 1992, IEEE Trans. Robotics Autom..

[21]  P. Ramadge,et al.  Supervisory control of a class of discrete event processes , 1987 .

[22]  Hai Lin,et al.  Counterexample-guided permissive supervisor synthesis for probabilistic systems through learning , 2015, 2015 American Control Conference (ACC).

[23]  Hai Lin,et al.  Guaranteed global performance through local coordinations , 2011, Autom..

[24]  Howard Barringer,et al.  Learning to divide and conquer: applying the L* algorithm to automate assume-guarantee reasoning , 2008, Formal Methods Syst. Des..

[25]  Michael Heymann,et al.  Supervisory control of concurrent discrete-event systems , 1991 .

[26]  Yushan Chen,et al.  Formal Approach to the Deployment of Distributed Robotic Teams , 2012, IEEE Transactions on Robotics.