Referenced Items are not available for this document.
Navigation functions on forests of stars, geometrically complicated C-spaces (configuration spaces) that are topologically indistinguishable from a simple disc punctured by disjoint smaller discs representing model obstacles, are constructed. For reasons of mathematical tractability, each C-space obstacle is approximated by a Boolean combination of linear and quadratic polynomial inequalities (with sharp corners allowed), and a calculus of implicit representations is used to effectively represent such obstacles. Evidence is provided of the effectiveness of this technology of implicit representations in the form of several simulation studies
Published in:
Robotics and Automation, 1990. Proceedings., 1990 IEEE International Conference on
Date of Conference: 13-18 May 1990
- Page(s):
- 1937 - 1942 vol.3
- Meeting Date :
- 13 May 1990-18 May 1990
- Print ISBN:
- 0-8186-9061-5
- INSPEC Accession Number:
- 3886697
- Conference Location :
- Cincinnati, OH
- Digital Object Identifier :
- 10.1109/ROBOT.1990.126291
- Product Type:
- Conference Publications
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.
