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.

    References listed on IDEAS

    as
    1. Fan Yang & Xi Fang & Fei Gao & Xianjin Zhou & Hao Li & Hongbin Jin & Yu Song & Shi Cheng, 2022. "Obstacle Avoidance Path Planning for UAV Based on Improved RRT Algorithm," Discrete Dynamics in Nature and Society, Hindawi, vol. 2022, pages 1-9, January.
    2. Dilip Mandloi & Rajeev Arya & Ajit K. Verma, 2021. "Unmanned aerial vehicle path planning based on A* algorithm and its variants in 3d environment," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 12(5), pages 990-1000, October.
    3. Richard Bellman, 1954. "Some Applications of the Theory of Dynamic Programming---A Review," Operations Research, INFORMS, vol. 2(3), pages 275-288, August.
    4. Richard Bellman, 1954. "On some applications of the theory of dynamic programming to logistics," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 1(2), pages 141-153, June.
    5. Weimin Li & Lei Wang & Awei Zou & Jingcao Cai & Huijuan He & Tielong Tan, 2022. "Path Planning for UAV Based on Improved PRM," Energies, MDPI, vol. 15(19), pages 1-16, October.
    6. Pan, Jeng-Shyang & Lv, Ji-Xiang & Yan, Li-Jun & Weng, Shao-Wei & Chu, Shu-Chuan & Xue, Jian-Kai, 2022. "Golden eagle optimizer with double learning strategies for 3D path planning of UAV in power inspection," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 193(C), pages 509-532.
    7. Xiaojing Wu & Lei Xu & Ran Zhen & Xueli Wu, 2019. "Biased Sampling Potentially Guided Intelligent Bidirectional RRT ∗ Algorithm for UAV Path Planning in 3D Environment," Mathematical Problems in Engineering, Hindawi, vol. 2019, pages 1-12, November.
    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. Xiaoyue Li & John M. Mulvey, 2023. "Optimal Portfolio Execution in a Regime-switching Market with Non-linear Impact Costs: Combining Dynamic Program and Neural Network," Papers 2306.08809, arXiv.org.
    2. Mahmoud Mahfouz & Angelos Filos & Cyrine Chtourou & Joshua Lockhart & Samuel Assefa & Manuela Veloso & Danilo Mandic & Tucker Balch, 2019. "On the Importance of Opponent Modeling in Auction Markets," Papers 1911.12816, arXiv.org.
    3. Dawei Chen & Fangxu Mo & Ye Chen & Jun Zhang & Xinyu You, 2022. "Optimization of Ramp Locations along Freeways: A Dynamic Programming Approach," Sustainability, MDPI, vol. 14(15), pages 1-13, August.
    4. Harrold, Daniel J.B. & Cao, Jun & Fan, Zhong, 2022. "Data-driven battery operation for energy arbitrage using rainbow deep reinforcement learning," Energy, Elsevier, vol. 238(PC).
    5. Vanvuchelen, Nathalie & De Boeck, Kim & Boute, Robert N., 2024. "Cluster-based lateral transshipments for the Zambian health supply chain," European Journal of Operational Research, Elsevier, vol. 313(1), pages 373-386.
    6. Wadi Khalid Anuar & Lai Soon Lee & Hsin-Vonn Seow & Stefan Pickl, 2021. "A Multi-Depot Vehicle Routing Problem with Stochastic Road Capacity and Reduced Two-Stage Stochastic Integer Linear Programming Models for Rollout Algorithm," Mathematics, MDPI, vol. 9(13), pages 1-44, July.
    7. Matthias Breuer & David Windisch, 2019. "Investment Dynamics and Earnings‐Return Properties: A Structural Approach," Journal of Accounting Research, Wiley Blackwell, vol. 57(3), pages 639-674, June.
    8. Diefenbach, Heiko & Emde, Simon & Glock, Christoph H., 2020. "Loading tow trains ergonomically for just-in-time part supply," European Journal of Operational Research, Elsevier, vol. 284(1), pages 325-344.
    9. Michael J. Pennock & William B. Rouse & Diane L. Kollar, 2007. "Transforming the Acquisition Enterprise: A Framework for Analysis and a Case Study of Ship Acquisition," Systems Engineering, John Wiley & Sons, vol. 10(2), pages 99-117, June.
    10. Quetschlich, Mathias & Moetz, André & Otto, Boris, 2021. "Optimisation model for multi-item multi-echelon supply chains with nested multi-level products," European Journal of Operational Research, Elsevier, vol. 290(1), pages 144-158.
    11. Sasanka Adikari & Norou Diawara, 2024. "Utility in Time Description in Priority Best–Worst Discrete Choice Models: An Empirical Evaluation Using Flynn’s Data," Stats, MDPI, vol. 7(1), pages 1-18, February.
    12. Coit, David W. & Zio, Enrico, 2019. "The evolution of system reliability optimization," Reliability Engineering and System Safety, Elsevier, vol. 192(C).
    13. Peng, Hujun & Li, Jianxiang & Löwenstein, Lars & Hameyer, Kay, 2020. "A scalable, causal, adaptive energy management strategy based on optimal control theory for a fuel cell hybrid railway vehicle," Applied Energy, Elsevier, vol. 267(C).
    14. Vincent Huang & James Unwin, 2019. "Markov Chain Models of Refugee Migration Data," Papers 1903.08255, arXiv.org.
    15. Esmaeili Aliabadi, Danial & Chan, Katrina, 2022. "The emerging threat of artificial intelligence on competition in liberalized electricity markets: A deep Q-network approach," Applied Energy, Elsevier, vol. 325(C).
    16. Alex Sharp & Ryan Browne, 2021. "Functional data clustering by projection into latent generalized hyperbolic subspaces," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 15(3), pages 735-757, September.
    17. Thomas L. Magnanti, 2021. "Optimization: From Its Inception," Management Science, INFORMS, vol. 67(9), pages 5349-5363, September.
    18. G., Mauricio Contreras & Peña, Juan Pablo, 2019. "The quantum dark side of the optimal control theory," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 515(C), pages 450-473.
    19. Yann Disser & John Fearnley & Martin Gairing & Oliver Göbel & Max Klimm & Daniel Schmand & Alexander Skopalik & Andreas Tönnis, 2020. "Hiring Secretaries over Time: The Benefit of Concurrent Employment," Mathematics of Operations Research, INFORMS, vol. 45(1), pages 323-352, February.
    20. Sean Williams & Michael Short & Tracey Crosbie & Maryam Shadman-Pajouh, 2020. "A Decentralized Informatics, Optimization, and Control Framework for Evolving Demand Response Services," Energies, MDPI, vol. 13(16), pages 1-30, August.

    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.

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