Attention: Answers.ros.org is deprecated as of August the 11th, 2023. Please visit robotics.stackexchange.com to ask a new question. This site will remain online in read-only mode during the transition and into the foreseeable future. Selected questions and answers have been migrated, and redirects have been put in place to direct users to the corresponding questions on Robotics Stack Exchange. Additional details are available here.

Navigation Stack's Global Planning Algorithm

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

moyashi

721 ●54 ●64 ●71

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

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

add a comment

1 Answer

Sort by » oldest newest most voted

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

Eric Perko

8406 ●73 ●90 ●144 http://ericperko.com/

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

Comments

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

moyashi ( 2013-01-29 14:07:37 -0600 )edit

add a comment

Question Tools

Stats

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

Seen: 2,359 times

Last updated: Dec 20 '12

Navigation Stack's Global Planning Algorithm edit

1 Answer

Comments

Question Tools

Stats

Related questions

Navigation Stack's Global Planning Algorithm