You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: README.md
+5-6Lines changed: 5 additions & 6 deletions
Original file line number
Diff line number
Diff line change
@@ -55,19 +55,17 @@ If your are looking for the old ROS 1 version, checkout the [noetic branch](http
55
55
56
56
# Usage Examples and Demos
57
57
58
-
Recommended entrypoint for new users: Check out the **[mesh_navigation_tutorials](https://github.com/naturerobots/mesh_navigation_tutorials/tree/main)** for a ready-to-use mesh navigation stack. Complete with simulated environment, rviz config, mesh nav config, etc.
58
+
Recommended entrypoint for new users: Check out the **[mesh_navigation_tutorials](https://github.com/naturerobots/mesh_navigation_tutorials/tree/main)** for a ready-to-use mesh navigation stack. Complete with simulated environment, RViz config, mesh nav config, etc.
59
59
60
-
See the **[pluto_robot](https://github.com/uos/pluto_robot)** bundle for example configurations of the mesh navigatoin stack and usage (ROS 1).
61
60
62
61
## Demos
63
62
64
-
In the following demo videos we used the developed VFP, i.e., the wavefront_propagatn_planner.
65
-
It will be renamed soon to vector_field_planner.
63
+
In the following demo videos we used the developed *continuous vector field planner* (CVP).
| Botanical Garden of Osnabrück University |[](http://www.youtube.com/watch?v=qAUWTiqdBM4)|
70
-
| Stone Quarry in the Forest Brockum |[](https://youtu.be/DFmv3wnIxug)|
68
+
| Stone Quarry in the Forest Brockum |[](https://youtu.be/DFmv3wnIxug)|
71
69
72
70
### Stone Quarry in the Forest in Brockum
73
71
@@ -105,7 +103,7 @@ The package structure is as follows:
105
103
106
104
-`dijkstra_mesh_planner` contains a mesh planner plugin providing a path planning method based on Dijkstra's algorithm. It plans by using the edges of the mesh map. The propagation start a the goal pose, thus a path from every accessed vertex to the goal pose can be computed. This leads to a sub-optimal potential field, which highly depends on the mesh structure.
107
105
108
-
-`cvp_mesh_planner` contains a Fast Marching Method (FMM) wave front path planner to take the 2D-manifold into account. This planner is able to plan over the surface, due to that it results in shorter paths than the `dijkstra_mesh_planner`, since it is not restricted to the edges or topology of the mesh. A comparison is shown below. Please refer to the paper `Continuous Shortest Path Vector Field Navigation on 3D Triangular Meshes for Mobile Robots` which is stated above.
106
+
-`cvp_mesh_planner` contains a Fast Marching Method (FMM) wave front path planner to take the 2D-manifold into account. This planner is able to plan over the surface, due to that it results in shorter paths than the `dijkstra_mesh_planner`, since it is not restricted to the edges or topology of the mesh. A comparison is shown below. Please refer to the paper `Continuous Shortest Path Vector Field Navigation on 3D Triangular Meshes for Mobile Robots`.
109
107
110
108
## Mesh Map
111
109
@@ -181,6 +179,7 @@ Please reference the following papers when using the navigation stack in your sc
181
179
note = {Software available at \url{https://github.com/uos/mesh_navigation}}
182
180
}
183
181
```
182
+
184
183
#### Move Base Flex: A Highly Flexible Navigation Framework for Mobile Robots
0 commit comments