A Time-Efficient Co-Operative Path Planning Model Combined with Task Assignment for Multi-Agent Systems
Open Access
Abstract
Dealing with uncertainties along with high-efficiency planning for task assignment problem is still challenging, especially for multi-agent systems. In this paper, two frameworks—Compromise View model and the Nearest-Neighbour Search model—are analyzed and compared for co-operative path planning combined with task assignment of a multi-agent system in dynamic environments. Both frameworks are capable of dynamically controlling a number of autonomous agents to accomplish multiple tasks at different locations. Furthermore, these two models are capable of dealing with dynamically changing environments. In both approaches, the Particle Swarm Optimization-based method is applied for path planning. The path planning approach combined with the obstacle avoidance strategy is integrated with the task assignment problem. In one framework, the Compromise View model is used for completing the tasks and a combination of clustering method with the Nearest-Neighbour Search model is used to assign tasks to the other framework. The frameworks are compared in terms of computational time and the resulting path length. Results indicate that the Nearest-Neighbour Search model is much faster than the Compromise View model. However, the Nearest-Neighbour Search model generates longer paths to accomplish the mission. By following the Nearest-Neighbour Search approach, agents can successfully accomplish their mission, even under uncertainties such as malfunction of individual agents. The Nearest-Neighbour Search framework is highly effective due to its reactive structure. As per requirements, to save time, after completing its own tasks, one agent can complete the remaining tasks of other agents. The simulation results show that the Nearest-Neighbour Search model is an effective and robust way of solving co-operative path planning combined with task assignment problems.Keywords
This publication has 30 references indexed in Scilit:
- Unknown environment exploration of multi-robot system with the FORDPSOSwarm and Evolutionary Computation, 2016
- Robot Trajectories Comparison: A Statistical ApproachThe Scientific World Journal, 2014
- A Multiple Mobile Robots Path planning Algorithm Based on A-star and Dijkstra AlgorithmInternational Journal of Smart Home, 2014
- Employing Multiple Unmanned Aerial Vehicles for Co-Operative Path PlanningInternational Journal of Advanced Robotic Systems, 2013
- An Integral Framework of Task Assignment and Path Planning for Multiple Unmanned Aerial Vehicles in Dynamic EnvironmentsJournal of Intelligent & Robotic Systems, 2012
- Circulation of car traffic in congested urban areasCommunications in Mathematical Sciences, 2008
- Vector evaluated particle swarm optimization (VEPSO) for multi-objective design optimization of composite structuresComputers & Structures, 2008
- A Neural Network Approach to Dynamic Task Assignment of MultirobotsIEEE Transactions on Neural Networks, 2006
- Toward a Robot Architecture Integrating Cooperation between Mobile Robots: Application to Indoor EnvironmentThe International Journal of Robotics Research, 1993
- A Formal Basis for the Heuristic Determination of Minimum Cost PathsIEEE Transactions on Systems Science and Cybernetics, 1968