By Topic

Efficient method to generate collision free paths for an autonomous mobile robot based on new free space structuring approach

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)
M. K. Habib ; Dept. of Control. & Syst. Eng., Univ. of Technol., Baghdad, Iraq ; H. Asama

A technique is developed based on free link concept to construct the available free space between obstacles within robot's environment in terms of free convex area. Then, a new kind of vertex graph called MAKLINK is constructed to support the generation of a collision free path. This graph is constructed using the midpoints of common free links between free convex area as passing points. These points correspond to nodes in a graph and the connection between them within each convex area as arcs in this graph. A collision free path can be efficiently generated using the MAKLINK graph. The complexity of the search for a collision free path is greatly reduced by minimizing the size of the graph to be searched concerning the number of nodes and the number of arcs connecting them. The analysis of the proposed algorithm shows its efficiency in terms of computation ability, safety, optimality, and in supporting robot navigation along the generated path

Published in:

Intelligent Robots and Systems '91. 'Intelligence for Mechanical Systems, Proceedings IROS '91. IEEE/RSJ International Workshop on

Date of Conference:

3-5 Nov 1991