Optimal Tourist Problem and Anytime Planning of Trip Itineraries

We introduce and study the problem in which a mobile sensing robot (our tourist) is tasked to travel among and gather intelligence at a set of spatially distributed point-of-interests (POIs). The quality of the information collected at each POI is characterized by some non-decreasing reward function over the time spent at the POI. With limited time budget, the robot must balance between spending time traveling to POIs and spending time at POIs for information collection (sensing) so as to maximize the total reward. Alternatively, the robot may be required to acquire a minimum mount of reward and hopes to do so with the least amount of time. We propose a mixed integer programming (MIP) based anytime algorithm for solving these two NP-hard optimization problems to arbitrary precision. The effectiveness of our algorithm is demonstrated using an extensive set of computational experiments including the planning of a realistic itinerary for a first-time tourist in Istanbul.

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

[2]  Cong Yu,et al.  Interactive itinerary planning , 2011, 2011 IEEE 27th International Conference on Data Engineering.

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

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

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

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

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

[8]  Chandra Chekuri,et al.  Improved algorithms for orienteering and related problems , 2008, SODA '08.

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

[10]  David Hsu,et al.  Adaptive informative path planning in metric spaces , 2015, Int. J. Robotics Res..

[11]  Gilbert Laporte,et al.  The orienteering problem with variable profits , 2013, Networks.

[12]  Chandra Chekuri,et al.  A recursive greedy algorithm for walks in directed graphs , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[13]  Xing Xie,et al.  Social itinerary recommendation from user-generated digital trails , 2012, Personal and Ubiquitous Computing.

[14]  Stephen Warshall,et al.  A Theorem on Boolean Matrices , 1962, JACM.

[15]  Cong Yu,et al.  Automatic construction of travel itineraries using social breadcrumbs , 2010, HT '10.

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

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

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

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

[20]  Charalampos Konstantopoulos,et al.  A survey on algorithmic approaches for solving tourist trip design problems , 2014, Journal of Heuristics.

[21]  Ailsa H. Land,et al.  An Automatic Method of Solving Discrete Programming Problems , 1960 .

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