DisCoF

Cooperative pathfinding in distributed systems with limited sensing and communication range

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

Abstract

Cooperative pathfinding is often addressed in one of two ways in the literature. In fully coupled approaches, robots are considered together and the plans for all robots are constructed simultaneously. In decoupled approaches, the plans are constructed only for a subset of robots at a time. While decoupled approaches can be much faster than fully coupled approaches, they are often suboptimal and incomplete. Although there exist a few decoupled approaches that achieve completeness, global information (which makes global coordination possible) is assumed. Global information may not be accessible in distributed robotic systems. In this paper, we provide a window-based approach to cooperative pathfinding with limited sensing and communication range in distributed systems (called DisCoF). In DisCoF, robots are assumed to be fully decoupled initially, and may gradually increase the level of coupling in an online and distributed fashion. In some cases, e.g., when global information is needed to solve the problem instance, DisCoF would eventually couple all robots together. DisCoF represents an inherently online approach since robots may only be aware of a subset of robots in the environment at any given point of time. Hence, they do not have enough information to determine non-conflicting plans with all the other robots. Completeness analysis of DisCoF is provided.

Original languageEnglish (US)
Title of host publicationSpringer Tracts in Advanced Robotics
PublisherSpringer Verlag
Pages325-340
Number of pages16
Volume112
ISBN (Print)9784431558774
DOIs
StatePublished - 2016
Event12th International Symposium on Distributed Autonomous Robotic Systems, DARS 2014 - Daejeon, Korea, Republic of
Duration: Nov 2 2014Nov 5 2014

Publication series

NameSpringer Tracts in Advanced Robotics
Volume112
ISSN (Print)16107438
ISSN (Electronic)1610742X

Other

Other12th International Symposium on Distributed Autonomous Robotic Systems, DARS 2014
CountryKorea, Republic of
CityDaejeon
Period11/2/1411/5/14

Fingerprint

Robots
Communication
Robotics

Keywords

  • Cooperative pathfinding
  • Distributed robot systems

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Artificial Intelligence

Cite this

Zhang, Y., Kim, K., & Fainekos, G. (2016). DisCoF: Cooperative pathfinding in distributed systems with limited sensing and communication range. In Springer Tracts in Advanced Robotics (Vol. 112, pp. 325-340). (Springer Tracts in Advanced Robotics; Vol. 112). Springer Verlag. https://doi.org/10.1007/978-4-431-55879-8_23

DisCoF : Cooperative pathfinding in distributed systems with limited sensing and communication range. / Zhang, Yu; Kim, Kangjin; Fainekos, Georgios.

Springer Tracts in Advanced Robotics. Vol. 112 Springer Verlag, 2016. p. 325-340 (Springer Tracts in Advanced Robotics; Vol. 112).

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

Zhang, Y, Kim, K & Fainekos, G 2016, DisCoF: Cooperative pathfinding in distributed systems with limited sensing and communication range. in Springer Tracts in Advanced Robotics. vol. 112, Springer Tracts in Advanced Robotics, vol. 112, Springer Verlag, pp. 325-340, 12th International Symposium on Distributed Autonomous Robotic Systems, DARS 2014, Daejeon, Korea, Republic of, 11/2/14. https://doi.org/10.1007/978-4-431-55879-8_23
Zhang Y, Kim K, Fainekos G. DisCoF: Cooperative pathfinding in distributed systems with limited sensing and communication range. In Springer Tracts in Advanced Robotics. Vol. 112. Springer Verlag. 2016. p. 325-340. (Springer Tracts in Advanced Robotics). https://doi.org/10.1007/978-4-431-55879-8_23
Zhang, Yu ; Kim, Kangjin ; Fainekos, Georgios. / DisCoF : Cooperative pathfinding in distributed systems with limited sensing and communication range. Springer Tracts in Advanced Robotics. Vol. 112 Springer Verlag, 2016. pp. 325-340 (Springer Tracts in Advanced Robotics).
@inproceedings{a68776fc8644434caca0f1db3eab6bee,
title = "DisCoF: Cooperative pathfinding in distributed systems with limited sensing and communication range",
abstract = "Cooperative pathfinding is often addressed in one of two ways in the literature. In fully coupled approaches, robots are considered together and the plans for all robots are constructed simultaneously. In decoupled approaches, the plans are constructed only for a subset of robots at a time. While decoupled approaches can be much faster than fully coupled approaches, they are often suboptimal and incomplete. Although there exist a few decoupled approaches that achieve completeness, global information (which makes global coordination possible) is assumed. Global information may not be accessible in distributed robotic systems. In this paper, we provide a window-based approach to cooperative pathfinding with limited sensing and communication range in distributed systems (called DisCoF). In DisCoF, robots are assumed to be fully decoupled initially, and may gradually increase the level of coupling in an online and distributed fashion. In some cases, e.g., when global information is needed to solve the problem instance, DisCoF would eventually couple all robots together. DisCoF represents an inherently online approach since robots may only be aware of a subset of robots in the environment at any given point of time. Hence, they do not have enough information to determine non-conflicting plans with all the other robots. Completeness analysis of DisCoF is provided.",
keywords = "Cooperative pathfinding, Distributed robot systems",
author = "Yu Zhang and Kangjin Kim and Georgios Fainekos",
year = "2016",
doi = "10.1007/978-4-431-55879-8_23",
language = "English (US)",
isbn = "9784431558774",
volume = "112",
series = "Springer Tracts in Advanced Robotics",
publisher = "Springer Verlag",
pages = "325--340",
booktitle = "Springer Tracts in Advanced Robotics",

}

TY - GEN

T1 - DisCoF

T2 - Cooperative pathfinding in distributed systems with limited sensing and communication range

AU - Zhang, Yu

AU - Kim, Kangjin

AU - Fainekos, Georgios

PY - 2016

Y1 - 2016

N2 - Cooperative pathfinding is often addressed in one of two ways in the literature. In fully coupled approaches, robots are considered together and the plans for all robots are constructed simultaneously. In decoupled approaches, the plans are constructed only for a subset of robots at a time. While decoupled approaches can be much faster than fully coupled approaches, they are often suboptimal and incomplete. Although there exist a few decoupled approaches that achieve completeness, global information (which makes global coordination possible) is assumed. Global information may not be accessible in distributed robotic systems. In this paper, we provide a window-based approach to cooperative pathfinding with limited sensing and communication range in distributed systems (called DisCoF). In DisCoF, robots are assumed to be fully decoupled initially, and may gradually increase the level of coupling in an online and distributed fashion. In some cases, e.g., when global information is needed to solve the problem instance, DisCoF would eventually couple all robots together. DisCoF represents an inherently online approach since robots may only be aware of a subset of robots in the environment at any given point of time. Hence, they do not have enough information to determine non-conflicting plans with all the other robots. Completeness analysis of DisCoF is provided.

AB - Cooperative pathfinding is often addressed in one of two ways in the literature. In fully coupled approaches, robots are considered together and the plans for all robots are constructed simultaneously. In decoupled approaches, the plans are constructed only for a subset of robots at a time. While decoupled approaches can be much faster than fully coupled approaches, they are often suboptimal and incomplete. Although there exist a few decoupled approaches that achieve completeness, global information (which makes global coordination possible) is assumed. Global information may not be accessible in distributed robotic systems. In this paper, we provide a window-based approach to cooperative pathfinding with limited sensing and communication range in distributed systems (called DisCoF). In DisCoF, robots are assumed to be fully decoupled initially, and may gradually increase the level of coupling in an online and distributed fashion. In some cases, e.g., when global information is needed to solve the problem instance, DisCoF would eventually couple all robots together. DisCoF represents an inherently online approach since robots may only be aware of a subset of robots in the environment at any given point of time. Hence, they do not have enough information to determine non-conflicting plans with all the other robots. Completeness analysis of DisCoF is provided.

KW - Cooperative pathfinding

KW - Distributed robot systems

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

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

U2 - 10.1007/978-4-431-55879-8_23

DO - 10.1007/978-4-431-55879-8_23

M3 - Conference contribution

SN - 9784431558774

VL - 112

T3 - Springer Tracts in Advanced Robotics

SP - 325

EP - 340

BT - Springer Tracts in Advanced Robotics

PB - Springer Verlag

ER -