arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1409.8536cs.RO
收藏

最优旅游者问题与旅游行程的随时规划

Optimal Tourist Problem and Anytime Planning of Trip Itineraries

Massachusetts Institute of Technology(麻省理工学院);Northeastern University(东北大学)

Jingjin Yu, Javed Aslam, Sertac Karaman, Daniela Rus

摘要:

我们介绍和研究的问题,其中一个移动传感机器人(我们的游客)的任务是在一组空间分布的兴趣点(POI)之间旅行和收集情报。在每个POI处收集的信息的质量的特征在于在POI处花费的时间上的某个非递减奖励函数。在有限的时间预算下,机器人必须在花费时间旅行到POI和花费时间在POI处进行信息收集(感测)之间进行平衡,以使总回报最大化。或者,机器人可能需要获得最小数量的奖励,并希望用最少的时间来完成。我们提出了一个基于混合整数规划(MIP)的任意时间算法来解决这两个NP-难优化问题,以任意精度。我们的算法的有效性证明了使用广泛的一组计算实验,包括规划一个现实的行程,首次在伊斯坦布尔的游客。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑