Correlated Orienteering Problem and its Application to Persistent Monitoring Tasks

We propose the correlated orienteering problem (COP) as a novel nonlinear extension to the classic orienteering problem (OP). With the introduction of COP, it becomes possible to model the planning of informative tours for the persistent monitoring of a spatiotemporal field with time-invariant spatial correlations using autonomous mobile robots, in which the robots are range- or time-constrained. Our focus in this paper is QCOP, a quadratic COP instantiation that looks at correlations between neighboring nodes in a node network. The main feature of QCOP is a quadratic utility function capturing the said spatial correlation. We solve QCOP using mixed integer quadratic programming, with the resulting anytime algorithm capable of planning multiple disjoint tours that maximize the quadratic utility. In particular, our algorithm can quickly plan a near-optimal tour over a network with up to 150 nodes. Beside performing extensive simulation studies to verify the algorithm's correctness and characterize its performance, we also successfully applied QCOP to two realistic persistent monitoring tasks: 1) estimation over a synthetic spatiotemporal field and 2) estimating the temperature distribution in the state of Massachusetts in the United States.

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

[2]  Daniela Rus,et al.  Anytime planning of optimal schedules for a mobile sensing robot , 2015, 2015 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).

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

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

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

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

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

[8]  Mac Schwager,et al.  Correlated Orienteering Problem and its application to informative path planning for persistent monitoring tasks , 2014, 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems.

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

[10]  Christos H. Papadimitriou,et al.  The Euclidean Traveling Salesman Problem is NP-Complete , 1977, Theor. Comput. Sci..

[11]  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.

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

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

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

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

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

[17]  Geoffrey A. Hollinger,et al.  Sampling-based robotic information gathering algorithms , 2014, Int. J. Robotics Res..

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

[19]  Jan Faigl,et al.  Approximate Solution of the Multiple Watchman Routes Problem With Restricted Visibility Range , 2010, IEEE Transactions on Neural Networks.

[20]  Dusan M. Stipanovic,et al.  Persistent coverage control for a team of agents with collision avoidance , 2015, Eur. J. Control.

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

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

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

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

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

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

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

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

[29]  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).

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

[31]  Alan K. Mackworth,et al.  Multi-robot repeated area coverage , 2013, Auton. Robots.

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

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

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