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 条
  • [1] A Statistically Rigorous Analysis of 2D Path-Planning Algorithms
    Munoz, Pablo
    Barrero, David F.
    R-Moreno, Maria D.
    COMPUTER JOURNAL, 2015, 58 (11): : 2876 - 2891
  • [2] A survey of 3D Space Path-Planning Methods and Algorithms
    Mazaheri, Hakimeh
    Goli, Salman
    Nourollah, Ali
    ACM COMPUTING SURVEYS, 2025, 57 (01)
  • [3] Path-planning algorithms for public transportation systems
    Liu, CL
    Pai, TW
    Chang, CT
    Hsieh, CM
    2001 IEEE INTELLIGENT TRANSPORTATION SYSTEMS - PROCEEDINGS, 2001, : 1061 - 1066
  • [4] Statistic Methods for Path-Planning Algorithms Comparison
    Munoz, Pablo
    Barrero, David F.
    R-Moreno, Maria D.
    KUNSTLICHE INTELLIGENZ, 2013, 27 (03): : 201 - 211
  • [5] On the Enhancement of Firefighting Robots using Path-Planning Algorithms
    Ramasubramanian S.
    Muthukumaraswamy S.A.
    SN Computer Science, 2021, 2 (3)
  • [6] Progress in Construction Robot Path-Planning Algorithms: Review
    Fu, Shichen
    Yang, Detao
    Mei, Zenghui
    Zheng, Weixiong
    APPLIED SCIENCES-BASEL, 2025, 15 (03):
  • [7] Method of evolving junctions: A new approach to optimal path-planning in 2D environments with moving obstacles
    Li, Wuchen
    Chow, Shui-Nee
    Egerstedt, Magnus
    Lu, Jun
    Zho, Haomin
    INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH, 2017, 36 (04): : 403 - 413
  • [8] Performance analysis of path planning techniques for autonomous robotsA deep path planning analysis in 2D environments
    Lidia G. S. Rocha
    Pedro H. C. Kim
    Kelen C. Teixeira Vivaldini
    International Journal of Intelligent Robotics and Applications, 2023, 7 : 778 - 794
  • [9] 21.2 A 1.5μJ/Task Path-Planning Processor for 2D/3D Autonomous Navigation of Micro Robots
    Chung, Chieh
    Yang, Chia-Hsiang
    2020 IEEE INTERNATIONAL SOLID- STATE CIRCUITS CONFERENCE (ISSCC), 2020, : 324 - +
  • [10] Genetic algorithms for adaptive planning of path and trajectory of a mobile robot in 2D terrains
    Sugihara, K
    Smith, J
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 1999, E82D (01) : 309 - 317
12345