350 search results - page 12 / 70 » Complexity of Planning with Partial Observability |
102
click to vote
ATAL
2008
Springer
15 years 1 months ago
2008
Springer
The paper formalizes a distributed approach to the problem of supervising the execution of a multi-agent plan where (possibly joint) actions are executed concurrently by a team of...
105
click to vote
ATAL
2010
Springer
15 years 26 days ago
2010
Springer
A central problem in artificial intelligence is to choose actions to maximize reward in a partially observable, uncertain environment. To do so, we must learn an accurate model of ...
AAAI
2010
15 years 1 months ago
2010
Planning in large, partially observable domains is challenging, especially when a long-horizon lookahead is necessary to obtain a good policy. Traditional POMDP planners that plan...
AIPS
2006
15 years 1 months ago
2006
Planning for partially observable, nondeterministic domains is a very signi cant and computationally hard problem. Often, reasonable assumptions can be drawn over expected/nominal...
108
click to vote
UAI
2003
15 years 1 months ago
2003
For a given problem, the optimal Markov policy over a finite horizon is a conditional plan containing a potentially large number of branches. However, there are applications wher...