6957 search results - page 128 / 1392 » Planning before plans |
AAAI
2006
13 years 9 months ago
2006
Even under polynomial restrictions on plan length, conformant planning remains a very hard computational problem as plan verification itself can take exponential time. This heavy ...
IJCAI
2003
13 years 9 months ago
2003
A longstanding goal in planning research is the ability to generalize plans developed for some set of environments to a new but similar environment, with minimal or no replanning....
AAAI
2000
13 years 9 months ago
2000
We propose an epistemic dynamic logic EDL able to represent the interactions between action and knowledge that are fundamental to planning under partial observability. EDL enables...
AIPS
2000
13 years 9 months ago
2000
Planners from the family of Graphplan (Graphplan, IPP, STAN...) are presently considered as the most efficient ones on numerous planning domains. Their partially ordered plans can...
WSC
1997
13 years 9 months ago
1997
One of the key issues in reasoning with multiple interacting intelligent agents is how to model and code the decision making process of the agents. In Artificial Intelligence (AI...