HUSCAP logo Hokkaido Univ. logo

Hokkaido University Collection of Scholarly and Academic Papers >
Graduate School of Engineering / Faculty of Engineering >
Peer-reviewed Journal Articles, etc >

SHP: Smooth Hypocycloidal Paths with Collision-Free and Decoupled Multi-Robot Path Planning

This item is licensed under: Creative Commons Attribution 3.0 Unported

Files in This Item:
63458.pdf10.31 MBPDFView/Open
Please use this identifier to cite or link to this item:http://hdl.handle.net/2115/65128

Title: SHP: Smooth Hypocycloidal Paths with Collision-Free and Decoupled Multi-Robot Path Planning
Authors: Ravankar, Abhijeet Browse this author
Ravankar, Ankit A. Browse this author
Kobayashi, Yukinori Browse this author →KAKEN DB
Emaru, Takanori Browse this author →KAKEN DB
Keywords: Path Smoothing
Robot Path Planning
Multi-robot Collision Avoidance
Issue Date: 17-Jun-2016
Publisher: SAGE Publications
Journal Title: International Journal of Advanced Robotic Systems
Volume: 13
Issue: 3
Start Page: 133
Publisher DOI: 10.5772/63458
Abstract: Generating smooth and continuous paths for robots with collision avoidance, which avoid sharp turns, is an important problem in the context of autonomous robot navigation. This paper presents novel smooth hypocycloidal paths (SHP) for robot motion. It is integrated with collision-free and decoupled multi-robot path planning. An SHP diffuses (i.e., moves points along segments) the points of sharp turns in the global path of the map into nodes, which are used to generate smooth hypocycloidal curves that maintain a safe clearance in relation to the obstacles. These nodes are also used as safe points of retreat to avoid collision with other robots. The novel contributions of this work are as follows: (1) The proposed work is the first use of hypocycloid geometry to produce smooth and continuous paths for robot motion. A mathematical analysis of SHP generation in various scenarios is discussed. (2) The proposed work is also the first to consider the case of smooth and collision-free path generation for a load carrying robot. (3) Traditionally, path smoothing and collision avoidance have been addressed as separate problems. This work proposes integrated and decoupled collision-free multi-robot path planning. ‵Node caching‵ is proposed to improve efficiency. A decoupled approach with local communication enables the paths of robots to be dynamically changed. (4) A novel ‵multi-robot map update‵ in case of dynamic obstacles in the map is proposed, such that robots update other robots about the positions of dynamic obstacles in the map. A timestamp feature ensures that all the robots have the most updated map. Comparison between SHP and other path smoothing techniques and experimental results in real environments confirm that SHP can generate smooth paths for robots and avoid collision with other robots through local communication.
Rights: https://creativecommons.org/licenses/by/3.0/
Type: article
URI: http://hdl.handle.net/2115/65128
Appears in Collections:工学院・工学研究院 (Graduate School of Engineering / Faculty of Engineering) > 雑誌発表論文等 (Peer-reviewed Journal Articles, etc)

Submitter: Abhijeet Ravankar

Export metadata:

OAI-PMH ( junii2 , jpcoar_1.0 )

MathJax is now OFF:


 

 - Hokkaido University