Coordination of Multiple Teams of Robots for an Optimal Global Plan

Abstract

We consider multiple teams of heterogeneous robots, where each team is given a feasible task to complete in its workspace on its own, and where teams are allowed to transfer robots between each other. We study the problem of finding a coordination of robot transfers between teams to ensure an optimal global plan (with minimum makespan) so that all tasks can be completed as soon as possible by helping each other. We propose to solve this problem using answer set programming.

Cite

Text

Saribatur et al. "Coordination of Multiple Teams of Robots for an Optimal Global Plan." AAAI Conference on Artificial Intelligence, 2014. doi:10.1609/AAAI.V28I1.9086

Markdown

[Saribatur et al. "Coordination of Multiple Teams of Robots for an Optimal Global Plan." AAAI Conference on Artificial Intelligence, 2014.](https://mlanthology.org/aaai/2014/saribatur2014aaai-coordination/) doi:10.1609/AAAI.V28I1.9086

BibTeX

@inproceedings{saribatur2014aaai-coordination,
  title     = {{Coordination of Multiple Teams of Robots for an Optimal Global Plan}},
  author    = {Saribatur, Zeynep G. and Erdem, Esra and Patoglu, Volkan},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2014},
  pages     = {3132-3133},
  doi       = {10.1609/AAAI.V28I1.9086},
  url       = {https://mlanthology.org/aaai/2014/saribatur2014aaai-coordination/}
}