Probabilistic planning algorithms seek e ective plans for large, stochastic domains. maxplan is a recently developed algorithm that converts a planning problem into an E-Majsat pr...
This paper describes a program called Pret that automates system identification, the process of finding a dynamical model of a black-box system. Pret performs both structural iden...
One difficulty with existing theoretical work on HTN planning is that it does not address some of the planning constructs that are commonly used in HTN planners for practical appl...
For mobile robots to be successful, they have to navigate safely in populated and dynamic environments. While recent research has led to a variety of localization methods that can...
Dieter Fox, Wolfram Burgard, Sebastian Thrun, Armi...
When search techniques are used to solve a practical problem, the solution produced is often brittle in the sense that small execution difficulties can have an arbitrarily large e...
Matthew L. Ginsberg, Andrew J. Parkes, Amitabha Ro...