Abstract
We propose two strategies called the adaptive- bias heuristic and the adjusted- bias heuristic for navigating a robot in unknown environment containing rectangular and rectilinear obstacles. For each of these strategies we study the ratio of the dead-free path length made by the strategy to the shortest path length between the start point and the target point when all obstacles satisfy some limitations on their aspect ratios and side lengths. For the adaptive- bias heuristic and the adjusted-bias heuristic we show that the ratios are at most arbitrarily close to 1+3/5k and 1+3/5f, respectively, as n grows, if the start point and the target are at the same horizontal level, where any side length of each obstacle is at most k and the aspect ratio of any obstacle is at most f, respectively. We also study the ratios for unknown environment where the start point and the target may be at different levels. These ratios are better than the ratios obtained by strategies previously known for the classes of scenes considered in this paper.
Preview
Unable to display preview. Download preview PDF.
References
Bar-Eli, E., Berman, P., Fiat, A., Yan, P.: On-line navigation in a room. Proc. 3rd ACM-SIAM SODA (1992) 237–249
Blum, A., Raghavan, P. and Schieber, B.: Navigating in unfamiliar geometric terrain. Proc. 23rd ACM STOC (1991) 494–504
Chan, K., Lam, T.: An on-line algorithm for navigating in unknown terrain. Proc. ISA'91. LNCS 557. (1991) 127–136
Deng, X., Papadimitriou, C. H.: Exploring an unknown graph. Proc. 31st IEEE FOCS (1990) 355–361
Klein, R.: Walking an unknown street with bounded detour. Proc. 32nd IEEE FOCS (1991) 304–313
Lumelsky, V. J.: Algorithmic and complexity issues of robot motion in an uncertain environment. J. of Complexity 3 (1987) 146–182
Lumelsky, V. J., A. A. Stepanov: Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape. Algorithmica 2 (1987) 403–430
Mei, A., Igarashi, Y.: Navigating in unknown environment with rectangular obstacles. IEIEC Technical Report Comp 93-20 (1993) 1–8
Mei, A., Igarashi, Y.: An efficient strategy for robot navigation in unknown environment. Department of Computer Science, Gunma University, Technical Report (1993) 1–10
Papadimitriou, C. H., Yannakakis, M.: Shortest paths without a map. Proc. 16th ICALP (1989) 610–620
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mei, A., Igarashi, Y. (1994). Efficient strategies for robot navigation in unknown environment. In: Abiteboul, S., Shamir, E. (eds) Automata, Languages and Programming. ICALP 1994. Lecture Notes in Computer Science, vol 820. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58201-0_104
Download citation
DOI: https://doi.org/10.1007/3-540-58201-0_104
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58201-4
Online ISBN: 978-3-540-48566-7
eBook Packages: Springer Book Archive