Bipartite graph matching-based coordination mechanism for multi-robot path planning under communication constraints

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

We propose a coordination mechanism to avoid inter-robot collisions when the robots' paths overlap with each other. Our proposed coordination technique uses a weighted bipartite matching-based formulation to solve this problem. Initially, each robot is given a unique goal location. But the robots do not know about other robots' planned paths until they come within each other's communication ranges. When two or more robots get within an unsafe distance, they coordinate their paths to avoid collisions with each other. The objective of the coordination mechanism is to plan a modified path for each coordinating robot (if needed) so that all the robots can reach their goal locations without collision with each other and also while reducing the extra distance introduced while resolving path conflicts. We have proved the correctness and convergence of our coordination strategy. Our experimental results show that the robots using our proposed strategy travel up to 4.2 times less than a comparable heuristic approach.

Original languageEnglish (US)
Title of host publicationICRA 2017 - IEEE International Conference on Robotics and Automation
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages857-862
Number of pages6
ISBN (Electronic)9781509046331
DOIs
StatePublished - Jul 21 2017
Event2017 IEEE International Conference on Robotics and Automation, ICRA 2017 - Singapore, Singapore
Duration: May 29 2017Jun 3 2017

Publication series

NameProceedings - IEEE International Conference on Robotics and Automation
ISSN (Print)1050-4729

Other

Other2017 IEEE International Conference on Robotics and Automation, ICRA 2017
CountrySingapore
CitySingapore
Period5/29/176/3/17

Fingerprint

Motion planning
Robots
Communication

ASJC Scopus subject areas

  • Software
  • Control and Systems Engineering
  • Artificial Intelligence
  • Electrical and Electronic Engineering

Cite this

Dutta, A., & Dasgupta, P. (2017). Bipartite graph matching-based coordination mechanism for multi-robot path planning under communication constraints. In ICRA 2017 - IEEE International Conference on Robotics and Automation (pp. 857-862). [7989105] (Proceedings - IEEE International Conference on Robotics and Automation). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICRA.2017.7989105

Bipartite graph matching-based coordination mechanism for multi-robot path planning under communication constraints. / Dutta, Ayan; Dasgupta, Prithviraj.

ICRA 2017 - IEEE International Conference on Robotics and Automation. Institute of Electrical and Electronics Engineers Inc., 2017. p. 857-862 7989105 (Proceedings - IEEE International Conference on Robotics and Automation).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Dutta, A & Dasgupta, P 2017, Bipartite graph matching-based coordination mechanism for multi-robot path planning under communication constraints. in ICRA 2017 - IEEE International Conference on Robotics and Automation., 7989105, Proceedings - IEEE International Conference on Robotics and Automation, Institute of Electrical and Electronics Engineers Inc., pp. 857-862, 2017 IEEE International Conference on Robotics and Automation, ICRA 2017, Singapore, Singapore, 5/29/17. https://doi.org/10.1109/ICRA.2017.7989105
Dutta A, Dasgupta P. Bipartite graph matching-based coordination mechanism for multi-robot path planning under communication constraints. In ICRA 2017 - IEEE International Conference on Robotics and Automation. Institute of Electrical and Electronics Engineers Inc. 2017. p. 857-862. 7989105. (Proceedings - IEEE International Conference on Robotics and Automation). https://doi.org/10.1109/ICRA.2017.7989105
Dutta, Ayan ; Dasgupta, Prithviraj. / Bipartite graph matching-based coordination mechanism for multi-robot path planning under communication constraints. ICRA 2017 - IEEE International Conference on Robotics and Automation. Institute of Electrical and Electronics Engineers Inc., 2017. pp. 857-862 (Proceedings - IEEE International Conference on Robotics and Automation).
@inproceedings{ce963a5d522643689b0adc8fa89b56f9,
title = "Bipartite graph matching-based coordination mechanism for multi-robot path planning under communication constraints",
abstract = "We propose a coordination mechanism to avoid inter-robot collisions when the robots' paths overlap with each other. Our proposed coordination technique uses a weighted bipartite matching-based formulation to solve this problem. Initially, each robot is given a unique goal location. But the robots do not know about other robots' planned paths until they come within each other's communication ranges. When two or more robots get within an unsafe distance, they coordinate their paths to avoid collisions with each other. The objective of the coordination mechanism is to plan a modified path for each coordinating robot (if needed) so that all the robots can reach their goal locations without collision with each other and also while reducing the extra distance introduced while resolving path conflicts. We have proved the correctness and convergence of our coordination strategy. Our experimental results show that the robots using our proposed strategy travel up to 4.2 times less than a comparable heuristic approach.",
author = "Ayan Dutta and Prithviraj Dasgupta",
year = "2017",
month = "7",
day = "21",
doi = "10.1109/ICRA.2017.7989105",
language = "English (US)",
series = "Proceedings - IEEE International Conference on Robotics and Automation",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "857--862",
booktitle = "ICRA 2017 - IEEE International Conference on Robotics and Automation",

}

TY - GEN

T1 - Bipartite graph matching-based coordination mechanism for multi-robot path planning under communication constraints

AU - Dutta, Ayan

AU - Dasgupta, Prithviraj

PY - 2017/7/21

Y1 - 2017/7/21

N2 - We propose a coordination mechanism to avoid inter-robot collisions when the robots' paths overlap with each other. Our proposed coordination technique uses a weighted bipartite matching-based formulation to solve this problem. Initially, each robot is given a unique goal location. But the robots do not know about other robots' planned paths until they come within each other's communication ranges. When two or more robots get within an unsafe distance, they coordinate their paths to avoid collisions with each other. The objective of the coordination mechanism is to plan a modified path for each coordinating robot (if needed) so that all the robots can reach their goal locations without collision with each other and also while reducing the extra distance introduced while resolving path conflicts. We have proved the correctness and convergence of our coordination strategy. Our experimental results show that the robots using our proposed strategy travel up to 4.2 times less than a comparable heuristic approach.

AB - We propose a coordination mechanism to avoid inter-robot collisions when the robots' paths overlap with each other. Our proposed coordination technique uses a weighted bipartite matching-based formulation to solve this problem. Initially, each robot is given a unique goal location. But the robots do not know about other robots' planned paths until they come within each other's communication ranges. When two or more robots get within an unsafe distance, they coordinate their paths to avoid collisions with each other. The objective of the coordination mechanism is to plan a modified path for each coordinating robot (if needed) so that all the robots can reach their goal locations without collision with each other and also while reducing the extra distance introduced while resolving path conflicts. We have proved the correctness and convergence of our coordination strategy. Our experimental results show that the robots using our proposed strategy travel up to 4.2 times less than a comparable heuristic approach.

UR - http://www.scopus.com/inward/record.url?scp=85027995952&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85027995952&partnerID=8YFLogxK

U2 - 10.1109/ICRA.2017.7989105

DO - 10.1109/ICRA.2017.7989105

M3 - Conference contribution

AN - SCOPUS:85027995952

T3 - Proceedings - IEEE International Conference on Robotics and Automation

SP - 857

EP - 862

BT - ICRA 2017 - IEEE International Conference on Robotics and Automation

PB - Institute of Electrical and Electronics Engineers Inc.

ER -