- Technical Program
- Workshops & Tutorials
- At a glance
- Doctoral Consortium
- Opening & Reception
- Best Papers from Sister Conferences Track
- IJCAI Video Track
- Trading Agent Competion (TAC)
- IJCAI-11 Awards
- Funding Opportunities for International Research Collaborations
- General Game Playing Competition
- Banquet
- Ramon Llull Session
- Industry Day
- Closing Event
- List of Accepted Papers
- Poster Boards
Continuous Time Planning for Multiagent Teams with Temporal Constraints
Zhengyu Yin, Milind Tambe and Kanna Rajan
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, this paper first introduces a novel continuous time DEC-MDP model that exploits transition independence in domains with temporal constraints. More importantly, the paper presents a new locally optimal algorithm called SPAC. Compared to the best previous algorithm, SPAC finds solutions of equal quality substantially faster; SPAC also scales to larger teams of agents.