Expand description
Theta* path planning algorithm
Theta* is an any-angle path planning algorithm that extends A* by allowing paths to connect any two visible nodes, not just grid neighbors. This produces shorter, more natural paths compared to standard A*.
Key features:
- Line-of-sight checks to skip intermediate nodes
- Produces any-angle paths (not restricted to grid directions)
- Optimal or near-optimal path lengths
Reference: Nash, A., Daniel, K., Koenig, S., & Felner, A. (2007). “Theta*: Any-Angle Path Planning on Grids”
Structs§
- Theta
Star Config - Configuration for Theta* planner
- Theta
Star Planner