Sciweavers

68 search results - page 3 / 14
» Durative Planning in HTNs
Sort
View
105
Voted
JAIR
2008
107views more  JAIR 2008»
14 years 9 months ago
Planning with Durative Actions in Stochastic Domains
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...
Mausam, Daniel S. Weld
ATAL
2009
Springer
15 years 4 months ago
Stigmergic reasoning over hierarchical task networks
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...
79
Voted
SEMWEB
2009
Springer
15 years 4 months ago
Optimizing Web Service Composition While Enforcing Regulations
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...
Shirin Sohrabi, Sheila A. McIlraith
70
Voted
WSC
1998
14 years 11 months ago
Simulating Haul Durations for Linear Scheduling
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...
David J. Harmelink, Maria Andrea Bernal
ICTAI
2009
IEEE
14 years 7 months ago
TiMDPpoly: An Improved Method for Solving Time-Dependent MDPs
We introduce TiMDPpoly, an algorithm designed to solve planning problems with durative actions, under probabilistic uncertainty, in a non-stationary, continuous-time context. Miss...
Emmanuel Rachelson, Patrick Fabiani, Fréd&e...