Soonkyum Kim Byungchul An 2024-01-12T04:11:39Z 2024-01-12T04:11:39Z 2021-09-29 2020-05 1050-4729 https://pubs.kist.re.kr/handle/201004/77932 In this paper, we consider the path planning problem on a graph. To reduce computation load by efficiently exploring the graph, we model the heuristic function as a neural network, which is trained by a training set derived from optimal paths to estimate the optimal cost between a pair of vertices on the graph. As such heuristic function cannot be proved to be an admissible heuristic to guarantee the global optimality of the path, we adapt an admissible heuristic function for the terminating criteria. Thus, proposed Learning Heuristic A* (LHA*) guarantees the bounded suboptimality of the path. The performance of LHA* was demonstrated by simulations in a maze-like map and compared with the performance of weighted A* with the same suboptimality bound. English IEEE Path Planning Neural Network Graph Search Learning Heuristic A*: Efficient Graph Search using Neural Network Conference 10.1109/ICRA40945.2020.9197015 1 2020 IEEE International Conference on Robotics and Automation (ICRA), pp.9542 - 9547 2020 IEEE International Conference on Robotics and Automation (ICRA) 9542 9547 FR ELECTR NETWORK 2020-05-31 2020 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA)