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.

An algorithm used for navigation stack

navigation_stack

asked 2012-06-26 14:40:06 -0600

moyashi

721 ●54 ●64 ●71

Hi, I've read the paper "The Office Marathon".

I couldn't understand whether "the gradient method(reference [13])" is used for local planning or global planning. In the paper, global planner uses the method as global planning apparently. However, in the reference [13], I think it is introduced as local planning.

My question is the gradient method is used for ... what?

It's originally for local planning, but in the case it's applied to global planner? If so, will costmap all over the environment be calculated before a robot moves?

Thank you in advance.

edit retag flag offensive close merge delete

add a comment

1 Answer

Sort by » oldest newest most voted

answered 2012-06-27 04:01:27 -0600

KruseT

7848 ●40 ●87 ●146

The reference [13] introduces the gradient method as a method that unifies global and local planning. "The Office Marathon" explains that the gradient method had drawbacks for local planning, so that it was only used for global planning.

edit flag offensive delete link

add a comment

Question Tools

Stats

Asked: 2012-06-26 14:40:06 -0600

Seen: 974 times

Last updated: Jun 27 '12

An algorithm used for navigation stack edit

1 Answer

Question Tools

Stats

Related questions

An algorithm used for navigation stack