-
Notifications
You must be signed in to change notification settings - Fork 25
Path_Planning
username edited this page Mar 13, 2021
·
2 revisions
-
only be used on Topological Map
-
Space growth is exponential
-
only be used on Grid Map
-
JPS can be optimized to JPS+
- JPS+ need to preprocess the map, so it is not suitable for dynamic maps
- Find and compare operations become bit operations
A method based on graph search, which converts continuous space into discrete space, and then uses search algorithms such as Astar to find a path on the road map to improve search efficiency
- BFS
- Greedy
- Dijkstra
- Astar
-
Jump Point Search
- JPS+
- Probabilistic Road Maps
- [Rapidly-exploring Random Trees
- [Artificial Potential Fields
- Average time allocation
- Trapezoidal time allocation
- Ax = b
- closed form
- quadratic program
- [mixed-integer quadratic program
- [Bezier curve
- PID