179 search results - page 27 / 36 » Using Classical Planners to Solve Nondeterministic Planning ... |
128
click to vote
KES
2004
Springer
15 years 7 months ago
2004
Springer
Artificial Intelligence algorithms can be divided into two groups according to the type of problems they solve. Knowledge-intensive domains contain explicit knowledge, whereas know...
185
click to vote
AIPS
2011
14 years 5 months ago
2011
We define a probe to be a single action sequence computed greedily from a given state that either terminates in the goal or fails. We show that by designing these probes carefull...
RAS
1998
15 years 1 months ago
1998
We present a new approach to the multi-robot path planning problem, where a number of robots are to change their positions through feasible motions in the same static environment....
142
click to vote
JAIR
2008
15 years 1 months ago
2008
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...
106
click to vote
PLDI
2006
ACM
15 years 7 months ago
2006
ACM
Progressing beyond the productivity of present-day languages appears to require using domain-specific knowledge. Domain-specific languages and libraries (DSLs) proliferate, but ...