By Topic

Distance computing between general shape preprocessed obstacles and general segments-based robot

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

3 Author(s)
O. Habert ; Lab. d'Autom. des Syst. Cooperatifs, Metz, France ; H. Bullier ; A. Pruski

We present in this paper a method for distance computing in an encoded environment. The proposed method allows to find the closest point between a general polygonal shape obstacle (a robot) and some complex general shapes objects (the obstacles). Due to the discretized aspect of the model, the algorithm complexity does not depend on the obstacles number and shape. In order to have a preprocessed model, the multivalue number coding has been used. Such a distance computing can be used in mobile robotics field as a basic tool in local path planning algorithms or in more sophisticated general paths planners. All the proposed algorithms follow a general schema which makes their implementation easier in an oriented object language, using a series of class

Published in:

Intelligent Robots and Systems, 1997. IROS '97., Proceedings of the 1997 IEEE/RSJ International Conference on  (Volume:3 )

Date of Conference:

7-11 Sep 1997