IDEAS home Printed from https://ideas.repec.org/a/hin/complx/9104720.html
   My bibliography  Save this article

Maximizing the Coverage of Roadmap Graph for Optimal Motion Planning

Author

Listed:
  • Jae-Han Park
  • Tae-Woong Yoon

Abstract

Automated motion-planning technologies for industrial robots are critical for their application to Industry 4.0. Various sampling-based methods have been studied to generate the collision-free motion of articulated industrial robots. Such sampling-based methods provide efficient solutions to complex planning problems, but their limitations hinder the attainment of optimal results. This paper considers a method to obtain the optimal results in the roadmap algorithm that is representative of the sampling-based method. We define the coverage of a graph as a performance index of its optimality as constructed by a sampling-based algorithm and propose an optimization algorithm that can maximize graph coverage in the configuration space. The proposed method was applied to the model of an industrial robot, and the results of the simulation confirm that the roadmap graph obtained by the proposed algorithm can generate results of satisfactory quality in path-finding tests under various conditions.

Suggested Citation

  • Jae-Han Park & Tae-Woong Yoon, 2018. "Maximizing the Coverage of Roadmap Graph for Optimal Motion Planning," Complexity, Hindawi, vol. 2018, pages 1-23, November.
    • Handle: RePEc:hin:complx:9104720
    DOI: 10.1155/2018/9104720
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/8503/2018/9104720.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/8503/2018/9104720.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2018/9104720?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Kurt Marti, 2008. "Stochastic Optimization Methods," Springer Books, Springer, number 978-3-540-79458-5, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Kwok Tai Chui & Wadee Alhalabi & Sally Shuk Han Pang & Patricia Ordóñez de Pablos & Ryan Wen Liu & Mingbo Zhao, 2017. "Disease Diagnosis in Smart Healthcare: Innovation, Technologies and Applications," Sustainability, MDPI, vol. 9(12), pages 1-23, December.
    2. Carolina Osorio & Michel Bierlaire, 2013. "A Simulation-Based Optimization Framework for Urban Transportation Problems," Operations Research, INFORMS, vol. 61(6), pages 1333-1345, December.
    3. Carolina Osorio & Linsen Chong, 2015. "A Computationally Efficient Simulation-Based Optimization Algorithm for Large-Scale Urban Transportation Problems," Transportation Science, INFORMS, vol. 49(3), pages 623-636, August.
    4. Denis Becker & Alexei Gaivoronski, 2014. "Stochastic optimization on social networks with application to service pricing," Computational Management Science, Springer, vol. 11(4), pages 531-562, October.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:complx:9104720. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.