Advanced Search

Journal Navigation

Journal Home

Subscriptions

Archive

Contact Us

Table of Contents

Sign In to gain access to subscriptions and/or personal tools.
The International Journal of Robotics Research
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to Saved Citations
Right arrow Download to citation manager
Right arrowRequest Permissions
Right arrow Request Reprints
Right arrow Add to My Marked Citations
Citing Articles
Right arrow Citing Articles via Web of Science (3)
Right arrow Citing Articles via Google Scholar
Right arrow Citing Articles via Scopus
Google Scholar
Right arrow Articles by Chu, Y. X.
Right arrow Articles by Li, Z. X.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Complore   Add to Connotea   Add to Del.icio.us   Add to Digg   Add to Reddit   Add to Technorati   Add to Twitter  
What's this?

On the Hybrid Localization/Envelopment Problem

Y. X. Chu

J. B. Gou

Z. X. Li

Department of Electrical and Electronic Engineering, Hong Kong University of Science and Technology, Clearwater Bay, Kowloon, Hong Kongeechuyx{at}ee.ust.hk

The problem of aligning the CAD model of a workpiece such that all points measured on the finished surfaces of the workpiece match closely to corresponding surfaces on the model while all unmachined surfaces lie outside the model is referred to as the hybrid localization/envelopment problem. The hybrid problem has important applications in setting up for machining of partially finished workpieces. This paper gives a formulation of the hybrid localization/envelopment problem, and presents a simple algorithm for computing its solutions. First, we show that when the finished surfaces of a workpiece are inadequate to fully constrain the rigid motions of the workpiece, then the set of free motions remaining must form a subgroup G0 of the Euclidean group SE(3). This allows us to decompose the hybrid problem into a (symmetric) localization problem on the homogeneous space SE(3)/G0 and an envelopment problem on G0. While the symmetric localization problem is solved using the fast symmetric localization (FSL) algorithm developed in one of our earlier papers, the envelopment problem is solved by computing the solutions of a sequence of linear programming (LP) problems. We derive explicitly the LP problems, and apply standard linear programming techniques to solve the LP problems. We present simulation results to demonstrate the effectiveness of our method for the hybrid problem.

Key Words: envelopment problem • symmetric localization • hybrid localization/envelopment • Euclidean group • symmetry subgroup • homogeneous spaces • partially machined workpieces

The International Journal of Robotics Research, Vol. 18, No. 5, 491-501 (1999)
DOI: 10.1177/027836499901800505


Add to CiteULike CiteULike   Add to Complore Complore   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us   Add to Digg Digg   Add to Reddit Reddit   Add to Technorati Technorati   Add to Twitter Twitter    What's this?