By Topic

Finding the shortest path of a disc among polygonal obstacles using a radius-independent graph

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yun-Hui Liu ; Dept. of Mech. & Autom. Eng., Chinese Univ. of Hong Kong, Shatin, Hong Kong ; S. Arimoto

An algorithm for finding the shortest path of a disc among a set of polygonal obstacles is presented. Let Nt denote the total number of obstacle vertices and Nc the number of convex vertices. Our algorithm uses a radius-independent data structure called extended tangent graph (ETG) which registers collision-free tangents of the obstacles according to different discs and takes O(Nc2) space. The ETG depends only on original obstacles, and it is constructed in advance without using any information about the disc in O((Nc+k)Nt) computation time, where k is the number of outer common tangents of the obstacles. It takes O(NtlogNt) time to partially update the ETG to reflect the start and goal of a given disc. The shortest path is planned by a graph-search algorithm

Published in:

IEEE Transactions on Robotics and Automation  (Volume:11 ,  Issue: 5 )