-
1
-
-
0033897011
-
Using temporal logics to express search control knowledge for planning
-
Bacchus, F., and Kabanza, F. 2000. Using Temporal Logics to Express Search Control Knowledge for Planning. Artificial Intelligence 116(1-2):123-191.
-
(2000)
Artificial Intelligence
, vol.116
, Issue.1-2
, pp. 123-191
-
-
Bacchus, F.1
Kabanza, F.2
-
2
-
-
0043027543
-
MBP: A model based planner
-
Bertoli, P.; Cimatti, A.; Pistore, M.; Roveri, M.; and Traverso, P. 2001. MBP: A Model Based Planner. In Proceedings of IJCAI Workshop on Planning under Uncertainty and Incomplete Information, 93-97.
-
(2001)
Proceedings of IJCAI Workshop on Planning under Uncertainty and Incomplete Information
, pp. 93-97
-
-
Bertoli, P.1
Cimatti, A.2
Pistore, M.3
Roveri, M.4
Traverso, P.5
-
3
-
-
0031074857
-
Fast planning through planning graph analysis
-
Blum, A. L., and Furst, M. L. 1997. Fast Planning Through Planning Graph Analysis. Artificial Intelligence 90(1-2):281-300.
-
(1997)
Artificial Intelligence
, vol.90
, Issue.1-2
, pp. 281-300
-
-
Blum, A.L.1
Furst, M.L.2
-
5
-
-
85166261608
-
Planning with incomplete information as heuristic search in belief space
-
Chien, S.; Kambhampati, S.; and Knoblock, C., eds., Breckenridge, CO: AAAI Press
-
Bonet, B., and Geffner, H. 2000. Planning with Incomplete Information as Heuristic Search in Belief Space. In Chien, S.; Kambhampati, S.; and Knoblock, C., eds., Proceedings of the International Conference on AI Planning Systems (AIPS), 52-61. Breckenridge, CO: AAAI Press.
-
(2000)
Proceedings of the International Conference on AI Planning Systems (AIPS)
, pp. 52-61
-
-
Bonet, B.1
Geffner, H.2
-
8
-
-
0037503164
-
SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
-
To appear
-
Castellini, C.; Giunchiglia, E.; and Tacchella, A. 2003. SAT-Based Planning in Complex Domains: Concurrency, Constraints and Nondeterminism. Artificial Intelligence 147(1-2):85-117. To appear.
-
(2003)
Artificial Intelligence
, vol.147
, Issue.1-2
, pp. 85-117
-
-
Castellini, C.1
Giunchiglia, E.2
Tacchella, A.3
-
9
-
-
0038517219
-
Weak, strong, and strong cyclic planning via symbolic model checking
-
Cimatti, A.; Pistore, M.; Roveri, M.; and Traverso, P. 2003. Weak, Strong, and Strong Cyclic Planning via Symbolic Model Checking. Artificial Intelligence 147(1-2):35-84.
-
(2003)
Artificial Intelligence
, vol.147
, Issue.1-2
, pp. 35-84
-
-
Cimatti, A.1
Pistore, M.2
Roveri, M.3
Traverso, P.4
-
10
-
-
84880900203
-
Strong planning in non-deterministic domains via model checking
-
Pittsburgh, PA: AAAI Press
-
Cimatti, A.; Roveri, M.; and Traverso, P. 1998. Strong Planning in Non-Deterministic Domains via Model Checking. In Proceedings of the International Conference on AI Planning Systems (AIPS), 36-43. Pittsburgh, PA: AAAI Press.
-
(1998)
Proceedings of the International Conference on AI Planning Systems (AIPS)
, pp. 36-43
-
-
Cimatti, A.1
Roveri, M.2
Traverso, P.3
-
11
-
-
0001032939
-
Strong cyclic planning revisited
-
Durham, UK: Springer
-
Daniele, M.; Traverso, P.; and Vardi, M. 1999. Strong Cyclic Planning Revisited. In Proceedings of the European Conference on Planning (ECP), 35-48. Durham, UK: Springer.
-
(1999)
Proceedings of the European Conference on Planning (ECP)
, pp. 35-48
-
-
Daniele, M.1
Traverso, P.2
Vardi, M.3
-
12
-
-
84929881457
-
Planning as satisfiability in nondeterministic domains
-
Menlo Park, CA: AAAI Press
-
Ferraris, P., and Giunchiglia, E. 2000. Planning as Satisfiability in Nondeterministic Domains. In AAAI/IAAI Proceedings, 748-753. Menlo Park, CA: AAAI Press.
-
(2000)
AAAI/IAAI Proceedings
, pp. 748-753
-
-
Ferraris, P.1
Giunchiglia, E.2
-
13
-
-
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. Journal of Artificial Intelligence Research 14:253-302.
-
(2001)
Journal of Artificial Intelligence Research
, vol.14
, pp. 253-302
-
-
Hoffmann, J.1
Nebel, B.2
-
15
-
-
9444290253
-
Using forward-chaining planning for generating weak, strong, and strong-cyclic solutions in nondeterministic domains
-
Dept. of Computer Science, University of Maryland
-
Kuter, U., and Nau, D. 2004. Using Forward-Chaining Planning for Generating Weak, Strong, and Strong-Cyclic Solutions in Nondeterministic Domains. Technical Report CS-TR-4580, Dept. of Computer Science, University of Maryland.
-
(2004)
Technical Report CS-TR-4580
-
-
Kuter, U.1
Nau, D.2
-
17
-
-
27444431878
-
SHOP2: An HTN planning system
-
Nau, D.; Au, T.-C.; Ilghami, O.; Kuter, U.; Murdock, W.; Wu, D.; and Yaman, F. 2003. SHOP2: An HTN Planning System. Journal of Artificial Intelligence Research 20:379-404.
-
(2003)
Journal of Artificial Intelligence Research
, vol.20
, pp. 379-404
-
-
Nau, D.1
Au, T.-C.2
Ilghami, O.3
Kuter, U.4
Murdock, W.5
Wu, D.6
Yaman, F.7
-
21
-
-
0031619318
-
Conformant graphplan
-
Menlo Park, CA: AAAI Press
-
Smith, D. E., and Weld, D. S. 1998. Conformant Graphplan. In AAAI/IAAI Proceedings, 889-896. Menlo Park, CA: AAAI Press.
-
(1998)
AAAI/IAAI Proceedings
, pp. 889-896
-
-
Smith, D.E.1
Weld, D.S.2
-
22
-
-
0031619007
-
Extending graphplan to handle uncertainty and sensing actions
-
Menlo Park, CA: AAAI Press
-
Weld, D. S.; Anderson, C. R.; and Smith, D. E. 1998. Extending Graphplan to Handle Uncertainty and Sensing Actions. In AAAI/IAAI Proceedings, 897-904. Menlo Park, CA: AAAI Press.
-
(1998)
AAAI/IAAI Proceedings
, pp. 897-904
-
-
Weld, D.S.1
Anderson, C.R.2
Smith, D.E.3
|