Smooth Path Planning for Robot Docking in Unknown Environment with Obstacles

13Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Cui, P., Yan, W., Cui, R., & Yu, J. (2018). Smooth Path Planning for Robot Docking in Unknown Environment with Obstacles. Complexity, 2018. https://doi.org/10.1155/2018/4359036

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free