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. © 2012 Springer Science+Business Media B.V.
CITATION STYLE
Gorbenko, A., Popov, V., & Sheka, A. (2012). Localization on discrete grid graphs. In Lecture Notes in Electrical Engineering (Vol. 107 LNEE, pp. 971–978). https://doi.org/10.1007/978-94-007-1839-5_105
Mendeley helps you to discover research relevant for your work.