EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Enhanced Robot Motion Block of A-Star Algorithm for Robotic Path Planning

Raihan Kabir iD, Yutaka Watanobe iD, Md Rashedul Islam iD, Keitaro Naruse iD

Sensors · 22.02.2024 · 24 (5) · 1422

DOI: 10.3390/s24051422 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Sensors, online erschienen am 22.02.2024. Verfasst von Raihan Kabir und 3 weiteren Autor:innen. Beteiligte Einrichtung: Department of Computer Science and Engineering, University of Aizu, Aizu-Wakamatsu 965-8580, Japan. Die Arbeit wurde bisher 55-mal zitiert (Crossref) und nennt 35 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

An optimized robot path-planning algorithm is required for various aspects of robot movements in applications. The efficacy of the robot path-planning model is vulnerable to the number of search nodes, path cost, and time complexity. The conventional A-star (A*) algorithm outperforms other grid-based algorithms because of its heuristic approach. However, the performance of the conventional A* algorithm is suboptimal for the time, space, and number of search nodes, depending on the robot motion block (RMB). To address these challenges, this paper proposes an optimal RMB with an adaptive cost function to improve performance. The proposed adaptive cost function keeps track of the goal node and adaptively calculates the movement costs for quickly arriving at the goal node. Incorporating the adaptive cost function with a selected optimal RMB significantly reduces the searches of less impactful and redundant nodes, which improves the performance of the A* algorithm in terms of the number of search nodes and time complexity. To validate the performance and robustness of the proposed model, an extensive experiment was conducted. In the experiment, an open-source dataset featuring various types of grid maps was customized to incorporate the multiple map sizes and sets of source-to-destination nodes. According to the experiments, the proposed method demonstrated a remarkable improvement of 93.98% in the number of search nodes and 98.94% in time complexity compared to the conventional A* algorithm. The proposed model outperforms other state-of-the-art algorithms by keeping the path cost largely comparable. Additionally, an ROS experiment using a robot and lidar sensor data shows the improvement of the proposed method in a simulated laboratory environment.

Schlagwörter

Stichwörter der Autor:innen

A* algorithmBFSDFSDijkstraGazebo simulatorROSSLAMTWA*adaptive cost functionpath planningrobot motion block (RMB)

Autor:innen und Institutionen

  • Department of Computer Science and Engineering, University of Aizu, Aizu-Wakamatsu 965-8580, Japan.
  • Division of Computer Vision and AI, Department of R&D, Chowagiken Corp., Sapporo 001-0021, Japan.

ORCID-Profile: Raihan Kabir, Yutaka Watanobe, Md Rashedul Islam, Keitaro Naruse

Zitieren

APA

Kabir, R., Watanobe, Y., Islam, M. R., & Naruse, K. (2024). Enhanced Robot Motion Block of A-Star Algorithm for Robotic Path Planning. Sensors, 24(5), 1422. https://doi.org/10.3390/s24051422

Vancouver

Kabir R, Watanobe Y, Islam MR, Naruse K. Enhanced Robot Motion Block of A-Star Algorithm for Robotic Path Planning. Sensors. 2024;24(5):1422. doi:10.3390/s24051422

BibTeX
@article{Kabir2024,
  author = {Kabir, Raihan and Watanobe, Yutaka and Islam, Md Rashedul and Naruse, Keitaro},
  title = {Enhanced Robot Motion Block of A-Star Algorithm for Robotic Path Planning},
  journal = {Sensors},
  year = {2024},
  volume = {24},
  number = {5},
  pages = {1422},
  doi = {10.3390/s24051422}
}
Kostenlos starten →