Ask Your Question
1

Navigation Stack's Global Planning Algorithm

asked 2012-12-19 20:33:26 -0500

moyashi gravatar image

updated 2012-12-19 20:33:53 -0500

What kind of algorithm is used for global planner?

I've already read a paper on nav stack, "The Office Marathon".
The paper says that global planner assumes that A* algorithm is used.
And it also refer to a paper "A gradient method for realtime robot control".

Once I asked a similar question and got the latter method is used as global planner.
http://answers.ros.org/question/37332/an-algorithm-used-for-navigation-stack/

A* algorithm is used for ... what ?

Thanks in advance.

edit retag flag offensive close merge delete

1 Answer

Sort by ยป oldest newest most voted
4

answered 2012-12-20 07:08:43 -0500

Eric Perko gravatar image

By default, the navigation stack's global planner (provided by the navfn package) uses Dijkstra's algorithm. See http://answers.ros.org/question/28366/why-navfn-is-using-dijkstra/ for discussion on why that is the case and some more info about the A* implementation available in that package.

edit flag offensive delete link more

Comments

Thank you. I read source code and confirmed the algorithm.

moyashi gravatar imagemoyashi ( 2013-01-29 14:07:37 -0500 )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

Stats

Asked: 2012-12-19 20:33:26 -0500

Seen: 1,580 times

Last updated: Dec 20 '12