We present a new algorithm for probabilistic planning with no observability. Our algorithm, called Probabilistic-FF, extends the heuristic forward-search machinery of Conformant-F...
Enforced hill-climbing is an effective deterministic hillclimbing technique that deals with local optima using breadth-first search (a process called "basin flooding"). ...
Sophisticated agents operating in open environments must make decisions that efficiently trade off the use of their limited resources between dynamic deliberative actions and dom...
Abstract. There are many domains in which a multi-agent system needs to maximize a "system utility" function which rates the performance of the entire system, while subje...
We consider the frame problem, that is, char acterizing the assumption that properties tend to persist over time. We show that there are at least three distinct assumptions that...