A Declarative Method for Dynamic Multi-Agent Path Finding

Aysu Bogatarkan; Volkan Patoglu; Esra Erdem

doi:10.29007/cnzw

Download PDF Open PDF in browser

A Declarative Method for Dynamic Multi-Agent Path Finding

14 pages•Published: December 10, 2019

Aysu Bogatarkan, Volkan Patoglu and Esra Erdem

Abstract

The multi-agent path finding (MAPF) problem is a combinatorial search problem that aims at finding paths for multiple agents such that no two agents collide with each other. We study a dynamic variant of MAPF, called D-MAPF, which allows changes in the environment (e.g., some existing obstacles may be removed from the environment or moved to some other location, or new obstacles may be included in the environment), and/or changes in the team (e.g., some existing agents may leave and some new agents may join the team) at different times. We introduce a new method to solve D-MAPF, using answer set programming.

Keyphrases: Answer Set Programming, declarative problem solving, Knowledge Representation and Reasoning, multi-agent path finding

In: Diego Calvanese and Luca Iocchi (editors). GCAI 2019. Proceedings of the 5th Global Conference on Artificial Intelligence, vol 65, pages 54--67

Links:	https://easychair.org/publications/paper/n21z
	https://doi.org/10.29007/cnzw

BibTeX entry

@inproceedings{GCAI2019:Declarative_Method_for_Dynamic,
  author    = {Aysu Bogatarkan and Volkan Patoglu and Esra Erdem},
  title     = {A Declarative Method for Dynamic Multi-Agent Path Finding},
  booktitle = {GCAI 2019. Proceedings of the 5th Global Conference on Artificial Intelligence},
  editor    = {Diego Calvanese and Luca Iocchi},
  series    = {EPiC Series in Computing},
  volume    = {65},
  pages     = {54--67},
  year      = {2019},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {https://easychair.org/publications/paper/n21z},
  doi       = {10.29007/cnzw}}

Download PDF Open PDF in browser