The Grid-Based Path Planning Competition

The Grid-Based Path Planning Competition

A large number of papers have been written that deal with path planning in grids. These papers contain a wide variety of techniques and operate under a wide variety of constraints. All of them offer significant improvement over and beyond a basic A* search. But there has been no unified study comparing techniques and measuring the trade-offs implicit in the approaches. While this comparison cou...

The Grid-Based Path Planning Competition: 2014 Entries and Results

The Grid-Based Path Planning Competition has just completed its third iteration. The entries used in the competition have improved significantly during this time, changing the view of the state of the art of gridbased pathfinding. Furthermore, the entries from the competition have been made publicly available, improving the ability of researchers to compare their work. This paper summarizes the...

Grid-Based Angle-Constrained Path Planning

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 widely used for path planning on grids. A lot of research is concentrated on finding the shortest (in geometrical sense) paths while in many applications finding smooth paths (rather than the shortest ones but containing ...

Accelerated A* Trajectory Planning: Grid-based Path Planning Comparison

The contribution of the paper is a high performance pathplanning algorithm designed to be used within a multi-agent planning framework solving a UAV collision avoidance problem. Due to the lack of benchmark examples and available algorithms for 3D+time planning, the algorithm performance has been compared in the classical domain of path planning in grids with blocked and unblocked cells. The Ac...

Grid-Based Path-Finding