ROS Resources: Documentation | Support | Discussion Forum | Index | Service Status | Q&A
Ask Your Question

Incremental search algorithm in Ros_navigation_stack?

asked 2016-04-02 23:19:35 -0600

sumitsk gravatar image

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-

  1. 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?

  2. 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.

edit retag flag offensive close merge delete

1 Answer

Sort by ยป oldest newest most voted

answered 2016-04-03 08:39:18 -0600

dornhege gravatar image
  1. Yes, you can implement any planner you like by using the plugin interface.
  2. Implicitly yes. The local planner should try to avoid dynamic obstacles on its own, and if it can not, will return false. This should trigger the global planner again.
edit flag offensive delete link more



I'm not sure D* will be as straightforward because it would probably require modifications to the internal move_base state machine and/or the planner interface. Related discussion:

spmaniato gravatar image spmaniato  ( 2016-04-03 15:57:03 -0600 )edit

Your Answer

Please start posting anonymously - your entry will be published after you log in or create a new account.

Add Answer

Question Tools



Asked: 2016-04-02 23:19:35 -0600

Seen: 342 times

Last updated: Apr 03 '16