An Optimal Competitive Strategy for Walking in Streets

An Optimal Competitive Strategy for Walking in Streets
复制标题

DOI:
10.1137/s0097539702419352
复制
发表时间:
1999-03
期刊:
SIAM J. Comput.
影响因子:
--
通讯作者:
Christian Icking;R. Klein;E. Langetepe;S. Schuierer;Ines Semrau
Christian Icking;R. Klein;E. Langetepe;S. Schuierer;Ines Semrau
中科院分区:
其他
文献类型:
--
作者:
Christian Icking;R. Klein;E. Langetepe;S. Schuierer;Ines Semrau

文献摘要

被引文献

相似文献

我们提出了一个最优的策略,搜索目标在一条街道上,实现了竞争因子的1002,从而匹配的最佳下界已知。这最终解决了许多作者一直在研究的竞争路径规划领域的一个有趣的开放问题。
We present an optimal strategy for searching for a goal in a street which achieves the competitive factor of √2, thus matching the best lower bound known before. This finally settles an interesting open problem in the area of competitive path planning many authors have been working on.