Incremental search algorithm in Ros_navigation_stack?
Hi! I want to use ros navigation stack alongwith gazebo for path planning simulation in a dynamic environment. I am stuck at 2 points and need some help-
Ros navigation stack currently uses Dijkstra's algorithm or A* for global planner. Both these algorithms work for a static map. Is it possible to implement incremental search algorithms like D* or D* lite in global planner?
How does navigation stack avoid dynamic obstacles? Does it call global planner and recompute the path to goal after adding those obstacles in the map?
Any help is highly appreciated.