IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v47y2024i5d10.1007_s10878-024-01148-4.html
   My bibliography  Save this article

Multiple shooting approach for finding approximately shortest paths for autonomous robots in unknown environments in 2D

Author

Listed:
  • Phan Thanh An

    (Ho Chi Minh City University of Technology (HCMUT)
    Vietnam National University Ho Chi Minh City)

  • Nguyen Thi Le

    (People’s Security Academy
    Vietnam Academy of Science and Technology (VAST))

Abstract

An autonomous robot with a limited vision range finds a path to the goal in an unknown environment in 2D avoiding polygonal obstacles. In the process of discovering the environmental map, the robot has to return to some positions marked previously, the regions where the robot traverses to reach that position are defined as sequences of bundles of line segments. This paper presents a novel algorithm for finding approximately shortest paths along the sequences of bundles of line segments based on the method of multiple shooting. Three factors of the approach including bundle partition, collinear condition, and update of shooting points are presented. We then show that if the collinear condition holds, the exact shortest path of the problem is determined, otherwise, the sequence lengths of paths obtained by the update of the method converges. The algorithm is implemented in Python and some numerical examples show that the running time of path-planing for autonomous robots using our method is faster than that using the rubber band technique of Li and Klette in Euclidean Shortest Paths, Springer, 53–89 (2011).

Suggested Citation

  • Phan Thanh An & Nguyen Thi Le, 2024. "Multiple shooting approach for finding approximately shortest paths for autonomous robots in unknown environments in 2D," Journal of Combinatorial Optimization, Springer, vol. 47(5), pages 1-32, July.
    • Handle: RePEc:spr:jcomop:v:47:y:2024:i:5:d:10.1007_s10878-024-01148-4
    DOI: 10.1007/s10878-024-01148-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-024-01148-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-024-01148-4?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:spr:jcomop:v:47:y:2024:i:5:d:10.1007_s10878-024-01148-4. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.