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...
Abstract. Monitoring large distributed concurrent systems is a challenging task. In this paper we formulate (model-based) diagnosis by means of hidden state history reconstruction,...
Even under polynomial restrictions on plan length, conformant planning remains a very hard computational problem as plan verification itself can take exponential time. This heavy ...
This contribution deals with scheduling problems of flexible chemical batch processes with a special emphasis on their real-time character. This implies not only the need for suff...
— We explore the interconnection between search and action in the context of mobile robotics. The task of searching for an object and then performing some action with that object...
Geoffrey Hollinger, Dave Ferguson, Siddhartha Srin...