Decentralized Markov Decision Processes (DEC-MDPs) are a popular model of agent-coordination problems in domains with uncertainty and time constraints but very difficult to solve...
We present a technique for computing approximately optimal solutions to stochastic resource allocation problems modeled as Markov decision processes (MDPs). We exploit two key pro...
Nicolas Meuleau, Milos Hauskrecht, Kee-Eung Kim, L...
Current methods of routing are based on network information in the form of routing tables, in which routing protocols determine how to update the tables according to the network ch...
We examine the practical problem of a mobile autonomous robot performing a long-duration survey task, during which it must recharge its batteries periodically. We present a scalabl...
The subject of this paper is the formulation and solution of a variation of the classical binary knapsack problem. The variation that is addressed is termed the ``fixed-charge kna...