Heuristics: intelligent search strategies for computer problem solving
Heuristics: intelligent search strategies for computer problem solving
Computer graphics: principles and practice (2nd ed.)
Computer graphics: principles and practice (2nd ed.)
The weighted region problem: finding shortest paths through a weighted planar subdivision
Journal of the ACM (JACM)
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Path planning using a tangent graph for mobile robots among polygonal and curved obstacles
International Journal of Robotics Research
An algorithm for planning collision-free paths among polyhedral obstacles
Communications of the ACM
AI Game Programming Wisdom
AI Game Programming Wisdom
Introduction to AI Robotics
Game Programming Gems
AI '02 Proceedings of the 15th Conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence
Eighteenth national conference on Artificial intelligence
Proximity and reachability in the plane.
Proximity and reachability in the plane.
AI Game Programming Wisdom, Vol. 2
AI Game Programming Wisdom, Vol. 2
Speeding up learning in real-time search via automatic state abstraction
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Theta*: any-angle path planning on grids
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence
Incremental Phi*: incremental any-angle path planning on grids
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Algorithm for computer control of a digital plotter
IBM Systems Journal
Hierarchical path-finding based on decision tree
RSKT'12 Proceedings of the 7th international conference on Rough Sets and Knowledge Technology
Field D* path-finding on weighted triangulated and tetrahedral meshes
Autonomous Agents and Multi-Agent Systems
Virtual Stretched String: An Optimal Path Planning Technique over Polygonal Obstacles
Proceedings of Conference on Advances In Robotics
Hi-index | 0.00 |
Grids with blocked and unblocked cells are often used to represent terrain in robotics and video games. However, paths formed by grid edges can be longer than true shortest paths in the terrain since their headings are artificially constrained. We present two new correct and complete anyangle path-planning algorithms that avoid this shortcoming. Basic Theta* and Angle-Propagation Theta* are both variants of A* that propagate information along grid edges without constraining paths to grid edges. Basic Theta* is simple to understand and implement, fast and finds short paths. However, it is not guaranteed to find true shortest paths. Angle-Propagation Theta* achieves a better worst-case complexity per vertex expansion than Basic Theta* by propagating angle ranges when it expands vertices, but is more complex, not as fast and finds slightly longer paths. We refer to Basic Theta* and Angle-Propagation Theta* collectively as Theta*. Theta* has unique properties, which we analyze in detail. We show experimentally that it finds shorter paths than both A* with post-smoothed paths and Field D* (the only other version of A* we know of that propagates information along grid edges without constraining paths to grid edges) with a runtime comparable to that of A* on grids. Finally, we extend Theta* to grids that contain unblocked cells with non-uniformtraversal costs and introduce variants of Theta* which provide different tradeoffs between path length and runtime.