Weighted real-time heuristic search

Multiplying the heuristic function by a weight greater than one is a well-known technique in Heuristic Search. When applied to A* with an admissible heuristic it yields substantial runtime savings, at the expense of sacrificing solution optimality. Only a few works have studied the applicability of this technique to Real-Time Heuristic Search (RTHS), a search approach that builds upon Heuristic Search. In this paper we present two novel approaches to using weights in RTHS. The first one is a variant of a previous approach by Shimbo and Ishida. It incorporates weights to the lookahead search phase of the RTHS algorithm. The second one incorporates the weight to the edges of the search graph during the learning phase. Both techniques are applicable to a wide class of RTHS algorithms. Here we implement them within LSS-LRTA* and LRTA*-LS, obtaining a family of new algorithms. We evaluate them in path-planning benchmarks and show the second technique yields improvements of up to one order-of-magnitude both in solution cost and total search time. The first technique, on the other hand, yields poor results. Furthermore, we prove that RTHS algorithms that can appropriately use our second technique terminate finding a solution if one exists.

[1]  Sven Koenig,et al.  Performance bounds for planning in unknown terrain , 2003, Artif. Intell..

[2]  Toru Ishida,et al.  Controlling the learning process of real-time heuristic search , 2003, Artif. Intell..

[3]  Jorge A. Baier,et al.  Avoiding and Escaping Depressions in Real-Time Heuristic Search , 2014, J. Artif. Intell. Res..

[4]  Ira Pohl,et al.  Heuristic Search Viewed as Path Finding in a Graph , 1970, Artif. Intell..

[5]  Sven Koenig,et al.  Real-time adaptive A* , 2006, AAMAS '06.

[6]  Vadim Bulitko,et al.  Learning for Adaptive Real-time Search , 2004, ArXiv.

[7]  Sven Koenig,et al.  Comparing real-time and incremental heuristic search for real-time situated agents , 2009, Autonomous Agents and Multi-Agent Systems.

[8]  Sebastian Thrun,et al.  ARA*: Anytime A* with Provable Bounds on Sub-Optimality , 2003, NIPS.

[9]  Alexander Zelinsky,et al.  A mobile robot exploration algorithm , 1992, IEEE Trans. Robotics Autom..

[10]  Pedro Meseguer,et al.  Improving LRTA*(k) , 2007, IJCAI.

[11]  Richard E. Korf,et al.  Real-Time Heuristic Search , 1990, Artif. Intell..

[12]  V. Bulitko,et al.  Learning in Real-Time Search: A Unifying Framework , 2011, J. Artif. Intell. Res..

[13]  Malte Helmert,et al.  Landmarks Revisited , 2008, AAAI.

[14]  Wheeler Ruml,et al.  The Joy of Forgetting: Faster Anytime Search via Restarting , 2010, ICAPS.

[15]  Nathan R. Sturtevant,et al.  Benchmarks for Grid-Based Pathfinding , 2012, IEEE Transactions on Computational Intelligence and AI in Games.

[16]  Nathan R. Sturtevant,et al.  Real-Time Heuristic Search for Pathfinding in Video Games , 2011 .

[17]  Ronald L. Rivest,et al.  Introduction to Algorithms, Second Edition , 2001 .

[18]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..