IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v231y2025icp294-317.html
   My bibliography  Save this article

SBA*: An efficient method for 3D path planning of unmanned vehicles

Author

Listed:
  • Akay, Rustu
  • Yildirim, Mustafa Yusuf

Abstract

Recently, researchers have stated that the movement of unmanned vehicles (UVs) in 3D environments is more complex compared to 2D due to extra height and depth dimensions, and they have focused on the development of UV technology in this direction. Especially in path planning problems, studies on different parameters such as time, distance and energy consumption have gained importance. This paper focuses on path planning efficiency in complex 3D environments and proposes a method called Segment Based A* (SBA*), which runs on graphs created using random nodes. In this method, the path initially planned with A* on a global graph is divided into segments, and new local graphs are created on these segments for more efficient path planning. Extensive simulations in both 2D and 3D environments with various obstacle configurations demonstrate that SBA* significantly outperforms traditional algorithms in terms of key performance metrics including path length, total rotation angle, number of sharp turns and smoothness ratio. These improvements indicate that SBA* not only enhances path efficiency but also considerably reduces energy consumption, making it a valuable contribution to practical applications in UV technology.

Suggested Citation

  • Akay, Rustu & Yildirim, Mustafa Yusuf, 2025. "SBA*: An efficient method for 3D path planning of unmanned vehicles," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 231(C), pages 294-317.
  • Handle: RePEc:eee:matcom:v:231:y:2025:i:c:p:294-317
    DOI: 10.1016/j.matcom.2024.12.015
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475424004889
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.matcom.2024.12.015?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:eee:matcom:v:231:y:2025:i:c:p:294-317. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.