350 search results - page 26 / 70 » Complexity of Planning with Partial Observability |
AI
2006
Springer
14 years 25 days ago
2006
Springer
Abstract. Current point-based planning algorithms for solving partially observable Markov decision processes (POMDPs) have demonstrated that a good approximation of the value funct...
ATAL
2008
Springer
13 years 11 months ago
2008
Springer
In the complex, dynamic domain of Air Traffic Control (ATC) many unexpected events can happen during the execution of a plan. Sometimes these disruptions make the plan infeasible ...
KI
2009
Springer
14 years 3 months ago
2009
Springer
Today’s complex production systems allow to simultaneously build different products following individual production plans. Such plans may fail due to component faults or unfores...
AAMAS
2000
Springer
13 years 9 months ago
2000
Springer
Hospital Patient Scheduling is an inherently distributed problem because of the way real hospitals are organized. As medical procedures have become more complex, and their associat...
ATAL
2007
Springer
14 years 3 months ago
2007
Springer
A problem of planning for cooperative teams under uncertainty is a crucial one in multiagent systems. Decentralized partially observable Markov decision processes (DECPOMDPs) prov...