Multi-robot information driven path planning under communication constraints

Bradley Woosley, Prithviraj Dasgupta, John G. Rogers, Jeffrey Twigg

Research output: Contribution to journalArticle

Abstract

We consider the problem of simultaneous exploration and information collection in an initially unknown environment by multiple autonomous robots when the communication between robots is unreliable and intermittent. We propose a novel algorithm where decisions to select locations for exploration and information collection are guided by a utility function that combines Gaussian Process-based distributions for information entropy and communication signal strength, along with a distributed coordination protocol to avoid path conflicts between robots and repeated exploration and information collection from the same region by different robots. Our proposed algorithm was experimentally validated in simulation and on hardware Clearpath Jackal robots while using a realistic signal loss model from the literature. Our results show that our approach plans it samples such that it receives up to 25 dBm more signal strength throughout navigation compared to approaches that do not consider communications when selecting locations to sample from while accomplishing similar levels of model error.

Original languageEnglish (US)
JournalAutonomous Robots
DOIs
StateAccepted/In press - Jan 1 2019

Fingerprint

Motion planning
Robots
Communication
Navigation
Entropy
Hardware

Keywords

  • Communications constraints
  • Information-driven path planning
  • Multi-robot informed path planning

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this

Multi-robot information driven path planning under communication constraints. / Woosley, Bradley; Dasgupta, Prithviraj; Rogers, John G.; Twigg, Jeffrey.

In: Autonomous Robots, 01.01.2019.

Research output: Contribution to journalArticle

@article{3fb192d3da5e47768651dfeff501fa47,
title = "Multi-robot information driven path planning under communication constraints",
abstract = "We consider the problem of simultaneous exploration and information collection in an initially unknown environment by multiple autonomous robots when the communication between robots is unreliable and intermittent. We propose a novel algorithm where decisions to select locations for exploration and information collection are guided by a utility function that combines Gaussian Process-based distributions for information entropy and communication signal strength, along with a distributed coordination protocol to avoid path conflicts between robots and repeated exploration and information collection from the same region by different robots. Our proposed algorithm was experimentally validated in simulation and on hardware Clearpath Jackal robots while using a realistic signal loss model from the literature. Our results show that our approach plans it samples such that it receives up to 25 dBm more signal strength throughout navigation compared to approaches that do not consider communications when selecting locations to sample from while accomplishing similar levels of model error.",
keywords = "Communications constraints, Information-driven path planning, Multi-robot informed path planning",
author = "Bradley Woosley and Prithviraj Dasgupta and Rogers, {John G.} and Jeffrey Twigg",
year = "2019",
month = "1",
day = "1",
doi = "10.1007/s10514-019-09890-z",
language = "English (US)",
journal = "Autonomous Robots",
issn = "0929-5593",
publisher = "Springer Netherlands",

}

TY - JOUR

T1 - Multi-robot information driven path planning under communication constraints

AU - Woosley, Bradley

AU - Dasgupta, Prithviraj

AU - Rogers, John G.

AU - Twigg, Jeffrey

PY - 2019/1/1

Y1 - 2019/1/1

N2 - We consider the problem of simultaneous exploration and information collection in an initially unknown environment by multiple autonomous robots when the communication between robots is unreliable and intermittent. We propose a novel algorithm where decisions to select locations for exploration and information collection are guided by a utility function that combines Gaussian Process-based distributions for information entropy and communication signal strength, along with a distributed coordination protocol to avoid path conflicts between robots and repeated exploration and information collection from the same region by different robots. Our proposed algorithm was experimentally validated in simulation and on hardware Clearpath Jackal robots while using a realistic signal loss model from the literature. Our results show that our approach plans it samples such that it receives up to 25 dBm more signal strength throughout navigation compared to approaches that do not consider communications when selecting locations to sample from while accomplishing similar levels of model error.

AB - We consider the problem of simultaneous exploration and information collection in an initially unknown environment by multiple autonomous robots when the communication between robots is unreliable and intermittent. We propose a novel algorithm where decisions to select locations for exploration and information collection are guided by a utility function that combines Gaussian Process-based distributions for information entropy and communication signal strength, along with a distributed coordination protocol to avoid path conflicts between robots and repeated exploration and information collection from the same region by different robots. Our proposed algorithm was experimentally validated in simulation and on hardware Clearpath Jackal robots while using a realistic signal loss model from the literature. Our results show that our approach plans it samples such that it receives up to 25 dBm more signal strength throughout navigation compared to approaches that do not consider communications when selecting locations to sample from while accomplishing similar levels of model error.

KW - Communications constraints

KW - Information-driven path planning

KW - Multi-robot informed path planning

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

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

U2 - 10.1007/s10514-019-09890-z

DO - 10.1007/s10514-019-09890-z

M3 - Article

AN - SCOPUS:85076215464

JO - Autonomous Robots

JF - Autonomous Robots

SN - 0929-5593

ER -