We consider decentralized control of Markov decision processes and give complexity bounds on the worst-case running time for algorithms that find optimal solutions. Generalization...
Daniel S. Bernstein, Shlomo Zilberstein, Neil Imme...
Abstract. Very often a planning problem can be formulated as a ranking problem: i.e. to find an order relation over a set of alternatives. The ranking of a finite set of alternat...
This paper examines the problem of finding an optimal policy for a Partially Observable Markov Decision Process (POMDP) when the model is not known or is only poorly specified. W...
Time is a crucial variable in planning and often requires special attention since it introduces a specific structure along with additional complexity, especially in the case of dec...
The value for decision making of high-quality postsolution analysis of decision-supporting models can hardly be overestimated. Candle-lighting analysis (CLA) takes this notion ver...
Major Bill Branley, Russell Fradin, Steven O. Kimb...