Correlated Orienteering Problem and its application to informative path planning for persistent monitoring tasks

We propose a novel non-linear extension to the Orienteering Problem (OP), called the Correlated Orienteering Problem (COP). We use COP to plan informative tours (cyclic paths) for persistent monitoring of an environment with spatial correlations, where the tours are constrained to a fixed length or time budget. The main feature of COP is a quadratic utility function that captures spatial correlations among points of interest that are close to each other. COP may be solved using mixed integer quadratic programming (MIQP) that can plan multiple disjoint tours that maximize the quadratic utility function. We perform extensive characterization of our method to verify its correctness, as well as its applicability to the estimation of a realistic, time-varying, and spatially correlated scalar field.

[1]  Elon Rimon,et al.  Competitive on-line coverage of grid environments by a mobile robot , 2003, Comput. Geom..

[2]  S. LaValle Rapidly-exploring random trees : a new tool for path planning , 1998 .

[3]  Mac Schwager,et al.  Planning periodic persistent monitoring trajectories for sensing robots in Gaussian Random Fields , 2013, 2013 IEEE International Conference on Robotics and Automation.

[4]  Daniela Rus,et al.  Persistent monitoring of events with stochastic arrivals at multiple stations , 2013, 2014 IEEE International Conference on Robotics and Automation (ICRA).

[5]  Richard M. Karp,et al.  Reducibility among combinatorial problems" in complexity of computer computations , 1972 .

[6]  Gaurav S. Sukhatme,et al.  Persistent ocean monitoring with underwater gliders: Adapting sampling resolution , 2011, J. Field Robotics.

[7]  B. Faverjon,et al.  Probabilistic Roadmaps for Path Planning in High-Dimensional Con(cid:12)guration Spaces , 1996 .

[8]  Emilio Frazzoli,et al.  Sampling-based algorithms for optimal motion planning , 2011, Int. J. Robotics Res..

[9]  Munther A. Dahleh,et al.  Continuous path planning for a data harvesting mobile server , 2008, 2008 47th IEEE Conference on Decision and Control.

[10]  Dirk Van Oudheusden,et al.  The orienteering problem: A survey , 2011, Eur. J. Oper. Res..

[11]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[12]  Geoffrey A. Hollinger,et al.  Sampling-based Motion Planning for Robotic Information Gathering , 2013, Robotics: Science and Systems.

[13]  G. Laporte The traveling salesman problem: An overview of exact and approximate algorithms , 1992 .

[14]  Dusan M. Stipanovic,et al.  On persistent coverage control , 2007, 2007 46th IEEE Conference on Decision and Control.

[15]  Nuno C. Martins,et al.  Memoryless Control Design for Persistent Surveillance under Safety Constraints , 2012, ArXiv.

[16]  Bruce L. Golden,et al.  A fast and effective heuristic for the orienteering problem , 1996 .

[17]  Howie Choset,et al.  Coverage of Known Spaces: The Boustrophedon Cellular Decomposition , 2000, Auton. Robots.

[18]  Nathan Michael,et al.  Persistent surveillance with a team of MAVs , 2011, 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[19]  Bruce L. Golden,et al.  The team orienteering problem , 1996 .

[20]  Howie Choset,et al.  Coverage for robotics – A survey of recent results , 2001, Annals of Mathematics and Artificial Intelligence.

[21]  Mac Schwager,et al.  Persistent Robotic Tasks: Monitoring and Sweeping in Changing Environments , 2011, IEEE Transactions on Robotics.

[22]  Simeon C. Ntafos,et al.  Watchman Routes Under Limited Visibility , 1991, Comput. Geom..

[23]  J.K. Hedrick,et al.  Border patrol and surveillance missions using multiple unmanned air vehicles , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[24]  Simeon C. Ntafos,et al.  Optimum watchman routes , 1986, SCG '86.

[25]  Mac Schwager,et al.  Generating informative paths for persistent sensing in unknown environments , 2012, 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[26]  Vijay Kumar,et al.  Cooperative air and ground surveillance , 2006, IEEE Robotics & Automation Magazine.

[27]  I. Kroo,et al.  Persistent Surveillance Using Multiple Unmanned Air Vehicles , 2008, 2008 IEEE Aerospace Conference.

[28]  Elaheh Fata,et al.  Persistent monitoring in discrete environments: Minimizing the maximum weighted latency between observations , 2012, Int. J. Robotics Res..