Skip to main content
SpringerLink
Log in

Reusing cost-minimal paths for goal-directed navigation in partially known terrains

  • Published:
Autonomous Agents and Multi-Agent Systems Aims and scope Submit manuscript

Abstract

Situated agents frequently need to solve search problems in partially known terrains in which the costs of the arcs of the search graphs can increase (but not decrease) when the agents observe new information. An example of such search problems is goal-directed navigation with the freespace assumption in partially known terrains, where agents repeatedly follow cost-minimal paths from their current locations to given goal locations. Incremental heuristic search is an approach for solving the resulting sequences of similar search problems potentially faster than with classical heuristic search, by reusing information from previous searches to speed up its current search. There are two classes of incremental heuristic search algorithms, namely those that make the \(h\)-values of the current search more informed (such as Adaptive A*) and those that reuse parts of the A* search trees of previous searches during the current search (such as D* Lite). In this article, we introduce Path-Adaptive A* and its generalization Tree-Adaptive A*. Both incremental heuristic search algorithms terminate their searches before they expand the goal state, namely when they expand a state that is on a provably cost-minimal path to the goal. Path-Adaptive A* stores a single cost-minimal path to the goal state (the reusable path), while Tree-Adaptive A* stores a set of cost-minimal paths to the goal state (the reusable tree), and is thus potentially more efficient than Path-Adaptive A* since it uses information from all previous searches and not just the last one. Tree-Adaptive A* is the first incremental heuristic search algorithm that combines the principles of both classes of incremental heuristic search algorithms. We demonstrate experimentally that both Path-Adaptive A* and Tree-Adaptive A* can be faster than Adaptive A* and D* Lite, two state-of-the-art incremental heuristic search algorithms for goal-directed navigation with the freespace assumption.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17

Similar content being viewed by others

Notes

  1. All game and office maps can be found in Nathan Sturtevant’s repository [24].

  2. All game maps can be found in Nathan Sturtevant’s repository at http://www.movingai.com/benchmarks/.

References

  1. Bjornsson, Y., Enzenberger, M., Holte, R., Schaeffer, J., & Yap, P. (2003). Comparison of different grid abstractions for pathfinding on maps. In Proceedings of the international joint conference on artificial intelligence (pp. 1511–1512). Acapulco, Mexico: Morgan Kaufmann

  2. Bulitko, V., Bjornsson, Y., Lustrek, M., Schaeffer, J., & Sigmundarson, S. (2007). Dynamic control in path-planning with real-time heuristic search. In Proceedings of the international conference on automated planning and scheduling (pp. 49–56). Providence, RI, USA: AAAI Press.

  3. Choset, H., Thrun, S., Kavraki, L., Burgard, W., & Lynch, K. (2005). Principles of Robot motion: Theory, algorithms, and implementations. Cambridge, MA: MIT Press.

    Google Scholar 

  4. Edelkamp, S., & Schrödl, S. (2012). Heuristic search—Theory and applications. New York: Academic Press.

    Google Scholar 

  5. Ferguson, D., & Stentz, A. (2006). Using interpolation to improve path planning: The Field D* algorithm. Journal of Field Robotics, 23(2), 79–101.

    Article  MATH  Google Scholar 

  6. Hart, P., Nilsson, N., & Raphael, B. (1968). A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems, Man, and Cybernetics, 2, 100–107.

    Google Scholar 

  7. Hernandez, C., Baier, J., Uras, T., & Koenig, S. (2012). Position paper: Incremental search algorithms considered poorly understood. In Proceedings of the symposium on combinatorial search (pp. 159–161). Niagara Falls, Canada: AAAI Press.

  8. Hernández, C., & Baier, J. A. (2012). Avoiding and escaping depressions in real-time heuristic search. Journal of Artificial Intelligence Research, 43, 523–570.

    MathSciNet  Google Scholar 

  9. Hernández, C., Meseguer, P., Sun, X., & Koenig, S. (2009). Path-Adaptive A* for incremental heuristic search in unknown terrain [short paper]. In Proceedings of the international conference on automated planning and scheduling (pp. 358–361). Thessaloniki, Greece: AAAI Press.

  10. Hernandez, C., Sun, X., Koenig, S., & Meseguer, P. (2011). Tree Adaptive A*. In Proceedings of the international joint conference on autonomous agents and multiagent systems (pp. 123–130). Taipei, Taiwan: IFAAMAS.

  11. Holte, R., Perez, M., Zimmer, R., & MacDonald, A. (1996). Hierarchical A*: Searching abstraction hierarchies efficiently. In Proceedings of the thirteenth National conference on artificial intelligence (pp. 530–535). Portland, Oregon, USA: AAAI Press.

  12. Koenig, S., Furcy, D., & Bauer, C. (2002). Heuristic search-based replanning. In Proceedings of the international conference on artificial intelligence planning systems (pp. 294–301). Toulouse, France: AAAI Press.

  13. Koenig, S., & Likhachev, M. (2005). Adaptive A*. In Proceedings of the international joint conference on autonomous agents and multiagent systems (pp. 1311–1312). Utrecht, The Netherlands: ACM.

  14. Koenig, S., & Likhachev, M. (2005). Fast replanning for navigation in unknown terrain. Transactions on Robotics, 21, 354–363.

    Article  Google Scholar 

  15. Koenig, S., & Likhachev, M. (2006). A new principle for incremental heuristic search: Theoretical results. In Proceedings of the international conference on autonomous planning and scheduling (pp. 410–413). Cumbria, UK: AAAI Press.

  16. Koenig, S., Likhachev, M., Liu, Y., & Furcy, D. (2004). Incremental heuristic search in artificial intelligence. Artificial Intelligence Magazine, 25(2), 99–112.

    Google Scholar 

  17. Koenig, S., Tovey, C., & Smirnov, Y. (2003). Performance bounds for planning in unknown terrain. Artificial Intelligence, 147(1–2), 253–279.

    Article  MathSciNet  MATH  Google Scholar 

  18. Likhachev, M., Ferguson, D., Gordon, G., Stentz, A., & Thrun, S. (2005). Anytime Dynamic A*: An anytime, replanning algorithm. In Proceedings of the international conference on automated planning and scheduling (pp. 262–271). Monterey, California, USA: AAAI Press.

  19. Likhachev, M., Ferguson, D., Gordon, G., Stentz, A., & Thrun, S. (2008). Anytime search in dynamic graphs. Artificial Intelligence, 172(14), 1613–1643.

    Article  MathSciNet  MATH  Google Scholar 

  20. Likhachev, M., & Koenig, S. (2006). Incremental heuristic search in games: The quest for speed. In Proceedings of the AAAI conference on artificial intelligence and interactive digital entertainment (pp. 118–120). Marina del Rey, California, USA: AAAI Press. http://www.aaai.org/Library/AIIDE/2006/aiide06-025.php.

  21. Matsuta, K., Kobayashi, H., & Shinohara, A. (2010). Multi-target Adaptive A*. In Proceedings of the international conference on autonomous agents and multiagent systems (pp. 1065–1072). Toronto, Canada: IFAAMAS.

  22. Pearl, J. (1984). Heuristics: Intelligent search strategies for computer problem solving. Addison-Wesley.

  23. Stentz, A. (1995). The Focussed D* algorithm for real-time replanning. In Proceedings of the international joint conference in artificial intelligence (pp. 1652–1659). Montreal, Quebec, Canada: Morgan Kaufmann.

  24. Sturtevant, N. (2012). Benchmarks for grid-based pathfinding. Transactions on Computational Intelligence and AI in Games, 4(2), 144–148.

    Article  Google Scholar 

  25. Sun, X., Koenig, S., & Yeoh, W. (2008). Generalized Adaptive A*. In Proceedings of the international joint conference on autonomous agents and multiagent systems (pp. 469–476). Estoril, Portugal: IFAAMAS.

  26. Sun, X., Yeoh, W., & Koenig, S. (2009). Efficient incremental search for moving target search. In Proceedings of the international joint conference on artificial intelligence (pp. 615–620). Pasadena, California, USA: AAAI Press.

  27. Yap, P. K. Y., Burch, N., Holte, R. C., & Schaeffer, J. (2011). Any-angle path planning for computer games. In Proceedings of the AAAI conference on artificial intelligence and interactive digital entertainment (pp. 201–207). Palo Alto, California, USA: AAAI Press.

Download references

Acknowledgments

This material is based upon work supported by NSF (while Sven Koenig was serving at NSF). It is also based upon work supported by Fondecyt-Chile under contract/Grant number 11080063, NSF under contract/Grant number 115-1319966, ARL/ARO under contract/Grant number W911NF-08-1-0468, ONR in form of a MURI under contract/Grant number N00014-09-1-1031, DOT under contract/Grant number DTFH61-11-C-00010 and the Spanish Ministry of Science and Innovation under Grant number TIN2009-13591-C02-02. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the sponsoring organizations, agencies, companies or the U.S. government. We thank Nathan Sturtevant for making his maps available at movingai.com.

Author information

Authors and Affiliations

  1. Departamento de Ingeniería Informática, Universidad Católica de la Ssma. Concepción, Concepción, Chile

    Carlos Hernández

  2. Computer Science Department, University of Southern California, Los Angeles, CA , 90089-0781, USA

    Tansel Uras & Sven Koenig

  3. Departamento de Ciencia de la Computación, Pontificia Universidad Católica de Chile, Santiago, Chile

    Jorge A. Baier

  4. Google, 1600 Amphitheatre Parkway, Mountain View, CA , 94043, USA

    Xiaoxun Sun

  5. IIIA - CSIC, Campus Universitat Autonòma de Barcelona, 08193 , Bellaterra, Spain

    Pedro Meseguer

Authors
  1. Carlos Hernández
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tansel Uras
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sven Koenig
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jorge A. Baier
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Xiaoxun Sun
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Pedro Meseguer
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Carlos Hernández.

Appendix

Appendix

See Tables 1, 2, 3, 4, 5, 6, 7, 8, 9 and 10.

Table 1 4-Neighbor game maps
Full size table
Table 2 8-Neighbor game maps
Full size table
Table 3 4-Neighbor office maps
Full size table
Table 4 8-Neighbor office maps
Full size table
Table 5 4-Neighbor maps with randomly blocked cells
Full size table
Table 6 8-Neighbor maps with randomly blocked cells
Full size table
Table 7 4-Neighbor populated game maps
Full size table
Table 8 8-Neighbor populated game maps
Full size table
Table 9 4-Neighbor populated office maps
Full size table
Table 10 8-Neighbor populated office maps
Full size table

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Hernández, C., Uras, T., Koenig, S. et al. Reusing cost-minimal paths for goal-directed navigation in partially known terrains. Auton Agent Multi-Agent Syst 29, 850–895 (2015). https://doi.org/10.1007/s10458-014-9266-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10458-014-9266-0

Keywords

Search

Navigation