|
CSE Home | AI Home | About CSE | Search | Contact Info |
|
Planning for Concurrent Durative Uncertain ActionsOverviewProbabilistic planning problems are often modeled as Markov decision processes (MDPs), which assume that a single action is executed per decision epoch and that actions take unit time. However, in the real world it is common to execute several actions in parallel, and the durations of these actions may differ. We develop extensions to MDPs that incorporate these features. In particular, we propose the model of Concurrent MDPs, which allows simultaneous execution of multiple unit-duration actions at a time point. We extend this to handle concurrent durative actions with deterministic as well as stochastic durations.We release the code for our COMDP solver described in the AAAI'04 paper. Please download it here. Publications
|
|
|
Computer Science & Engineering University of Washington Box 352350 Seattle, WA 98195-2350 (206) 543-1695 voice, (206) 543-2969 FAX [comments to Dan Weld] |