A Statistically Rigorous Analysis of 2D Path-Planning Algorithms

被引：0
|
作者：
机构：
[1] Muñoz, Pablo
[2] Barrero, David F.
[3] R-Moreno, María D.
来源：
R-Moreno, María D. (mdolores@aut.uah.es) | 1600年 / Oxford University Press卷 / 58期
关键词：
Path-planning is a well-known studied problem in Artificial Intelligence. Given two points in a map; path-planning algorithms search for a path that joins those two points; avoiding obstacles. It is a challenging problem with important practical applications in a wide range of applications: autonomous mobile robotics; logistics or video games; just to mention some of them. Given its importance; it has attracted much research; resulting in a large number of algorithms; some classical; such as A∗; other more specialized; such as swarms. However; despite all the literature dedicated to this problem; the statistics used to analyze experimental results in most cases are naïve. In this paper; we position in favor of the need of incorporating stronger statistical methods in path-planning empirical research and promote a debate in the research community. To this end; we analyze some 2D-grid classical path-planning algorithms in discrete domains (i.e. A∗ and A∗ with post-processing) and more recent algorithms in continuous domains (i.e. Theta∗ and S-Theta∗). Given the differences of these algorithms; we study them under different criteria: Run-time; number of heading changes; number of expanded vertices and path-length. © The British Computer Society 2014. All rights reserved;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Journal article (JA)
引用
收藏
相关论文
共 50 条
  • [31] Path Planning for Line Marking Robots Using 2D Dubins' Path
    Hameed, Ibrahim A.
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON ADVANCED INTELLIGENT SYSTEMS AND INFORMATICS 2016, 2017, 533 : 900 - 910
  • [32] Past, Present and Future of Path-Planning Algorithms for Mobile Robot Navigation in Dynamic Environments
    Hewawasam, H. S.
    Ibrahim, M. Yousef
    Appuhamillage, Gayan Kahandawa
    IEEE OPEN JOURNAL OF THE INDUSTRIAL ELECTRONICS SOCIETY, 2022, 3 : 353 - 365
  • [33] A Review of UAV Path-Planning Algorithms and Obstacle Avoidance Methods for Remote Sensing Applications
    Debnath, Dipraj
    Vanegas, Fernando
    Sandino, Juan
    Hawary, Ahmad Faizul
    Gonzalez, Felipe
    REMOTE SENSING, 2024, 16 (21)
  • [34] 2D PATH PLANNING - A CONFIGURATION SPACE HEURISTIC APPROACH
    ILARI, J
    TORRAS, C
    INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH, 1990, 9 (01): : 75 - 91
  • [35] 2D Map Building and Path Planning Based on LiDAR
    Zhang, Chi
    Wang, Junzheng
    Li, Jing
    Yan, Min
    2017 4TH INTERNATIONAL CONFERENCE ON INFORMATION SCIENCE AND CONTROL ENGINEERING (ICISCE), 2017, : 783 - 787
  • [36] Path Planning for a Group of Vehicles in 2D Obstructed Environment
    Pshikhopov, V. Kh
    Medvedev, M. Y.
    Shevchenko, V. A.
    2016 16TH INTERNATIONAL CONFERENCE ON CONTROL, AUTOMATION AND SYSTEMS (ICCAS), 2016, : 769 - 774
  • [37] Comparative analysis of popular mobile robot roadmap path-planning methods
    Ayawli, Ben Beklisi Kwame
    Dawson, John Kwao
    Badu, Esther
    Ayawli, Irene Esinam Beklisi
    Lamusah, Dawda
    ROBOTICA, 2025,
  • [38] Path-planning algorithms for self-driving vehicles based on improved RRT-Connect
    Jin Li
    Chaowei Huang
    Minqiang Pan
    Transportation Safety and Environment, 2023, 5 (03) : 95 - 104
  • [39] Efficient and scalable path-planning algorithms for curvature constrained motion in the Hamilton-Jacobi formulation
    Parkinson, Christian
    Boyle, Isabelle
    JOURNAL OF COMPUTATIONAL PHYSICS, 2024, 509
  • [40] Explanation and Speedup Comparison of Advanced Path-planning Algorithms Presented on Two-dimensional Grid
    Soustek P.
    Matousek R.
    Dvorak J.
    Manakova L.
    Mendel, 2022, 28 (02): : 97 - 107
12345