Continuous Time Planning for Multiagent Teams with Temporal Constraints
Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence. Pages 465-470.
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.
@inproceedings{ijcai2011p85,
title = {Continuous Time Planning for Multiagent Teams with Temporal Constraints},
author = {Yin, Zhengyu and Tambe, Milind},
booktitle = {Proceedings of the Twenty-Second International Joint Conference on
Artificial Intelligence, {IJCAI-11}},
publisher = {AAAI Press/International Joint Conferences on Artificial Intelligence},
editor = {Toby Walsh},
pages = {465--470},
year = {2011},
month = {7},
doi = {10.5591/978-1-57735-516-8/IJCAI11-085},
url = {https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-085},
}
TY - CPAPER TI - Continuous Time Planning for Multiagent Teams with Temporal Constraints AU - Yin, Zhengyu AU - Tambe, Milind T2 - Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, IJCAI-11 PB - AAAI Press/International Joint Conferences on Artificial Intelligence PY - 2011 SP - 465 EP - 470 DO - 10.5591/978-1-57735-516-8/IJCAI11-085 UR - https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-085 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
