search

HKUST-Aerial-Robotics / Fast-Planner

A Robust and Efficient Trajectory Planner for Quadrotors
GNU General Public License v3.0
2.47k stars 666 forks source link

Kinodynamic A* #116

Open jacketfffff opened 3 years ago

jacketfffff commented 3 years ago

For Kinodynamic A* algorithm, the expand-nodes method in the search method has become acceleration sampling and integral. So how to ensure the completeness of probability? Thank you.

brunopinto900 commented 3 years ago

Completness of probability in A? A is deterministic and optimal up to a resolution given an admissible heuristics (cost-to-go).

jacketfffff commented 3 years ago

Thanks for your reply. I think the biggest advantage of A* is to find the optimal resolution if it has a resolution on the map. However, if the graph is no longer a fixed map and constructed by sampling, how to ensure that the existing solution can be found when the map would not be traversed entirely.

EhrazImam commented 3 years ago

Have you used A* algorithm in path planning or not? If yes then pls tell where have you used it? Please tell me as soon as possible. I will be very thankful to you