Hostname: page-component-7c8c6479df-p566r Total loading time: 0 Render date: 2024-03-29T00:14:58.761Z Has data issue: false hasContentIssue false

On the construction of discretized configuration space of manipulators

Published online by Cambridge University Press:  08 August 2006

X. J. Wu
Affiliation:
School of Mechanical and Aerospace Engineering, Nanyang Technological University, 50 Nanyang Avenue, Singapore 639798
J. Tang
Affiliation:
Department of Mechanical Engineering, University of Connecticut, 191 Auditorium Road, Unit 3139, Storrs, CT 06269, USA
K. H. Heng
Affiliation:
School of Mechanical and Aerospace Engineering, Nanyang Technological University, 50 Nanyang Avenue, Singapore 639798

Abstract

In this research, we study the construction of configuration space (C-space) of manipulators. The proposed approach is based upon precomputing the global topology of a robot's free space, and consists of an offline phase and an online phase. In the offline phase, a C-space obstacle database (COD) for a given robot is developed in which the C-space obstacle (C-obstacle) maps are stored and indexed by the cells of the workspace; in the online phase when the same robot is operated in a real environment, those maps whose indices match the real obstacle cells are identified and then extracted from the COD. The superposition of these maps forms forbidden region in operation. This proposed approach is a generic one and can be applied to manipulators with arbitrary kinematic structures and geometries. The construction of the COD, which is generally the most time-consuming step, is implemented in the offline phase, and the online computing only involves the identification of the components matching the COD indices. Therefore, this proposed approach for C-space construction can be realized in a real-time online fashion and is especially suitable for robot manipulation under dynamic operations. We carry out analyses on several types of manipulators to verify and demonstrate the feasibility and efficiency of the proposed approach.

Type
Article
Copyright
2006 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)