Multi AGV Coordination Tolerant to Communication Failures
Open Access
Abstract
Most path planning algorithms used presently in multi-robot systems are based on offline planning. The Timed Enhanced A* (TEA*) algorithm gives the possibility of planning in real time, rather than planning in advance, by using a temporal estimation of the robot’s positions at any given time. In this article, the implementation of a control system for multi-robot applications that operate in environments where communication faults can occur and where entire sections of the environment may not have any connection to the communication network will be presented. This system uses the TEA* to plan multiple robot paths and a supervision system to control communications. The supervision system supervises the communication with the robots and checks whether the robot’s movements are synchronized. The implemented system allowed the creation and execution of paths for the robots that were both safe and kept the temporal efficiency of the TEA* algorithm. Using the Simtwo2020 simulation software, capable of simulating movement dynamics and the Lazarus development environment, it was possible to simulate the execution of several different missions by the implemented system and analyze their results.Keywords
This publication has 22 references indexed in Scilit:
- Intractability of Optimal Multirobot Path Planning on Planar GraphsIEEE Robotics and Automation Letters, 2015
- Time enhanced A*: Towards the development of a new approach for Multi-Robot Coordination2015
- Subdimensional expansion for multirobot path planningArtificial Intelligence, 2015
- Automated Guided Vehicle Systems2015
- Fault-tolerant Agreement in Synchronous Message-passing SystemsSynthesis Lectures on Distributed Computing Theory, 2010
- Planning Algorithms2006
- Cooperative Mobile Robotics: Antecedents and DirectionsAutonomous Robots, 1997
- Introduction and Overview1991
- An algorithm for planning collision-free paths among polyhedral obstaclesCommunications of the ACM, 1979
- A Formal Basis for the Heuristic Determination of Minimum Cost PathsIEEE Transactions on Systems Science and Cybernetics, 1968