Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
133 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Evaluating Heuristic Search Algorithms in Pathfinding: A Comprehensive Study on Performance Metrics and Domain Parameters (2310.02346v1)

Published 3 Oct 2023 in cs.MA and cs.RO

Abstract: The paper presents a comprehensive performance evaluation of some heuristic search algorithms in the context of autonomous systems and robotics. The objective of the study is to evaluate and compare the performance of different search algorithms in different problem settings on the pathfinding domain. Experiments give us insight into the behavior of the evaluated heuristic search algorithms, over the variation of different parameters: domain size, obstacle density, and distance between the start and the goal states. Results are then used to design a selection algorithm that, on the basis of problem characteristics, suggests the best search algorithm to use.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (21)
  1. Comput. Intell. 33(3), pp. 368–400, 10.1111/coin.12092.
  2. Yngvi Björnsson, Vadim Bulitko & Nathan R. Sturtevant (2009): TBA*: Time-Bounded A*. In Craig Boutilier, editor: IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence, Pasadena, California, USA, July 11-17, 2009, pp. 431–436. Available at http://ijcai.org/Proceedings/09/Papers/079.pdf.
  3. In Ariel Felner & Nathan R. Sturtevant, editors: Proceedings of the Third Annual Symposium on Combinatorial Search, SOCS 2010, Stone Mountain, Atlanta, Georgia, USA, July 8-10, 2010, AAAI Press, 10.1609/socs.v1i1.18174. Available at http://aaai.org/ocs/index.php/SOCS/SOCS10/paper/view/2103.
  4. In: 2006 IEEE Aerospace Conference, IEEE, pp. 11–pp, 10.1109/AERO.2006.1656029.
  5. MIT Press. Available at http://mitpress.mit.edu/books/introduction-algorithms.
  6. A. Elfes (1989): Using occupancy grids for mobile robot perception and navigation. Computer 22(6), pp. 46–57, 10.1109/2.30720.
  7. Carlos Hernández & Jorge A. Baier (2011): Real-Time Heuristic Search with Depression Avoidance. In Toby Walsh, editor: IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22, 2011, IJCAI/AAAI, pp. 578–583, 10.5591/978-1-57735-516-8/IJCAI11-104.
  8. Cognitive Robotics 1, pp. 58–75, 10.1016/j.cogr.2021.06.001.
  9. Sven Koenig (2001): Agent-Centered Search. AI Mag. 22(4), pp. 109–132, 10.1609/aimag.v22i4.1596.
  10. Sven Koenig (2004): A Comparison of Fast Search Methods for Real-Time Situated Agents, pp. 864–871. 10.1109/AAMAS.2004.10122. Available at https://doi.ieeecomputersociety.org/10.1109/AAMAS.2004.10122.
  11. Sven Koenig & Maxim Likhachev (2002): D*Lite, pp. 476–483. Available at http://www.aaai.org/Library/AAAI/2002/aaai02-072.php.
  12. Sven Koenig & Maxim Likhachev (2006): Real-time adaptive A*. In Hideyuki Nakashima, Michael P. Wellman, Gerhard Weiss & Peter Stone, editors: 5th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2006), Hakodate, Japan, May 8-12, 2006, ACM, pp. 281–288, 10.1145/1160633.1160682.
  13. Sven Koenig & Xiaoxun Sun (2009): Comparing real-time and incremental heuristic search for real-time situated agents. Auton. Agents Multi Agent Syst. 18(3), pp. 313–341, 10.1007/s10458-008-9061-x.
  14. Richard E Korf (1990): Real-time heuristic search. Artificial intelligence 42(2-3), pp. 189–211, 10.1016/0004-3702(90)90054-4.
  15. Available at https://proceedings.neurips.cc/paper/2003/hash/ee8fe9093fbbb687bef15a38facc44d2-Abstract.html.
  16. at-Automatisierungstechnik 69(1), pp. 3–13, 10.1515/auto-2020-0131.
  17. Michal Pechoucek, Simon G Thompson & Holger Voos (2008): Defence Industry Applications of Autonomous Agents and Multi-Agent Systems. Springer, 10.1007/978-3-7643-8571-2.
  18. Journal of Manufacturing Systems 60, pp. 312–324, 10.1016/j.jmsy.2021.06.008.
  19. José Ricardo Sánchez-Ibáñez, Carlos Jesús Pérez-del-Pulgar & Alfonso García-Cerezo (2021): Path Planning for Autonomous Mobile Robots: A Review. Sensors 21(23), p. 7898, 10.3390/s21237898.
  20. Anthony Stentz (1995): The Focussed D* Algorithm for Real-Time Replanning. In: Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, IJCAI 95, Montréal Québec, Canada, August 20-25 1995, 2 Volumes, Morgan Kaufmann, pp. 1652–1659. Available at http://ijcai.org/Proceedings/95-2/Papers/082.pdf.
  21. Dmitry S. Yershov & Steven M. LaValle (2011): Simplicial Dijkstra and A* algorithms for optimal feedback planning. In: 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 2011, San Francisco, CA, USA, September 25-30, 2011, IEEE, pp. 3862–3867, 10.1109/IROS.2011.6095032.
Citations (2)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now