YaBeSH Engineering and Technology Library

    • Journals
    • PaperQuest
    • YSE Standards
    • YaBeSH
    • Login
    View Item 
    •   YE&T Library
    • ASME
    • Journal of Manufacturing Science and Engineering
    • View Item
    •   YE&T Library
    • ASME
    • Journal of Manufacturing Science and Engineering
    • View Item
    • All Fields
    • Source Title
    • Year
    • Publisher
    • Title
    • Subject
    • Author
    • DOI
    • ISBN
    Advanced Search
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Archive

    Robot Path Planning for Dimensional Measurement in Automotive Manufacturing

    Source: Journal of Manufacturing Science and Engineering:;2005:;volume( 127 ):;issue: 002::page 420
    Author:
    Weihua Sheng
    ,
    Ning Xi
    ,
    Mumin Song
    ,
    Yifan Chen
    DOI: 10.1115/1.1870013
    Publisher: The American Society of Mechanical Engineers (ASME)
    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.
    keyword(s): Robots , Algorithms , Path planning , Travel AND Manufacturing ,
    • Download: (196.0Kb)
    • Show Full MetaData Hide Full MetaData
    • Get RIS
    • Item Order
    • Go To Publisher
    • Price: 5000 Rial
    • Statistics

      Robot Path Planning for Dimensional Measurement in Automotive Manufacturing

    URI
    http://yetl.yabesh.ir/yetl1/handle/yetl/132208
    Collections
    • Journal of Manufacturing Science and Engineering

    Show full item record

    contributor authorWeihua Sheng
    contributor authorNing Xi
    contributor authorMumin Song
    contributor authorYifan Chen
    date accessioned2017-05-09T00:16:59Z
    date available2017-05-09T00:16:59Z
    date copyrightMay, 2005
    date issued2005
    identifier issn1087-1357
    identifier otherJMSEFK-27864#420_1.pdf
    identifier urihttp://yetl.yabesh.ir/yetl/handle/yetl/132208
    description abstractThis 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.
    publisherThe American Society of Mechanical Engineers (ASME)
    titleRobot Path Planning for Dimensional Measurement in Automotive Manufacturing
    typeJournal Paper
    journal volume127
    journal issue2
    journal titleJournal of Manufacturing Science and Engineering
    identifier doi10.1115/1.1870013
    journal fristpage420
    journal lastpage428
    identifier eissn1528-8935
    keywordsRobots
    keywordsAlgorithms
    keywordsPath planning
    keywordsTravel AND Manufacturing
    treeJournal of Manufacturing Science and Engineering:;2005:;volume( 127 ):;issue: 002
    contenttypeFulltext
    DSpace software copyright © 2002-2015  DuraSpace
    نرم افزار کتابخانه دیجیتال "دی اسپیس" فارسی شده توسط یابش برای کتابخانه های ایرانی | تماس با یابش
    yabeshDSpacePersian
     
    DSpace software copyright © 2002-2015  DuraSpace
    نرم افزار کتابخانه دیجیتال "دی اسپیس" فارسی شده توسط یابش برای کتابخانه های ایرانی | تماس با یابش
    yabeshDSpacePersian