Integrated real-time task and motion planning for multiple robots under path and communication uncertainties

Bradley Woosley, Prithviraj Dasgupta

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

We consider a problem where robots are given a set of task locations to visit with coarsely known distances. The robots must find the task ordering that reduces the overall distance to visit the tasks. We propose an abstraction that models the uncertainty in the paths, and a Markov Decision Process-based algorithm that selects paths that reduces the expected distance to visit the tasks. We also describe a distributed coordination algorithm to resolve path conflicts. We have shown that our task selection is optimal, our coordination is deadlock-free, and have experimentally verified our approach in hardware and simulation.

Original languageEnglish (US)
Pages (from-to)353-373
Number of pages21
JournalRobotica
Volume36
Issue number3
DOIs
StatePublished - Mar 1 2018

Fingerprint

Motion Planning
Motion planning
Robot
Robots
Real-time
Uncertainty
Path
Communication
Markov Decision Process
Deadlock
Hardware
Resolve
Simulation
Model

Keywords

  • Exploration
  • Multi-robot
  • Path uncertainty
  • Real time
  • Simultaneous task and motion planning

ASJC Scopus subject areas

  • Software
  • Control and Systems Engineering
  • Mathematics(all)
  • Computer Science Applications

Cite this

Integrated real-time task and motion planning for multiple robots under path and communication uncertainties. / Woosley, Bradley; Dasgupta, Prithviraj.

In: Robotica, Vol. 36, No. 3, 01.03.2018, p. 353-373.

Research output: Contribution to journalArticle

@article{0f589e6b30e040a28e13794e63c56810,
title = "Integrated real-time task and motion planning for multiple robots under path and communication uncertainties",
abstract = "We consider a problem where robots are given a set of task locations to visit with coarsely known distances. The robots must find the task ordering that reduces the overall distance to visit the tasks. We propose an abstraction that models the uncertainty in the paths, and a Markov Decision Process-based algorithm that selects paths that reduces the expected distance to visit the tasks. We also describe a distributed coordination algorithm to resolve path conflicts. We have shown that our task selection is optimal, our coordination is deadlock-free, and have experimentally verified our approach in hardware and simulation.",
keywords = "Exploration, Multi-robot, Path uncertainty, Real time, Simultaneous task and motion planning",
author = "Bradley Woosley and Prithviraj Dasgupta",
year = "2018",
month = "3",
day = "1",
doi = "10.1017/S0263574717000443",
language = "English (US)",
volume = "36",
pages = "353--373",
journal = "Robotica",
issn = "0263-5747",
publisher = "Cambridge University Press",
number = "3",

}

TY - JOUR

T1 - Integrated real-time task and motion planning for multiple robots under path and communication uncertainties

AU - Woosley, Bradley

AU - Dasgupta, Prithviraj

PY - 2018/3/1

Y1 - 2018/3/1

N2 - We consider a problem where robots are given a set of task locations to visit with coarsely known distances. The robots must find the task ordering that reduces the overall distance to visit the tasks. We propose an abstraction that models the uncertainty in the paths, and a Markov Decision Process-based algorithm that selects paths that reduces the expected distance to visit the tasks. We also describe a distributed coordination algorithm to resolve path conflicts. We have shown that our task selection is optimal, our coordination is deadlock-free, and have experimentally verified our approach in hardware and simulation.

AB - We consider a problem where robots are given a set of task locations to visit with coarsely known distances. The robots must find the task ordering that reduces the overall distance to visit the tasks. We propose an abstraction that models the uncertainty in the paths, and a Markov Decision Process-based algorithm that selects paths that reduces the expected distance to visit the tasks. We also describe a distributed coordination algorithm to resolve path conflicts. We have shown that our task selection is optimal, our coordination is deadlock-free, and have experimentally verified our approach in hardware and simulation.

KW - Exploration

KW - Multi-robot

KW - Path uncertainty

KW - Real time

KW - Simultaneous task and motion planning

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

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

U2 - 10.1017/S0263574717000443

DO - 10.1017/S0263574717000443

M3 - Article

AN - SCOPUS:85034578815

VL - 36

SP - 353

EP - 373

JO - Robotica

JF - Robotica

SN - 0263-5747

IS - 3

ER -