Papers › Evaluation of Sampling-Based Optimizing Planners for Outdoor Robot Navigation
Evaluation of Sampling-Based Optimizing Planners for Outdoor Robot Navigation
Fetullah Atas, Lars Grimstad, Grzegorz Cielniak
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Sampling-Based Optimal(SBO) path planning has been mainly used for robotic arm manipulation tasks. Several research works have been carried out in order to evaluate performances of various SBO planners for arm manipulation. However, not much of work is available that highlights performances of SBO planners in context of mobile robot navigation in outdoor 3D environments. This paper evaluates performances of major SBO planners in Open Motion Planning Library(OMPL) for that purpose. Due to large number of existing SBO planners, experimenting and selecting a proper planner for a planning problem can be burdensome and ambiguous. SBO planner's probabilistic nature can also add a bias to this procedure. To address this, we evaluate performances of all available SBO planners in OMPL with a randomized planning problem generation method iteratively. Evaluations are done in various state spaces suiting for different differential constraints of mobile robots. The planning setups are focused for navigation of mobile robots in outdoor environments. The outdoor environment representation is done with prebuilt OctoMaps, collision checks are performed between a 3D box representing robot body and OctoMap for validation of sampled states. Several evaluation metrics such as resulting path's length, smoothness and status of acquired final solutions are selected. According to selected metrics, performances from different SBO planners are presented comparatively. Experimental results shows the significance of parallel computing towards quicker convergence rates for optimal solutions. Several SBO methods that takes advantage of parallel computing produced better results consistently in all state spaces for different planning inquiries.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections