Cart (Loading....) | Create Account
Close category search window
 

Motion planning with planar geometric models

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
$31 $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)
Kim Myung-Soo ; Dept. of Comput. Sci., POSTECH, Pohang, South Korea ; Moon Sang-Ryong ; Lee Kwan-Hee

Algebraic algorithms for collision-avoidance robot motion planning problems with planar geometric models are presented. By decomposing the collision-free space into horizontal vertex visibility cells and connecting these cells into a connectivity graph, the global topological structure of collision-free space is represented. Using the C-space obstacle boundaries and this connectivity graph, exact (nonheuristic) compliant and gross motion paths of planar curved objects moving with a fixed orientation amidst similar obstacles are generated. The gross motion planning algorithm is further, extended (using approximations) to the case of objects moving with both translations and rotations by using the conventional slicing method

Published in:

Robotics and Automation, 1991. Proceedings., 1991 IEEE International Conference on

Date of Conference:

9-11 Apr 1991

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.