250 search results - page 40 / 50 » Learning action effects in partially observable domains |
JAIR
2007
14 years 11 months ago
2007
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...
106
click to vote
AIPS
2008
15 years 2 months ago
2008
Enforced hill-climbing is an effective deterministic hillclimbing technique that deals with local optima using breadth-first search (a process called "basin flooding"). ...
91
Voted
AAMAS
2007
Springer
14 years 11 months ago
2007
Springer
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...
AAMAS
2006
Springer
14 years 11 months ago
2006
Springer
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...
87
Voted
IJCAI
1997
15 years 1 months ago
1997
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...