Package Summary

Tags No category tags.
Version 0.2.6
License Apache-2.0
Build type AMENT_CMAKE
Use RECOMMENDED

Repository Summary

Checkout URI https://github.com/ros-planning/navigation2.git
VCS Type git
VCS Version dashing-devel
Last Updated 2019-11-17
Dev Status MAINTAINED
Released RELEASED

Package Description

TODO

Additional Links

No additional links.

Maintainers

  • Steve Macenski
  • Carlos Orduno

Authors

No additional authors.

Navfn Planner

The NavfnPlanner is a planning module that implements the nav2_behavior_tree::ComputePathToPose interface.

A planning module implementing the nav2_behavior_tree::ComputePathToPose interface is responsible for generating a feasible path given start and end robot poses. It provides the equivalent functionality to a GlobalPlanner in ROS1 MoveBase.

Status

Currently, NavfnPlanner's core algorithm is a direct port from the ROS1 MoveBase Navfn planner. The Navfn planning algorithm is based on the Global Dynamic Window Approach.

Characteristics

In Dijkstra mode (use_astar = false) Dijkstra's search algorithm is guaranteed to find the shortest path under any condition. In A* mode (use_astar = true) A*'s search algorithm is not guaranteed to find the shortest path, however it uses a heuristic to expand the potential field towards the goal.

The Navfn planner assumes a circular robot and operates on a costmap.

Task Interface

The Navigation System is composed of three tasks: NavigateToPose, ComputePathToPose and FollowPathToPose.

The DijkstraPlanner implements the Task Server interface for ComputePathToPose, specifically derives from nav2_behavior_tree::ComputePathToPoseTaskServer. The client to DijkstraPlanner is 'NavigateToPoseTask', which periodically sends requests to the path planner.

alt text

Next Steps

  • Refactor Navfn. Currently difficult to modify/extend. Issue #244
  • Implement additional planners based on optimal control, potential field or other graph search algorithms that require transformation of the world model to other representations (topological, tree map, etc.) to confirm sufficient generalization. Issue #225
  • Implement planners for non-holonomic robots. Issue #225
CHANGELOG

Wiki Tutorials

See ROS Wiki Tutorials for more details.

Source Tutorials

Not currently indexed.

Launch files

No launch files found

Messages

No message files found.

Services

No service files found

Plugins

No plugins found.

Recent questions tagged nav2_navfn_planner at answers.ros.org

Package Summary

Tags No category tags.
Version 0.1.7
License Apache License 2.0
Build type AMENT_CMAKE
Use RECOMMENDED

Repository Summary

Checkout URI https://github.com/ros-planning/navigation2.git
VCS Type git
VCS Version crystal-devel
Last Updated 2019-03-13
Dev Status MAINTAINED
Released RELEASED

Package Description

TODO

Additional Links

No additional links.

Maintainers

  • Steve Macenski
  • Carlos Orduno

Authors

No additional authors.

Navfn Planner

The NavfnPlanner is a planning module that implements the nav2_tasks::ComputePathToPose interface.

A planning module implementing the nav2_tasks::ComputePathToPose interface is responsible for generating a feasible path given start and end robot poses. It provides the equivalent functionality to a GlobalPlanner in ROS1 MoveBase.

Status

Currently, NavfnPlanner's core algorithm is a direct port from the ROS1 MoveBase Navfn planner. The Navfn planning algorithm is based on the Global Dynamic Window Approach.

Characteristics

In Dijkstra mode (use_astar = false) Dijkstra's search algorithm is guaranteed to find the shortest path under any condition. In A* mode (use_astar = true) A*'s search algorithm is not guaranteed to find the shortest path, however it uses a heuristic to expand the potential field towards the goal.

The Navfn planner assumes a circular robot and operates on a costmap.

Task Interface

The Navigation System is composed of three tasks: NavigateToPose, ComputePathToPose and FollowPathToPose.

The DijkstraPlanner implements the Task Server interface for ComputePathToPose, specifically derives from nav2_tasks::ComputePathToPoseTaskServer. The client to DijkstraPlanner is 'NavigateToPoseTask', which periodically sends requests to the path planner.

alt text

Next Steps

  • Refactor Navfn. Currently difficult to modify/extend. Issue #244
  • Implement additional planners based on optimal control, potential field or other graph search algorithms that require transformation of the world model to other representations (topological, tree map, etc.) to confirm sufficient generalization. Issue #225
  • Implement planners for non-holonomic robots. Issue #225
CHANGELOG

Wiki Tutorials

See ROS Wiki Tutorials for more details.

Source Tutorials

Not currently indexed.

Launch files

No launch files found

Messages

No message files found.

Services

No service files found

Plugins

No plugins found.

Recent questions tagged nav2_navfn_planner at answers.ros.org

No version for distro bouncy. Known supported distros are highlighted in the buttons above.
No version for distro melodic. Known supported distros are highlighted in the buttons above.
No version for distro kinetic. Known supported distros are highlighted in the buttons above.
No version for distro ardent. Known supported distros are highlighted in the buttons above.
No version for distro lunar. Known supported distros are highlighted in the buttons above.
No version for distro jade. Known supported distros are highlighted in the buttons above.
No version for distro indigo. Known supported distros are highlighted in the buttons above.
No version for distro hydro. Known supported distros are highlighted in the buttons above.