350 search results - page 17 / 70 » Complexity of Planning with Partial Observability |
CEEMAS
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We discuss the application of Model-Based Diagnosis in (agentbased) planning. Here, a plan together with its executing agent is considered as a system to be diagnosed. It...
KI
2005
Springer
14 years 2 months ago
2005
Springer
We discuss the application of Model-Based Diagnosis in (agent-based) planning. Here, a plan together with its executing agent is considered as a system to be diagnosed. It is assum...
AIPS
2006
13 years 10 months ago
2006
Classical planning algorithms require that their operators be simple in order for planning to be tractable. However, the complexities of real world domains suggest that, in order ...
AAAI
2007
13 years 11 months ago
2007
A Situated Conversational Agent (SCA) is an agent that engages in dialog about the context within which it is embedded. Situated dialog is characterized by its deep connection to ...
NIPS
2007
13 years 10 months ago
2007
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...