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

Mobile Robots Path Planning Using the Overall Conflict Resolution and Time Baseline Coordination

Author

Listed:
  • Yong Ma
  • Hongwei Wang
  • Langxiong Gan
  • Min Guo
  • Liwen Huang
  • Jing Zhang

Abstract

This paper aims at resolving the path planning problem in a time-varying environment based on the idea of overall conflict resolution and the algorithm of time baseline coordination. The basic task of the introduced path planning algorithms is to fulfill the automatic generation of the shortest paths from the defined start poses to their end poses with consideration of generous constraints for multiple mobile robots. Building on this, by using the overall conflict resolution, within the polynomial based paths, we take into account all the constraints including smoothness, motion boundary, kinematics constraints, obstacle avoidance, and safety constraints among robots together. And time baseline coordination algorithm is proposed to process the above formulated problem. The foremost strong point is that much time can be saved with our approach. Numerical simulations verify the effectiveness of our approach.

Suggested Citation

  • Yong Ma & Hongwei Wang & Langxiong Gan & Min Guo & Liwen Huang & Jing Zhang, 2014. "Mobile Robots Path Planning Using the Overall Conflict Resolution and Time Baseline Coordination," Mathematical Problems in Engineering, Hindawi, vol. 2014, pages 1-13, June.
    • Handle: RePEc:hin:jnlmpe:902587
    DOI: 10.1155/2014/902587
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2014/902587.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2014/902587.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2014/902587?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
    ---><---

    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:jnlmpe:902587. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.