File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1115/1.1870013
- Scopus: eid_2-s2.0-19344371007
- WOS: WOS:000229257100022
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Robot path planning for dimensional measurement in automotive manufacturing
Title | Robot path planning for dimensional measurement in automotive manufacturing |
---|---|
Authors | |
Keywords | Sensor Planning Traveling Salesman Problem CAD/CAM Dimensional Inspection Path Planning |
Issue Date | 2005 |
Citation | Journal of Manufacturing Science and Engineering, Transactions of the ASME, 2005, v. 127, n. 2, p. 420-428 How to Cite? |
Abstract | This paper addresses the robot path planning problem in our effort to develop a fully automated dimensional measurement system using an eye-in-hand robotic manipulator. First, the CAD-based vision sensor planning system developed in our lab is briefly introduced; it uses both the CAD model and the camera model to plan camera viewpoints. The planning system employs a decomposition-based approach to generate camera viewpoints that satisfy given task constraints. Second, to improve the efficiency of the eye-in-hand robot inspection system, robot path planning is studied, which is the focus of this paper. This problem is rendered as a Traveling Salesman Problem (TSP). A new hierarchical approach is developed to solve the TSP into its suboptimality. Instead of solving a large size TSP, this approach utilizes the clustering nature of the viewpoints and converts the TSP into a clustered Traveling Salesman Problem (CTSP). A new algorithm, which favors the intergroup paths, is proposed to solve the CTSP quickly. Performance of the new algorithm is analyzed. It is shown that instead of a fixed performance ratio as reported in some existing work, a constant bound can be achieved which is related to the diameter of the clusters. Experimental results demonstrate the effectiveness of the robot motion planning system. The proposed path planning approach can obtain sub-optimal solutions quickly for many large scale TSPs, which are common problems in many robotic applications. Copyright © 2005 by ASME. |
Persistent Identifier | http://hdl.handle.net/10722/212807 |
ISSN | 2023 Impact Factor: 2.4 2023 SCImago Journal Rankings: 0.719 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Sheng, Weihua | - |
dc.contributor.author | Xi, Ning | - |
dc.contributor.author | Song, Mumin | - |
dc.contributor.author | Chen, Yifan | - |
dc.date.accessioned | 2015-07-28T04:05:04Z | - |
dc.date.available | 2015-07-28T04:05:04Z | - |
dc.date.issued | 2005 | - |
dc.identifier.citation | Journal of Manufacturing Science and Engineering, Transactions of the ASME, 2005, v. 127, n. 2, p. 420-428 | - |
dc.identifier.issn | 1087-1357 | - |
dc.identifier.uri | http://hdl.handle.net/10722/212807 | - |
dc.description.abstract | This paper addresses the robot path planning problem in our effort to develop a fully automated dimensional measurement system using an eye-in-hand robotic manipulator. First, the CAD-based vision sensor planning system developed in our lab is briefly introduced; it uses both the CAD model and the camera model to plan camera viewpoints. The planning system employs a decomposition-based approach to generate camera viewpoints that satisfy given task constraints. Second, to improve the efficiency of the eye-in-hand robot inspection system, robot path planning is studied, which is the focus of this paper. This problem is rendered as a Traveling Salesman Problem (TSP). A new hierarchical approach is developed to solve the TSP into its suboptimality. Instead of solving a large size TSP, this approach utilizes the clustering nature of the viewpoints and converts the TSP into a clustered Traveling Salesman Problem (CTSP). A new algorithm, which favors the intergroup paths, is proposed to solve the CTSP quickly. Performance of the new algorithm is analyzed. It is shown that instead of a fixed performance ratio as reported in some existing work, a constant bound can be achieved which is related to the diameter of the clusters. Experimental results demonstrate the effectiveness of the robot motion planning system. The proposed path planning approach can obtain sub-optimal solutions quickly for many large scale TSPs, which are common problems in many robotic applications. Copyright © 2005 by ASME. | - |
dc.language | eng | - |
dc.relation.ispartof | Journal of Manufacturing Science and Engineering, Transactions of the ASME | - |
dc.subject | Sensor Planning | - |
dc.subject | Traveling Salesman Problem | - |
dc.subject | CAD/CAM | - |
dc.subject | Dimensional Inspection | - |
dc.subject | Path Planning | - |
dc.title | Robot path planning for dimensional measurement in automotive manufacturing | - |
dc.type | Article | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1115/1.1870013 | - |
dc.identifier.scopus | eid_2-s2.0-19344371007 | - |
dc.identifier.volume | 127 | - |
dc.identifier.issue | 2 | - |
dc.identifier.spage | 420 | - |
dc.identifier.epage | 428 | - |
dc.identifier.isi | WOS:000229257100022 | - |
dc.identifier.issnl | 1087-1357 | - |