Close category search window
 

Collision avoidance in a multiple robot set up by polytree intersection method

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

2 Author(s)
Ghoshray, S. ; Dept. of Electr. & Comput. Eng., Florida Int. Univ., Miami, FL, USA ; Yen, K.K.

In this research, we propose a new obstacle avoidance algorithm in which collision-free path for a robot is determined when a set of multiple robots are present in the workspace. The proposed obstacle avoidance algorithm is developed based upon the geometric modeling of the robot workspace using polytree data structure. Polytree is a hierarchical bisection of either a two-dimensional region or a three-dimensional space, based on some specific splitting rules. Our algorithm finds possible intersection between any configuration of a moving robot and the obstacles in the workspace by parallel traversal of integrated polytrees

Published in:
Systems, Man and Cybernetics, 1995. Intelligent Systems for the 21st Century., IEEE International Conference on  (Volume:3 )

Date of Conference: 22-25 Oct 1995

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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.