-
1
-
-
0035369022
-
Planning as heuristic search
-
Bonet, B., and Geffner, H. 2001. Planning as heuristic search. AIJ 129(1-2):5-33.
-
(2001)
AIJ
, vol.129
, Issue.1-2
, pp. 5-33
-
-
Bonet, B.1
Geffner, H.2
-
2
-
-
57749207001
-
Heuristics for planning with penalties and rewards using compiled knowledge
-
Bonet, B., and Geffner, H. 2006. Heuristics for planning with penalties and rewards using compiled knowledge. In KR-06.
-
(2006)
KR
, vol.6
-
-
Bonet, B.1
Geffner, H.2
-
3
-
-
0028498153
-
The computational complexity of propositional STRIPS planning
-
Bylander, T. 1994. The computational complexity of propositional STRIPS planning. AIJ 69(1-2):165-204.
-
(1994)
AIJ
, vol.69
, Issue.1-2
, pp. 165-204
-
-
Bylander, T.1
-
4
-
-
85158098799
-
A new admissible heuristic for minimal-cost proofs
-
Charniak, E., and Husain, S. 1991. A new admissible heuristic for minimal-cost proofs. In AAAI, 446-451.
-
(1991)
AAAI
, pp. 446-451
-
-
Charniak, E.1
Husain, S.2
-
5
-
-
0002812045
-
Planning with pattern databases
-
Edelkamp, S. 2001. Planning with pattern databases. In ECP, 13-34.
-
(2001)
ECP
, pp. 13-34
-
-
Edelkamp, S.1
-
6
-
-
2842560201
-
STRIPS: A new approach to the application of theorem proving to problem solving
-
Fikes, R. E., and Nilsson, N. 1971. STRIPS: A new approach to the application of theorem proving to problem solving. AIJ 2:189-208.
-
(1971)
AIJ
, vol.2
, pp. 189-208
-
-
Fikes, R.E.1
Nilsson, N.2
-
7
-
-
85166200109
-
Admissible heuristics for optimal planning
-
Haslum, P., and Geffner, H. 2000. Admissible heuristics for optimal planning. In ICAPS, 140-149.
-
(2000)
ICAPS
, pp. 140-149
-
-
Haslum, P.1
Geffner, H.2
-
8
-
-
29344444840
-
New admissible heuristics for domain-independent planning
-
Haslum, P.; Bonet, B.; and Geffner, H. 2005. New admissible heuristics for domain-independent planning. In AAAI, 1163-1168.
-
(2005)
AAAI
, pp. 1163-1168
-
-
Haslum, P.1
Bonet, B.2
Geffner, H.3
-
9
-
-
0036377352
-
The FF planning system: Fast plan generation through heuristic search
-
Hoffmann, J., and Nebel, B. 2001. The FF planning system: Fast plan generation through heuristic search. JAIR 14:253-302.
-
(2001)
JAIR
, vol.14
, pp. 253-302
-
-
Hoffmann, J.1
Nebel, B.2
-
10
-
-
0022129301
-
Depth-first iterative-deepening: An optimal admissible tree search
-
Korf, R. E. 1985. Depth-first iterative-deepening: An optimal admissible tree search. AIJ 27(1):97-109.
-
(1985)
AIJ
, vol.27
, Issue.1
, pp. 97-109
-
-
Korf, R.E.1
-
11
-
-
0033522716
-
Using regression-match graphs to control search in planning
-
McDermott, D. V. 1999. Using regression-match graphs to control search in planning. AIJ 109(1-2):111-159.
-
(1999)
AIJ
, vol.109
, Issue.1-2
, pp. 111-159
-
-
McDermott, D.V.1
-
12
-
-
0036468047
-
Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search
-
Nguyen, X.-L.; Kambhampati, S.; and Nigenda, R. S. 2002. Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search. AIJ 135(1-2):73-123.
-
(2002)
AIJ
, vol.135
, Issue.1-2
, pp. 73-123
-
-
Nguyen, X.-L.1
Kambhampati, S.2
Nigenda, R.S.3
-
14
-
-
0001198617
-
The GRT planning system: Backward heuristic construction in forward statespace planning
-
Refanidis, I., and Vlahavas, I. P. 2001. The GRT planning system: Backward heuristic construction in forward statespace planning. JAIR 15:115-161.
-
(2001)
JAIR
, vol.15
, pp. 115-161
-
-
Refanidis, I.1
Vlahavas, I.P.2
-
15
-
-
58349088280
-
Unified definition of heuristics for classical planning
-
Rintanen, J. 2006. Unified definition of heuristics for classical planning. In ECAI, 600-604.
-
(2006)
ECAI
, pp. 600-604
-
-
Rintanen, J.1
-
16
-
-
0012758912
-
Costsharing in Bayesian Knowledge Bases
-
Shimony, S.; Domshlak, C.; and Santos, E. J. 1997. Costsharing in Bayesian Knowledge Bases. In UAI, 421-428.
-
(1997)
UAI
, pp. 421-428
-
-
Shimony, S.1
Domshlak, C.2
Santos, E.J.3
|