Control for Localization and Visibility Maintenance of an Independent Agent using Robotic Teams

Given a non-cooperative agent, we seek to formulate a control strategy to enable a team of robots to localize and track the agent in a complex but known environment while maintaining a continuously optimized line-ofsight communication chain to a fixed base station. We focus on two aspects of the problem. First, we investigate the estimation of the agent's location by using nonlinear sensing modalities, in particular that of range-only sensing, and formulate a control strategy based on improving this estimation using one or more robots working to independently gather information. Second, we develop methods to plan and sequence robot deployments that will establish and maintain line-of-sight chains for communication between the independent agent and the fixed base station using a minimum number of robots. These methods will lead to feedback control laws that can realize this plan and ensure proper navigation and collision avoidance. Degree Type Dissertation Degree Name Doctor of Philosophy (PhD) Graduate Group Mechanical Engineering & Applied Mechanics First Advisor Vijay Kumar

[1]  Ali Jadbabaie,et al.  Distributed Geodesic Control Laws for Flocking of Nonholonomic Agents , 2007, IEEE Transactions on Automatic Control.

[2]  Federico Thomas,et al.  An ellipsoidal calculus based on propagation and fusion , 2002, IEEE Trans. Syst. Man Cybern. Part B.

[3]  Marcelo H. Ang,et al.  A greedy strategy for tracking a locally predictable target among obstacles , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[4]  Stephen P. Boyd,et al.  Gossip algorithms: design, analysis and applications , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[5]  Gregory D. Hager,et al.  Real-time vision-based robot localization , 1993, IEEE Trans. Robotics Autom..

[6]  Qun Li,et al.  Sending messages to mobile users in disconnected ad-hoc wireless networks , 2000, MobiCom '00.

[7]  Masafumi Yamashita,et al.  Searching for a Mobile Intruder in a Polygonal Region , 1992, SIAM J. Comput..

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

[9]  M. Krstić,et al.  Real-Time Optimization by Extremum-Seeking Control , 2003 .

[10]  Steven M. LaValle,et al.  Gap Navigation Trees: Minimal Representation for Visibility-based Tasks , 2004, WAFR.

[11]  Hans Jürgen Prömel,et al.  A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3 , 2000, J. Algorithms.

[12]  M. Overmars,et al.  Approximating generalized Voronoi diagrams in any dimension , 1995 .

[13]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[14]  Héctor H. González-Baños,et al.  Motion strategies for maintaining visibility of a moving target , 1997, Proceedings of International Conference on Robotics and Automation.

[15]  Sebastian Thrun,et al.  Probabilistic robotics , 2002, CACM.

[16]  Keiji Nagatani,et al.  Towards exact localization without explicit localization with the generalized Voronoi graph , 1998, Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146).

[17]  E. Alper Yildirim,et al.  On the Minimum Volume Covering Ellipsoid of Ellipsoids , 2006, SIAM J. Optim..

[18]  Libor Preucil,et al.  European Robotics Symposium 2008 , 2008 .

[19]  Michael Rovatsos,et al.  Capturing agent autonomy in roles and XML , 2003, AAMAS '03.

[20]  Howie Choset,et al.  Sensor-Based Exploration: The Hierarchical Generalized Voronoi Graph , 2000, Int. J. Robotics Res..

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

[22]  Vijay Kumar,et al.  Synergies in Feature Localization by Air-Ground Robot Teams , 2004, ISER.

[23]  Der-Tsai Lee.  Proximity and reachability in the plane. , 1978 .

[24]  A. Jadbabaie,et al.  On the stability of the Kuramoto model of coupled nonlinear oscillators , 2005, Proceedings of the 2004 American Control Conference.

[25]  Karl Henrik Johansson,et al.  An experimental study of exploiting multipath fading for robot communications , 2007, Robotics: Science and Systems.

[26]  Victor Lesser,et al.  A mediation-based approach to cooperative, distributed problem solving , 2004 .

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

[28]  Vijay Kumar,et al.  Robot and sensor networks for first responders , 2004, IEEE Pervasive Computing.

[29]  Leonidas J. Guibas,et al.  Visibility-Based Pursuit-Evasion in a Polygonal Environment , 1997, WADS.

[30]  F. Daum.  Nonlinear filters: beyond the Kalman filter , 2005, IEEE Aerospace and Electronic Systems Magazine.

[31]  M. Ani Hsieh,et al.  Towards the deployment of a mobile robot network with end-to-end performance guarantees , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[32]  Sourabh Bhattacharya,et al.  Motion Strategies for Surveillance , 2007, Robotics: Science and Systems.

[33]  Leonidas J. Guibas,et al.  The complexity and construction of many faces in arrangements of lines and of segments , 1990, Discret. Comput. Geom..

[34]  Yoshiki Kuramoto,et al.  Self-entrainment of a population of coupled non-linear oscillators , 1975 .

[35]  David J. Kriegman,et al.  Computing exact aspect graphs of curved objects: Algebraic surfaces , 1990, International Journal of Computer Vision.

[36]  F. Bullo,et al.  Visibility-based multi-agent deployment in orthogonal environments , 2007, 2007 American Control Conference.

[37]  Martin Fürer,et al.  Approximating the Minimum-Degree Steiner Tree to within One of Optimal , 1994, J. Algorithms.

[38]  Scott Shenker,et al.  Geographic routing without location information , 2003, MobiCom '03.

[39]  Z. A. Melzak.  On the Problem of Steiner , 1961, Canadian Mathematical Bulletin.

[40]  Steven M. LaValle,et al.  Planning algorithms , 2006 .

[41]  John G. Proakis,et al.  Digital Communications , 1983 .

[42]  Dieter Fox,et al.  Centibots: Very Large Scale Distributed Robotic Teams , 2004, AAAI.

[43]  Mariette Yvinec,et al.  Dynamic location in an arrangement of line segments in the plane , 1991 .

[44]  Prithwish Basu,et al.  Movement control algorithms for realization of fault-tolerant ad hoc robot networks , 2004, IEEE Network.

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

[46]  S. E. Dreyfus,et al.  The steiner problem in graphs , 1971, Networks.

[47]  J. Kahn,et al.  Traditional Galleries Require Fewer Watchmen , 1983 .

[48]  Karl Henrik Johansson,et al.  Communication-aware trajectory tracking , 2008, 2008 IEEE International Conference on Robotics and Automation.

[49]  Marcelo H. Ang,et al.  Motion Planning for 3-D Target Tracking among Obstacles , 2007, ISRR.

[50]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[51]  George J. Pappas,et al.  Stable flocking of mobile agents, part I: fixed topology , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[52]  Uwe D. Hanebeck,et al.  Localization of a mobile robot using relative bearing measurements , 2004, IEEE Transactions on Robotics and Automation.

[53]  Francesco Bullo,et al.  A ladybug exploration strategy for distributed adaptive coverage control , 2008, 2008 IEEE International Conference on Robotics and Automation.

[54]  Roger Mailler,et al.  Commbots: Distributed control of mobile communication relays , 2006 .

[55]  Donald F. Towsley,et al.  Relays, base stations, and meshes: enhancing mobile networks with infrastructure , 2008, MobiCom '08.

[56]  Kurt Konolige,et al.  Large-Scale Map-Making , 2004, AAAI.

[57]  Alex Zelikovsky,et al.  Improved Steiner tree approximation in graphs , 2000, SODA '00.

[58]  Chak-Kuen Wong,et al.  A faster approximation algorithm for the Steiner problem in graphs , 1986, Acta Informatica.

[59]  Henrik I. Christensen,et al.  Graphical SLAM - a self-correcting map , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

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

[61]  J. Schwartz,et al.  On the “piano movers'” problem I. The case of a two‐dimensional rigid polygonal body moving amidst polygonal barriers , 1983 .

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

[63]  Niklaus Wirth,et al.  Algorithms and Data Structures , 1989, Lecture Notes in Computer Science.

[64]  Kevin P. Murphy,et al.  Bayesian Map Learning in Dynamic Environments , 1999, NIPS.

[65]  Wei Yang,et al.  Robotic Routers: Algorithms and Implementation , 2009, Int. J. Robotics Res..

[66]  Fred Daum.  New exact nonlinear filters: theory and applications , 1994, Defense, Security, and Sensing.

[67]  Richard Bishop,et al.  Pursuit and Evasion in Non-convex Domains of Arbitrary Dimensions , 2006, Robotics: Science and Systems.

[68]  Wolfram Burgard,et al.  Monte Carlo Localization: Efficient Position Estimation for Mobile Robots , 1999, AAAI/IAAI.

[69]  Thierry Siméon,et al.  Path coordination for multiple mobile robots: a resolution-complete algorithm , 2002, IEEE Trans. Robotics Autom..

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

[71]  George J. Pappas,et al.  Stable flocking of mobile agents part I: dynamic topology , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[72]  A. Cayley.  A theorem on trees , 2009 .

[73]  G. Swaminathan.  Robot Motion Planning , 2006 .

[74]  V. Chvátal.  A combinatorial theorem in plane geometry , 1975 .

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

[76]  Ronald C. Arkin,et al.  Line-of-sight constrained exploration for reactive multiagent robotic teams , 2002, 7th International Workshop on Advanced Motion Control. Proceedings (Cat. No.02TH8623).

[77]  Jie Lin,et al.  The multi-agent rendezvous problem , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[78]  George J. Pappas,et al.  Controlling Connectivity of Dynamic Graphs , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[79]  F. Hwang,et al.  A linear time algorithm for full steiner trees , 1986 .

[80]  Sonia Martínez,et al.  Coverage control for mobile sensing networks , 2002, IEEE Transactions on Robotics and Automation.

[81]  Jean-Paul Laumond,et al.  A Complexity result for the pursuit-evasion game of maintaining visibility of a moving evader , 2008, 2008 IEEE International Conference on Robotics and Automation.

[82]  Vijay Kumar,et al.  Maintaining Connectivity in Mobile Robot Networks , 2008, ISER.

[83]  Héctor H. González-Baños,et al.  Real-time combinatorial tracking of a target moving unpredictably among obstacles , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[84]  Peter I. Corke,et al.  Further Results with Localization and Mapping Using Range from Radio , 2005, FSR.

[85]  Rafael Murrieta-Cid,et al.  A Sampling-Based Motion Planning Approach to Maintain Visibility of Unpredictable Targets , 2005, Auton. Robots.

[86]  U. Hanebeck.  Recursive nonlinear set-theoretic estimation based on pseudo ellipsoids , 2001, Conference Documentation International Conference on Multisensor Fusion and Integration for Intelligent Systems. MFI 2001 (Cat. No.01TH8590).

[87]  Vijay Kumar,et al.  Distributed Search and Rescue with Robot and Sensor Teams , 2003, FSR.

[88]  Xiaohua Jia,et al.  Fixed Topology Steiner Trees and Spanning Forests , 1999, Theor. Comput. Sci..

[89]  Mark H. Overmars,et al.  New methods for computing visibility graphs , 1988, SCG '88.

[90]  J. Steiner.  Einige Gesetze über die Theilung der Ebene und des Raumes. , 1826 .

[91]  Mac Schwager,et al.  Distributed Coverage Control with Sensory Feedback for Networked Robots , 2006, Robotics: Science and Systems.

[92]  Makoto Yokoo,et al.  An asynchronous complete method for distributed constraint optimization , 2003, AAMAS '03.

[93]  George J. Pappas,et al.  Distributed connectivity control of mobile networks , 2007, 2007 46th IEEE Conference on Decision and Control.

[94]  George Markowsky,et al.  A fast algorithm for Steiner trees , 1981, Acta Informatica.

[95]  Gordon L. Stüber.  Principles of mobile communication , 1996 .

[96]  F. Schweppe.  Recursive state estimation: Unknown but bounded errors and system inputs , 1967 .

[97]  Eric W. Frew,et al.  Maintaining Optimal Communication Chains in Robotic Sensor Networks using Mobility Control , 2007, Mob. Networks Appl..

[98]  George J. Pappas,et al.  Flocking in Fixed and Switching Networks , 2007, IEEE Transactions on Automatic Control.

[99]  Sampath Kannan,et al.  Randomized pursuit-evasion in a polygonal environment , 2005, IEEE Transactions on Robotics.

[100]  Andrea Garulli,et al.  A Set Theoretic Approach to Dynamic Robot Localization and Mapping , 2004, Auton. Robots.

[101]  Vijay Kumar,et al.  Control for Localization of Targets using Range-only Sensors , 2009, Int. J. Robotics Res..

[102]  Jie Lin,et al.  Towards mobility as a network control primitive , 2004, MobiHoc '04.

[103]  Yu Hu,et al.  An O(nlogn) algorithm for obstacle-avoiding routing tree construction in the λ-geometry plane , 2006, ISPD '06.

[104]  Camillo J. Taylor,et al.  A bounded uncertainty approach to multi-robot localization , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).