DeepAI AI Chat
Log In Sign Up

Multi-Agent Goal Assignment with Finite-Time Path Planning

by   Tony A. Wood, et al.

Minimising the longest travel distance for a group of mobile robots with interchangeable goals requires knowledge of the shortest length paths between all robots and goal destinations. Determining the exact length of the shortest paths in an environment with obstacles is challenging and cannot be guaranteed in a finite time. We propose an algorithm in which the accuracy of the path planning is iteratively increased. The approach provides a certificate when the uncertainties on estimates of the shortest paths become small enough to guarantee the optimality of the goal assignment. To this end, we apply results from assignment sensitivity assuming upper and lower bounds on the length of the shortest paths. We then provide polynomial-time methods to find such bounds by applying sampling-based path planning. The upper bounds are given by feasible paths, the lower bounds are obtained by expanding the sample set and leveraging knowledge of the sample dispersion. We demonstrate the application of the proposed method with a multi-robot path-planning case study.


page 6

page 7


Optimization of dynamic mobile robot path planning based on evolutionary methods

This paper presents evolutionary methods for optimization in dynamic mob...

Environmental Sampling with the Boustrophedon Decomposition Algorithm

The automation of data collection via mobile robots holds promise for in...

Multi-Agent Path Planning based on MPC and DDPG

The problem of mixed static and dynamic obstacle avoidance is essential ...

Path Planning Algorithms for a Car-Like Robot visiting a set of Waypoints with Field of View Constraints

This article considers two variants of a shortest path problem for a car...

S Reg: End-to-End Learning-Based Model for Multi-Goal Path Planning Problem

In this paper, we propose a novel end-to-end approach for solving the mu...

Efficient Search of the k Shortest Non-Homotopic Paths by Eliminating Non-k-Optimal Topologies

An efficient algorithm to solve the k shortest non-homotopic path planni...