An optimal algorithm for two robots path planning problem on the grid

Authors:
Mansoor Davoodi;Marjan Abedin;Bahareh Banyassady;Payam Khanteimouri;Ali Mohades
Affiliations:
-;-;-;-;-
Venue:
Robotics and Autonomous Systems
Year:
2013

Citing 5
Cited 0

The complexity of finding two disjoint paths with min-max objective function

Discrete Applied Mathematics
Robot Motion Planning

Robot Motion Planning
Multiple path coordination for mobile robots: a geometric algorithm

IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Graph decomposition for efficient multi-robot path planning

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Packet routing: complexity and algorithms

WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is a study on the problem of path planning for two robots on a grid. We consider the objective of minimizing the maximum path length which corresponds to minimizing the arrival time of the last robot at its goal position. We propose an optimal algorithm that solves the problem in linear time with respect to the size of the grid. We show that the algorithm is complete; meaning that it is sure to find an optimal solution or report if any does not exist.