Any-angle path planning
Related papers: 20
About
Any-angle path planning is a family of algorithms designed to find shortest or near-shortest paths through grid-based or graph-based environments without restricting movement to predefined edge directions. Unlike classical grid search methods such as A*, which constrain motion to discrete cardinal or diagonal directions and can produce artificially long, staircase-like paths, any-angle planners allow the computed path to travel in any continuous direction across the environment. Algorithms like Theta* achieve this by propagating path information across grid vertices and performing line-of-sight checks to shortcut unnecessarily constrained routes, effectively approximating true Euclidean shortest paths at modest computational cost. In robotics and AI, any-angle planning is applied to mobile robot navigation, autonomous vehicle routing, and game-agent pathfinding, wherever a compact 2D or 3D occupancy grid represents the workspace. It matters because grid discretization introduces systematic path-length errors that accumulate over long traversals, causing robots to follow inefficient trajectories. By recovering smooth, geometrically realistic paths directly from discrete representations, any-angle methods reduce travel distance, improve motion naturalness, and lower downstream motion-smoothing effort, bridging the gap between the computational convenience of grid maps and the geometric accuracy demanded by real deployments.
Top Researchers
Top Institutes
Top Cited Papers
Probabilistic roadmaps for path planning in high-dimensional configuration spaces
Lydia E. Kavraki, P. Švestka, J.-C. Latombe, M.H. Overmars
Citations: 6256 • 1996
Randomized Kinodynamic Planning
Steven M. LaValle, James Kuffner
Citations: 3241 • 2001
Optimal and Efficient Path Planning for Partially Known Environments
Anthony Stentz
Citations: 1245 • 1997
Coverage for robotics – A survey of recent results
Howie Choset
Citations: 1189 • 2001
Numerical potential field techniques for robot path planning
Jérôme Barraquand, B. Langlois, J.-C. Latombe
Citations: 885 • 1992
The focussed D* algorithm for real-time replanning
Anthony Stentz
Citations: 820 • 1995
Toward Efficient Trajectory Planning: The Path-Velocity Decomposition
Kamal Kant, Steven W. Zucker
Citations: 753 • 1986
Heuristic approaches in robot path planning: A survey
Cosmin Copot, Duc Trung Tran, Robin De Keyser
Citations: 631 • 2016
Path planning techniques for mobile robots: Review and prospect
Lixing Liu, Xu Wang, Hongjie Liu, Jianping Li, Pengfei Wang
Citations: 611 • 2023
Neural RRT*: Learning-Based Optimal Path Planning
Jiankun Wang, Wenzheng Chi, Chenming Li, Chaoqun Wang, Max Q.‐H. Meng
Citations: 533 • 2020
Path planning optimization of indoor mobile robot based on adaptive ant colony algorithm
Changwei Miao, Guangzhu Chen, Chengliang Yan, Yuanyuan Wu
Citations: 469 • 2021
Multiresolution path planning for mobile robots
Subbarao Kambhampati, L.S. Davis
Citations: 447 • 1986
Multi-objective multi-robot path planning in continuous environment using an enhanced genetic algorithm
Milad Nazarahari, Esmaeel Khanmirza, Samira Doostie
Citations: 435 • 2018
Theta*: Any-Angle Path Planning on Grids
Citations: 417 • 2010
Structure and Intractability of Optimal Multi-Robot Path Planning on Graphs
Jingjin Yu, Steven M. LaValle
Citations: 414 • 2013
Mobile robot path planning using membrane evolutionary artificial potential field
Ulises Orozco-Rosas, Oscar Montiel, Roberto Sepúlveda
Citations: 412 • 2019
An improved ant colony algorithm for robot path planning
Jianhua Liu, Jianguo Yang, Huaping Liu, Xingjun Tian, Meng Gao
Citations: 399 • 2016
Using interpolation to improve path planning: The Field D<sup>*</sup> algorithm
Dave Ferguson, Anthony Stentz
Citations: 387 • 2006
A randomized roadmap method for path and manipulation planning
Nancy M. Amato, You Wu
Citations: 372 • 2002
Subdimensional expansion for multirobot path planning
Glenn Wagner, Howie Choset
Citations: 372 • 2014