Papers
5
Total Citations
572
H-Index
5
About
Alex Nash is a leading researcher in artificial intelligence and robotics, best known for his groundbreaking work in any-angle path planning. His primary research areas include heuristic search, motion planning, and grid-based navigation for autonomous systems. Nash’s most significant contribution is the development of Theta* (2007), a novel any-angle path planning algorithm that extends A* to produce shorter, more realistic paths by allowing movement at any angle, not just grid edges. This work, with over 212 citations, revolutionized path planning in computer games and robotics by eliminating the artificial heading constraints of traditional grid-based methods. He further advanced the field with Lazy Theta* (2010), which reduces computational overhead while maintaining path quality in both 2D and 3D environments, accumulating over 200 combined citations. His comprehensive 2013 survey on any-angle path planning (113 citations) remains a foundational reference for researchers. Nash’s recent work on path-length analysis (2021) provides rigorous theoretical bounds on grid-based path quality, solidifying his impact on efficient navigation for autonomous vehicles and virtual agents. His algorithms are widely implemented in commercial game engines and robotic systems, making him a pivotal figure in practical AI.
Research Focus
Key Achievements
Top Papers
- 1Theta*: any-angle path planning on grids212 citations · 2007
- 2Lazy Theta*: Any-Angle Path Planning and Path Length Analysis in 3D141 citations · 2010
- 3Any‐Angle Path Planning113 citations · 2013
- 4Lazy Theta*: Any-Angle Path Planning and Path Length Analysis in 3D67 citations · 2010
- 5Path-length analysis for grid-based path planning39 citations · 2021