File Download
There are no files associated with this item.
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Optimization in automated surface inspection of stamped automotive parts
| Title | Optimization in automated surface inspection of stamped automotive parts |
|---|---|
| Authors | |
| Issue Date | 2002 |
| Citation | IEEE International Conference on Intelligent Robots and Systems, 2002, v. 2, p. 1850-1855 How to Cite? |
| Abstract | This paper addresses the robot path planning problem for automotive part inspection using structured light method. This problem is rendered as a Traveling Salesman Problem (TSP). A new approach is developed to solve the TSP into its sub-optimality quickly. Instead of solving a large size TSP, this approach utilizes the clustered nature of the viewpoints and converts the TSP into a clustered Traveling Salesman Problem (CTSP). A new algorithm, which favors the inter-group paths, is proposed to solve the CTSP. Experimental results on various automotive parts validate the new algorithm. |
| Persistent Identifier | http://hdl.handle.net/10722/212753 |
| 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:04:54Z | - |
| dc.date.available | 2015-07-28T04:04:54Z | - |
| dc.date.issued | 2002 | - |
| dc.identifier.citation | IEEE International Conference on Intelligent Robots and Systems, 2002, v. 2, p. 1850-1855 | - |
| dc.identifier.uri | http://hdl.handle.net/10722/212753 | - |
| dc.description.abstract | This paper addresses the robot path planning problem for automotive part inspection using structured light method. This problem is rendered as a Traveling Salesman Problem (TSP). A new approach is developed to solve the TSP into its sub-optimality quickly. Instead of solving a large size TSP, this approach utilizes the clustered nature of the viewpoints and converts the TSP into a clustered Traveling Salesman Problem (CTSP). A new algorithm, which favors the inter-group paths, is proposed to solve the CTSP. Experimental results on various automotive parts validate the new algorithm. | - |
| dc.language | eng | - |
| dc.relation.ispartof | IEEE International Conference on Intelligent Robots and Systems | - |
| dc.title | Optimization in automated surface inspection of stamped automotive parts | - |
| dc.type | Conference_Paper | - |
| dc.description.nature | link_to_subscribed_fulltext | - |
| dc.identifier.scopus | eid_2-s2.0-0036448889 | - |
| dc.identifier.volume | 2 | - |
| dc.identifier.spage | 1850 | - |
| dc.identifier.epage | 1855 | - |