Hardness measures for gridworld benchmarks and performance analysis of real-time heuristic search algorithms
スポンサーリンク
概要
- 論文の詳細を見る
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.
- Springer Netherlandsの論文
Springer Netherlands | 論文
- Developmental regulation of photosynthate distribution in leaves of rice
- Isolation and characterization of bacteria from soil contaminated with diesel oil and the possible use of these in autochthonous bioaugmentation
- Removal of estrogenic activity of iso-butylparaben and n-butylparaben by laccase in the presence of 1-hydroxybenzotriazole
- Degradation of Polyethylene and Nylon-66 by the Laccase-Mediator System
- An EntD-like phosphopantetheinyl transferase gene from Photobacterium profundum SS9 complements pfa genes of Moritella marina strain MP-1 involved in biosynthesis of docosahexaenoic acid