1146 search results - page 9 / 230 » On the Complexity of Domain-Independent Planning |
ECP
1997
Springer
13 years 12 months ago
1997
Springer
A possibilistic approach of planning under uncertainty has been developed recently. It applies to problems in which the initial state is partially known and the actions have graded...
AIPS
2000
13 years 9 months ago
2000
In the last years, some very promising domain independent heuristic state-space planners for STRIPS worlds, like ASP/HSP, HSPr and GRT, have been presented. These planners achieve...
IJCAI
2001
13 years 9 months ago
2001
In the last decade, there has been several studies on the computational complexity of planning. These studies normally assume that the goal of planning is to make a certain fluent...
IDEAL
2010
Springer
13 years 6 months ago
2010
Springer
Automated Planning is a very active area of research within Artificial Intelligence. Broadly this discipline deals with the methods by which an agent can independently determine t...
FLAIRS
2008
13 years 10 months ago
2008
There are a lot of approaches for solving planning problems. Many of these approaches are based on `brute force` search methods and do not care about structures of plans previousl...