Skip to main navigation Skip to search Skip to main content

Comparison of Global Path Planning Algorithms Regarding Multi Mobile Robot Object Transport Requirements

Henrik Lurz*, Tobias Recker, Annika Raatz

*Corresponding author for this work

Research output: Chapter in book/report/conference proceedingContribution to book/anthologyResearchpeer review

Abstract

This paper presents a comparison of multiple global path planning algorithms regarding their usage in multi-robot systems. Most performance-based comparisons only focus on computation time and path length, which are not the most important indicators when transporting an object using a multi-robot formation. Therefore, we decided to add the distance to obstacles and curvature of the path as performance metrics to support the selection of a fitting global path planner for a multi-robot application. In the comparison, we included the PRM, RRT*, Relaxed A* and Voronoi path planning algorithms. Each algorithm performs a specified number of planning tasks and is evaluated by the planning success, path length, obstacle distance and curvature, which are visualized below.

Original languageEnglish
Title of host publicationAnnals of Scientific Society for Assembly, Handling and Industrial Robotics 2023
PublisherSpringer Science + Business Media
Pages99-110
Number of pages12
ISBN (Electronic)9783031740107
ISBN (Print)9783031740091
DOIs
Publication statusPublished - 20 Mar 2025

Keywords

  • Global path planning
  • Mobile robot
  • Navigation

ASJC Scopus subject areas

  • General Computer Science
  • General Mathematics
  • General Engineering

Cite this