Abstract
Grid graphs are popular testbeds for planning with incomplete information. In particular, it is studied a fundamental planning problem, localization, to investigate whether gridworlds make good testbeds for planning with incomplete information. It is found empirically that greedy planning methods that interleave planning and plan execution can localize robots very quickly on random gridworlds or mazes. Thus, they may not provide adequately challenging testbeds. On the other hand, it is showed that finding localization plans that are within a log factor of optimal is NP-hard. Thus there are instances of gridworlds on which all greedy planning methods perform very poorly. These theoretical results help empirical researchers to select appropriate planning methods for planning with incomplete information as well as testbeds to demonstrate them. However, for practical application of difficult instances we need a method for their fast decision. In this paper we describe an approach to solve localization problem. This approach is based on constructing a logical model for the problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Hanks S, Pollack M, Cohen P (1993) AI Mag 14:17
Gupta N, Nau D (1992) Artif Intell 56:223
Koenig S, Simmons R (1996) In: Proceedings of the national conference on artificial intelligence, p 279
Reinefeld A (1993) In: Proceedings of the international joint conference on artificial intelligence, p 248
Slaney J, Thiebaux S (1996) In: Proceedings of the national conference on artificial intelligence planning
Tovey C, Koenig S (2000) In: Proceedings of the AAAI conference on artificial intelligence, p 819
Koenig S, Likhachev M (2005) Fast replanning for navigation in unknown terrain. IEEE Trans Robot 21:354
Koenig S, Smirnov Y, Tovey C (2003) Performance bounds for planning in unknown terrain. J Artif Intell 147:253
Mudgal A, Tovey C, Koenig S (2004) In: Proceedings of the international symposium on artificial intelligence and mathematics
Tovey C, Koenig S (2010) IEEE Trans Robot 26:320
Information on http://people.cs.ubc.ca/~hoos/SATLIB/index-ubc.html
Information on http://www.cs.ubc.ca/~hoos/SATLIB/Benchmarks/SAT/satformat.ps
Nourbakhsh I (1996) In: Proceedings of the AAAI-96 spring symposium on planning with incomplete information for robot problems, p 86
Information on http://www.tiger.com.tw/
Information on http://www.lynxmotion.com/c-103-johnny-5.aspx
Filliat D (2008) In: IEEE/RSJ international conference on intelligent robots and systems. IEEE computer society press, New York, p 248
Park IP, Kender JR (1995) Topological direction-giving and visual navigation in large environments. Artif Intell 78:355
Santos-Victor J, Vassallo R, Schneebeli H (1999) In: Christensen HI (ed) Proceedings of the first international conference on computer vision systems. Springer, London, UK, p 21
Information on http://parallel.uran.ru/mvc_now/hardware/supercomp.htm
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer Science+Business Media B.V.
About this paper
Cite this paper
Gorbenko, A., Popov, V., Sheka, A. (2012). Localization on Discrete Grid Graphs. In: He, X., Hua, E., Lin, Y., Liu, X. (eds) Computer, Informatics, Cybernetics and Applications. Lecture Notes in Electrical Engineering, vol 107. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-1839-5_105
Download citation
DOI: https://doi.org/10.1007/978-94-007-1839-5_105
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-007-1838-8
Online ISBN: 978-94-007-1839-5
eBook Packages: EngineeringEngineering (R0)