|
Hokkaido University Collection of Scholarly and Academic Papers >
Graduate School of Information Science and Technology / Faculty of Information Science and Technology >
Peer-reviewed Journal Articles, etc >
Hardness measures for gridworld benchmarks and performance analysis of real-time heuristic search algorithms
| Title: | Hardness measures for gridworld benchmarks and performance analysis of real-time heuristic search algorithms |
| Authors: | Mizusawa, Masataka Browse this author | | Kurihara, Masahito Browse this author →KAKEN DB |
| Keywords: | real-time search | | gridworlds | | benchmark | | phase transition |
| Issue Date: | Feb-2010 |
| Publisher: | Springer Netherlands |
| Journal Title: | Journal of Heuristics |
| Volume: | 16 |
| Issue: | 1 |
| Start Page: | 23 |
| End Page: | 36 |
| Publisher DOI: | 10.1007/s10732-008-9084-0 |
| Abstract: | Gridworlds are one of the most popular settings used in benchmark problems for real-time heuristic search algorithms. However, no comprehensive studies have existed so far on how the difference in the density of randomly positioned obstacles affects the hardness of the problems. This paper presents two measures for characterizing the hardness of gridworld problems parameterized by obstacle ratio, and relates them to the performance of the algorithms. We empirically show that the peak locations of those measures and actual performance degradation of the basic algorithms (RTA* and LRTA*) almost coincide with each other for a wide variety of problem settings. Thus the measures uncover some interesting aspects of the gridworlds. |
| Rights: | The final publication is available at www.springerlink.com |
| Type: | article (author version) |
| URI: | http://hdl.handle.net/2115/49220 |
| Appears in Collections: | 情報科学院・情報科学研究院 (Graduate School of Information Science and Technology / Faculty of Information Science and Technology) > 雑誌発表論文等 (Peer-reviewed Journal Articles, etc)
|
Submitter: 栗原 正仁
|
