OMPL
| OMPL | |
|---|---|
| File:OMPL logo image.jpg | |
| Initial release | October 15, 2010 |
| Stable release | 1.6.0
/ January 31, 2021 |
| Repository |
|
| Engine | |
| Operating system | Linux, Mac OS X, Microsoft Windows |
| License | BSD |
| Website | ompl |
OMPL (Open Motion Planning Library) is a software package for computing motion plans using sampling-based algorithms. The content of the library is limited to motion planning algorithms, which means there is no environment specification, no collision detection or visualization. This is intentional as the library is designed to be easily integrated into systems that already provide the additional needed components.[1] For example, OMPL is integrated with ROS and MoveIt!. In 2012 OMPL won the Grand Prize at the Open Source Software World Challenge.
Implementation
[edit | edit source]OMPL is written in C++ but also offers Python bindings. The library includes implementations for a large number of planning algorithms, all of these being implemented on top of the same base functionality. The base functionality OMPL provides for planners is thread safe. Adding new motion planning algorithms to OMPL is easy, thus facilitating comparisons between existing algorithms and evaluations of new ideas.
Target audience
[edit | edit source]Teaching
[edit | edit source]One of the design goals for OMPL is clarity of concepts used. This equates to having C++ classes that correspond to concepts found in the literature. Such a design facilitates using OMPL for education. Furthermore, the authors provide free course materials and assignments for use in conjunction with OMPL.[2][3]
Industrial use
[edit | edit source]The first use for OMPL was actually at Willow Garage, where the library was started, to do motion planning for the PR2 arms. As such, the library was hardened to run reliably and efficiently. Afterwards OMPL started to be used (via ROS and MoveIt!) for hundreds of different types of robots [4] .[5]
Research
[edit | edit source]OMPL includes tools for benchmarking,[6] providing a common platform for easily developing and testing new algorithms.
References
[edit | edit source]- ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
- ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
- ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
- ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
- ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
- ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).