论文信息 - Competitive Searching in Polygons - Beyond Generalised Streets

Competitive Searching in Polygons - Beyond Generalised Streets

We consider a robot inside an unknown polygon P which has to find a path from a starting point s to a target point t. It is equipped with on-board cameras through which it can get the visibility map of its immediate surroundings. We define two new classes of polygons and provide strategies for searching these classes of polygons.

Amitava Datta | Sven Schuierer | Christoph A. Hipke | A. Datta | S. Schuierer

[1] Rolf Klein. Walking an Unknown Street with Bounded Detour , 1991, Comput. Geom..

[2] Avrim Blum,et al. An on-line algorithm for improving performance in navigation , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[3] Jon M. Kleinberg,et al. On-line search in a simple polygon , 1994, SODA '94.

[4] Yoshihide Igarashi,et al. Efficient Strategies for Robot Navigation in Unknown Environment , 1994, ICALP.

[5] Robert E. Tarjan,et al. Amortized efficiency of list update and paging rules , 1985, CACM.

[6] Amitava Datta,et al. Competitive searching in a generalized street , 1994, SCG '94.

[7] Baruch Schieber,et al. Navigating in unfamiliar geometric terrain , 1991, STOC '91.

[8] Mihalis Yannakakis,et al. Shortest Paths Without a Map , 1989, Theor. Comput. Sci..

[9] Ricardo A. Baeza-Yates,et al. Searching in the Plane , 1993, Inf. Comput..