> \pJava Excel API v2.6 Ba==h\:#8X@"1Arial1Arial1Arial1Arial + ) , * `aDC, title[alternative]contributor[author]date[issued] publisher!identifier[bibliographicCitation]abstractkeywords[*]identifier[govdoc]identifier[isbn]identifier[issn]identifier[ismn]identifier[uri]identifier[url]identifier[doi(resolver)]Soonkyum Kim;
Byungchul An;2020-05IEEET2020 IEEE International Conference on Robotics and Automation (ICRA), pp.9542 - 9547In 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.,Path Planning;
Neural Network;
Graph Search; 1050-4729+https://pubs.kist.re.kr/handle/201004/779323:\Uwj$%GHjk@/Q:\1
S F
h
dMbP?_*+%" ,,??U
>@
Root EntryWorkbookSummaryInformation( DocumentSummaryInformation8