2 papers
cs.AI2015
Finetuning Randomized Heuristic Search For 2D Path Planning: Finding The Best Input Parameters For R* Algorithm Through Series Of Experiments
Konstantin Yakovlev, Egor Baskin, Ivan Hramoin
Path planning is typically considered in Artificial Intelligence as a graph searching problem and R* is state-of-the-art algorithm tailored to solve it. The algorithm decomposes gi…
cs.AI2015
Grid-based angle-constrained path planning
Konstantin Yakovlev, Egor Baskin, Ivan Hramoin
Square grids are commonly used in robotics and game development as spatial models and well known in AI community heuristic search algorithms (such as A*, JPS, Theta* etc.) are wide…