政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/75051
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 113318/144297 (79%)
Visitors : 51064386      Online Users : 940
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/75051


    Title: On-Line Manipulation Planning for Two Robot Arms in a Dynamic Environment
    Authors: Li, Tsai-yen;Latombe, Jean-claude
    李蔡彥
    Contributors: 資科系
    Date: 1997
    Issue Date: 2015-05-08 16:04:30 (UTC+8)
    Abstract: In a constantly changing and partially unpredictable envi ronment, robot-motion planning must be on-line. The planner receives a continuous flow of information about occurring events and generates new plans while previously planned mo tions are being executed. This article describes an on-line planner for two cooperating arms whose task is to grab parts of various types on a conveyor belt and transfer them to their respective goals, while avoiding collisions with obstacles. Parts arrive on the belt in random order, at any time. Both goals and obstacles may be dynamically changed. This scenario is typi cal of manufacturing cells serving machine tools, assembling products, or packaging objects. The proposed approach breaks the overall planning problem into subproblems, each involving a low-dimensional configuration or configuration x time space, and orchestrates very fast primitives solving these subproblems. The resulting planner has been implemented and extensively tested in a simulated environment, as well as with a real dual- arm system. Its competitiveness has been evaluated against an oracle making (almost) the best decision at any one time; the results show that the planner compares extremely well.
    Relation: International Journal of Robotic Research - IJRR , vol. 16, no. 2, pp. 144-167
    Data Type: article
    DOI link: http://dx.doi.org/10.1177/027836499701600202
    DOI: 10.1177/027836499701600202
    Appears in Collections:[Department of Computer Science ] Periodical Articles

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML21002View/Open


    All items in 政大典藏 are protected by copyright, with all rights reserved.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback