ML Anthology

Continuous Time Planning for Multiagent Teams with Temporal Constraints

Zhengyu Yin, Milind Tambe
IJCAI 2011 pp. 465-471
doi:10.5591/978-1-57735-516-8/IJCAI11-085 /ijcai/2011/yin2011ijcai-continuous/

Abstract

Continuous state DEC-MDPs are critical for agent teams in domains involving resources such as time, but scaling them up is a significant challenge. To meet this challenge, we first introduce a novel continuous-time DEC-MDP model that exploits transition independence in domains with temporal constraints. Moreimportantly, we present a new locally optimal algorithm called SPAC. Compared to the best previous algorithm, SPAC finds solutions of comparable quality substantially faster; SPAC also scales to larger teams of agents.

PDF IJCAI Semantic Scholar

Cite

Text

Yin and Tambe. "Continuous Time Planning for Multiagent Teams with Temporal Constraints." International Joint Conference on Artificial Intelligence, 2011. doi:10.5591/978-1-57735-516-8/IJCAI11-085

Markdown

[Yin and Tambe. "Continuous Time Planning for Multiagent Teams with Temporal Constraints." International Joint Conference on Artificial Intelligence, 2011.](https://mlanthology.org/ijcai/2011/yin2011ijcai-continuous/) doi:10.5591/978-1-57735-516-8/IJCAI11-085

BibTeX

@inproceedings{yin2011ijcai-continuous,
  title     = {{Continuous Time Planning for Multiagent Teams with Temporal Constraints}},
  author    = {Yin, Zhengyu and Tambe, Milind},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2011},
  pages     = {465-471},
  doi       = {10.5591/978-1-57735-516-8/IJCAI11-085},
  url       = {https://mlanthology.org/ijcai/2011/yin2011ijcai-continuous/}
}