<ul><li>The paper presents a comprehensive performance evaluation of heuristic search algorithms in the context of autonomous systems and robotics.</li><li>The objective is to evaluate and compare the performance of different search algorithms in different problem settings on the pathfinding domain.</li><li>Experiments are conducted to analyze the behavior of the evaluated algorithms based on domain size, obstacle density, and distance between start and goal states.</li><li>Based on the results, a selection algorithm is proposed to suggest the best search algorithm based on problem characteristics.</li></ul>

Evaluating Heuristic Search Algorithms in Pathfinding: A Comprehensive Study on Performance Metrics

Discover more