Probabilistic planning problems are typically modeled as a Markov Decision Process (MDP). MDPs, while an otherwise expressive model, allow only for sequential, non-durative action...
Stigmergy is usually associated with semantically simple problems such as routing. It can be applied to more complex problems by encoding them in the environment through which sti...
H. Van Dyke Parunak, Theodore C. Belding, Robert B...
Abstract. To direct automated Web service composition, it is compelling to provide a template, workflow or scaffolding that dictates the ways in which services can be composed. I...
A major portion of highway construction work is comprised of linear activities. A linear activity is one that progresses along a path (non-stationary), as it does it is complete a...
We introduce TiMDPpoly, an algorithm designed to solve planning problems with durative actions, under probabilistic uncertainty, in a non-stationary, continuous-time context. Miss...