A semidefinite programming framework for controlling multi-robot systems in dynamic environments

In this paper, a discrete-time, semidefinite programming (SDP) framework is synthesized for controlling mobile robot teams operating in dynamic environments. Given an initially feasible configuration, the proffered framework embeds formation shape control and guarantees inter-agent and agent-obstacle collision avoidance and network interconnectivity across the formation given a sufficiently small Δt - provided that a feasible solution exists. Additionally, it affords goal-directed behaviors, which are explored, most notably, in terms of its application to directional coverage control, where the objective is to ensure that a set of mobile targets are being observed by at least a single member of the team at any given time. Central to our formulation is melding the recent application of shape theoretic constructs to globally optimal shape planning with state-dependent graphs whose enforced connectivity (gauged via their Fiedler value) implies satisfaction of the aforementioned constraints. Simulation results are presented to highlight the utility of our approach.

[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]  Sonia Martínez,et al.  Coverage control for mobile sensing networks , 2002, IEEE Transactions on Robotics and Automation.

[3]  Vijay Kumar,et al.  Synthesis of Controllers to Create, Maintain, and Reconfigure Robot Formations with Communication Constraints , 2009, ISRR.

[4]  Naomi Ehrich Leonard,et al.  Shape Control of a Multi-agent System Using Tensegrity Structures , 2007 .

[5]  David G. Kendall,et al.  Shape & Shape Theory , 1999 .

[6]  Ruggero Carli,et al.  Gossip Coverage Control for Robotic Networks: Dynamical Systems on the Space of Partitions , 2009, SIAM J. Control. Optim..

[7]  M. Ani Hsieh,et al.  Decentralized controllers for shape generation with robotic swarms , 2008, Robotica.

[8]  M. Ani Hsieh,et al.  An Optimal Approach to Collaborative Target Tracking with Performance Guarantees , 2009, J. Intell. Robotic Syst..

[9]  Petter Ögren,et al.  Cooperative control of mobile sensor networks:Adaptive gradient climbing in a distributed environment , 2004, IEEE Transactions on Automatic Control.

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

[11]  Vijay Kumar,et al.  Simultaneous Coverage and Tracking (SCAT) of Moving Targets with Robot Networks , 2008, WAFR.

[12]  Guangming Xie,et al.  Flexible Formation Control for Obstacle Avoidance Based on Numerical Flow Field , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

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

[14]  John R. Spletzer,et al.  Convex Optimization Strategies for Coordinating Large-Scale Robot Formations , 2007, IEEE Transactions on Robotics.

[15]  T. K. Carne,et al.  Shape and Shape Theory , 1999 .

[16]  Fumin Zhang Cooperative shape control of particle formations , 2007, 2007 46th IEEE Conference on Decision and Control.

[17]  Mac Schwager,et al.  Decentralized, Adaptive Coverage Control for Networked Robots , 2009, Int. J. Robotics Res..

[18]  Mehran Mesbahi,et al.  On maximizing the second smallest eigenvalue of a state-dependent graph Laplacian , 2006, IEEE Transactions on Automatic Control.