Jump to content

Navigation function

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Aorthey (talk | contribs) at 12:35, 16 December 2013. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Navigation function usually refers to a function of position, velocity, acceleration and time which is used to plan robot trajectories through the environment. Generally, the goal of a navigation function is to create feasible, safe paths that avoid obstacles while allowing a robot to move from its starting configuration to its goal configuration.

Potential functions as navigation functions

A potential function. Imagine dropping a marble on the surface. It will avoid the three obstacles and eventually reach the goal position in the center.

Potential functions assume that the environment or work space is known. Obstacles are assigned a high potential value, and the goal position is assigned a low potential. To reach the goal position, a robot only needs to follow the negative gradient of the surface.

We can formalize this concept mathematically as following: Let be the state space of all possible configurations of a robot. Let denote the goal region of the state space.

Then a potential function is called a (feasible) navigation function if [1]

  1. if and only if no point in is reachable from .
  2. For every reachable state, , the local operator produces a state for which .

See also

References

  • LaValle, Steven M. (2006), Planning Algorithms (First ed.), Cambridge University Press, ISBN 978-0-521-86205-9
  • Laumond, Jean-Paul (1998), Robot Motion Planning and Control (First ed.), Springer, ISBN 3-540-76219-1
  • NFsim: MATLAB Toolbox for motion planning using Navigation Functions.

References

  1. ^ Lavalle, Steven, [Planning Algorithms Chapter 8]