An efficient multi-robot path planning solution using A* and coevolutionary algorithms

Abstract

Multi-robot path planning has evolved from research to real applications in warehouses and other domains; the knowledge on this topic is reflected in the large amount of related research published in recent years on international journals. The main focus of existing research relates to the generation of efficient routes, relying the collision detection to the local sensory system and creating a solution based on local search methods. This approach implies the robots having a good sensory system and also the computation capabilities to take decisions on the fly. In some controlled environments, such as virtual labs or industrial plants, these restrictions overtake the actual needs as simpler robots are sufficient. Therefore, the multi-robot path planning must solve the collisions beforehand. This study focuses on the generation of efficient collision-free multi-robot path planning solutions for such controlled environments, extending our previous research. The proposal combines the optimization capabilities of the A* algorithm with the search capabilities of co-evolutionary algorithms. The outcome is a set of routes, either from A* or from the co-evolutionary process, that are collision-free; this set is generated in real-time and makes its implementation on edge-computing devices feasible. Although further research is needed to reduce the computational time, the computational experiments performed in this study confirm a good performance of the proposed approach in solving complex cases where well-known alternatives, such as M* or WHCA, fail in finding suitable solutions.

Path Planning of Agricultural Information Collection Robot Integrating Ant Colony Algorithm and Particle Swarm Algorithm

“…The result was a set of collision free paths. These routes could be derived from Algorithm A and co-evolutionary processes.This set of routes was generated in real time, whichcould be implemented on edge computing devices [13].…”

Fermat Curve Path Planning Method for Ship Trajectory Tracking

“…The output constituted a set of collision-free paths derived from either the A* algorithm or the collaborative evolution process. These routes were dynamically generated and feasible for implementation on edge computing devices [9]. Li and team introduced an angle-guided ant colony algorithm to address issues prevalent in using ant colony algorithms for mobile robot path-planning, such as susceptibility to local optima and slow convergence.…”

A Novel Algorithm for Robot Path Planning Based on Hybrid Strategy Improved Wild Horse Optimizer

“…Hence, the grid-based methodology is employed for modeling the operational environment of the robot, as illustrated in Figure 1. This study focuses on global path planning for mobile robots in such environments and scenarios, which are also applicable to various practical applications such as unmanned workshops, intelligent warehouses, and specialized environment operations (García, Villar, Tan, Sedano, & Chira, 2023). Furthermore, several assumptions are considered during the formulation of the mathematical model for this problem:…”