ICRA 2012 Paper Abstract


Paper WeA310.3

Kim, Hanguen (KAIST), Lee, Taehwan (KAIST), Chung, Hyun (KAIST), Sun, Namsun (Korea Ocean Research and Development Institute), Myung, Hyun (KAIST)

Any-Angle Path Planning with Limit-Cycle Circle Set for Marine Surface Vehicle

Scheduled for presentation during the Interactive Session "Interactive Session WeA-3" (WeA310), Wednesday, May 16, 2012, 09:30−10:00, Ballroom D

2012 IEEE International Conference on Robotics and Automation, May 14-18, 2012, RiverCentre, Saint Paul, Minnesota, USA

This information is tentative and subject to change. Compiled on August 21, 2018

Keywords Motion and Path Planning, Marine Robotics, Autonomous Navigation


Most path planning algorithms for a marine surface vehicle in the ocean environment have been developed only for a 2-D (x,y) plane without considering the vehicle heading angle. As a result, the vehicle has a difficulty in following the path correctly. In this paper, we propose a limit-cycle circle set that applies to the Theta* algorithm. The minimum turning radius of a marine surface vehicle is calculated using a limit-cycle circle set, and circles of this radius is used to generate a configuration space of an occupancy grid map. After applying Theta* to this configuration space, the limit-cycle circle set is also applied to the start and end nodes to find the appropriate path with specified heading angles. The benefit of this algorithm is its fast computation time compared to other 3-D (x,y,theta) path planning algorithms, along with the fact that it can be applied to the 3-D kinematic state of the vehicle. We simulate the proposed algorithm and compare it with 3-D A* and 3-D A* with post smoothing algorithms.



Technical Content © IEEE Robotics & Automation Society

This site is protected by copyright and trademark laws under US and International law.
All rights reserved. © 2002-2018 PaperCept, Inc.
Page generated 2018-08-21  18:14:46 PST  Terms of use