1146 search results - page 22 / 230 » On the Complexity of Domain-Independent Planning |
JAIR
2000
13 years 7 months ago
2000
Recently model checking representation and search techniques were shown to be efciently applicable to planning, in particular to non-deterministic planning. Such planning approach...
DLOG
2007
13 years 10 months ago
2007
Abstract. In this paper, we continue the recently started work on integrating action formalisms with description logics (DLs), by investigating planning in the context of DLs. We p...
SWAT
1998
Springer
13 years 12 months ago
1998
Springer
We study the complexity of the motion planning problem for a bounded-reach robot in the situation where the n obstacles in its workspace satisfy two of the realistic models propos...
INFORMATICASI
2010
13 years 5 months ago
2010
Recognizing attack plans is one of the goals of security analysts. Attack plan recognition is critical for predicting future actions of attackers, generating possible actions (i.e...
AIPS
2010
13 years 10 months ago
2010
Factored planning methods aim to exploit locality to efficiently solve large but "loosely coupled" planning problems by computing solutions locally and propagating limit...