Abstract
This paper presents an approach to fast mapping of obstacles from a workspace into a configuration space, based on defining some specific points in the workspace as fundamental obstacles. In order to achieve this objective, we propose efficient algorithms for mapping complex Cartesian obstacles by determining their critical points. The computational time required for mapping a two-dimensional obstacle is approximately 5 ms with a 33 Mhz 80486 CPU. Obstacle mapping in this paper is based on a CAD model of an environment that provide global information. The proposed mapping procedure and algorithms are suitable for industrial manipulators with a symmetric workspace occupied by polygonal obstacles.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Dynamic Systems, Measurement, and Control
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
