Ten Open Problems in Rendezvous Search
Ten Open Problems in Rendezvous Search
复制标题
集合点搜索中的十大开放性问题
DOI：
10.1007/978-1-4614-6825-7_14
复制
发表时间：
2013
期刊：
影响因子：
--
通讯作者：
S. Alpern
中科院分区：
文献类型：
--
作者：
S. Alpern
集合搜索问题要求两个（或更多）在公共区域迷路的智能体如何优化它们相遇的过程。通常它们都有速度限制（连续时间环境中的单位速度；离散时间环境中允许的相邻节点移动）。在所有情况下，代理都不知道彼此的位置。本章关注的是这个问题的“运筹学”版本——搜索过程的优化被解释为最小化预期相遇时间，或者可能最大化在给定时间内相遇的概率。这里不考虑理论计算机科学界采用的确定性方法。
The rendezvous search problem asks how two (or more) agents who are lost in a common region can optimize the process by which they meet. Usually they have restricted speed (unit speed in the continuous time context; moves allowed to adjacent nodes in discrete time). In all cases the agents are not aware of each other’s location. This chapter is concerned with the ‘operations research’ version of the problem – where optimization of the search process is interpreted as minimizing the expected time to meet, or possibly maximizing the probability of meeting within a given time. The deterministic approaches taken by the theoretical computer science community will not be considered here.