Smooth Path Planning for Robot Docking in Unknown Environment with Obstacles

Complexity 2018:1-17 (2018)
  Copy   BIBTEX

Abstract

This paper presents an integrated approach to plan smooth path for robots docking in unknown environments with obstacles. To determine the smooth collision-free path in obstacle environment, a tree structure with heuristic expanding strategy is designed as the foundation of path planning in this approach. The tree employs 3D Dubins curves as its branches and foundation for path feasibility evaluation. For the efficiency of the tree expanding in obstacle environment, intermediate nodes and collision-free branches are determined inspired by the elastic band theory. A feasible path is chosen as the shortest series of branches that connects to the docking station after the sufficient expansion of the tree. Simulation results are presented to show the validity and feasibility of the proposed approach.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,932

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Some natural decision problems in automatic graphs.Dietrich Kuske & Markus Lohrey - 2010 - Journal of Symbolic Logic 75 (2):678-710.
A microscopic approach to Souslin-tree construction, Part II.Ari Meir Brodsky & Assaf Rinot - 2021 - Annals of Pure and Applied Logic 172 (5):102904.

Analytics

Added to PP
2018-11-10

Downloads
77 (#210,844)

6 months
60 (#90,550)

Historical graph of downloads
How can I increase my downloads?

References found in this work

No references found.

Add more references