메뉴 건너뛰기




Volumn 22, Issue , 2004, Pages 215-278

Ordered landmarks in planning

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; INFORMATION MANAGEMENT; PERFORMANCE;

EID: 27344447284     PISSN: 10769757     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.1492     Document Type: Article
Times cited : (279)

References (32)
  • 1
    • 0031074857 scopus 로고    scopus 로고
    • Fast planning through planning graph analysis
    • Blum, A. L., & Furst, M. L. (1997). Fast planning through planning graph analysis. Artificial Intelligence, 90(1-2), 279-298.
    • (1997) Artificial Intelligence , vol.90 , Issue.1-2 , pp. 279-298
    • Blum, A.L.1    Furst, M.L.2
  • 2
    • 0035369022 scopus 로고    scopus 로고
    • Planning as heuristic search
    • Bonet, B., & Geffner, H. (2001). Planning as heuristic search. Artificial Intelligence, 129(1-2), 5-33.
    • (2001) Artificial Intelligence , vol.129 , Issue.1-2 , pp. 5-33
    • Bonet, B.1    Geffner, H.2
  • 3
    • 0028498153 scopus 로고
    • The computational complexity of propositional STRIPS planning
    • Bylander, T. (1994). The computational complexity of propositional STRIPS planning. Artificial Intelligence, 69(1-2), 165-204.
    • (1994) Artificial Intelligence , vol.69 , Issue.1-2 , pp. 165-204
    • Bylander, T.1
  • 5
    • 2842560201 scopus 로고
    • STRIPS: A new approach to the application of theorem proving to problem solving
    • Fikes, R. E., & Nilsson, N. (1971). STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence, 2, 189-208.
    • (1971) Artificial Intelligence , vol.2 , pp. 189-208
    • Fikes, R.E.1    Nilsson, N.2
  • 6
    • 0346087335 scopus 로고
    • Prodigy planning algorithm
    • Carnegie Mellon University
    • Fink, E., & Veloso, M. (1994). Prodigy planning algorithm. Technical report CMU-94-123, Carnegie Mellon University.
    • (1994) Technical Report , vol.CMU-94-123
    • Fink, E.1    Veloso, M.2
  • 9
    • 84898688040 scopus 로고    scopus 로고
    • Combining the expressiveness of UCPOP with the efficiency of Graphplan
    • Steel & Alami, 1997
    • Gazen, B. C., & Knoblock, C. (1997). Combining the expressiveness of UCPOP with the efficiency of Graphplan.. In Steel, & Alami (Steel & Alami, 1997), pp. 221-233.
    • (1997) Steel, & Alami , pp. 221-233
    • Gazen, B.C.1    Knoblock, C.2
  • 14
    • 77049118353 scopus 로고    scopus 로고
    • Local search topology in planning benchmarks: A theoretical analysis
    • Ghallab, M., Hertzberg, J., & Traverso, P. (Eds.), Toulouse, France. Morgan Kaufmann
    • Hoffmann, J. (2002). Local search topology in planning benchmarks: A theoretical analysis. In Ghallab, M., Hertzberg, J., & Traverso, P. (Eds.), Proceedings of the 6th International Conference on Artificial Intelligence Planning and Scheduling (AIPS-02), pp. 92-100, Toulouse, France. Morgan Kaufmann.
    • (2002) Proceedings of the 6th International Conference on Artificial Intelligence Planning and Scheduling (AIPS-02) , pp. 92-100
    • Hoffmann, J.1
  • 15
    • 13444301819 scopus 로고    scopus 로고
    • The Metric-FF planning system: Translating "ignoring delete lists" to numerical state variables
    • Hoffmann, J. (2003). The Metric-FF planning system: Translating "ignoring delete lists" to numerical state variables. Journal of Artificial Intelligence Research, 20, 291-341.
    • (2003) Journal of Artificial Intelligence Research , vol.20 , pp. 291-341
    • Hoffmann, J.1
  • 16
    • 0036377352 scopus 로고    scopus 로고
    • The FF planning system: Fast plan generation through heuristic search
    • Hoffmann, J., & 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
  • 17
    • 24244435536 scopus 로고    scopus 로고
    • Extracting goal orderings to improve partial-order and Graphplan-based planning
    • University of Kaiserslautern
    • Hüllen, J., Muñoz-Avila, H., & Weberskirch, F. (1999). Extracting goal orderings to improve partial-order and Graphplan-based planning. Technical report, University of Kaiserslautern.
    • (1999) Technical Report
    • Hüllen, J.1    Muñoz-Avila, H.2    Weberskirch, F.3
  • 19
    • 0028484996 scopus 로고
    • Automatically generating abstractions for planning
    • Knoblock, C. (1994). Automatically generating abstractions for planning. Artificial Intelligence, 68(2), 243-302.
    • (1994) Artificial Intelligence , vol.68 , Issue.2 , pp. 243-302
    • Knoblock, C.1
  • 21
    • 14344270404 scopus 로고    scopus 로고
    • On reasonable and forced goal orderings and their use in an agenda-driven planning algorithm
    • Koehler, J., & Hoffmann, J. (2000). On reasonable and forced goal orderings and their use in an agenda-driven planning algorithm. Journal of Artificial Intelligence Research, 12, 338-386.
    • (2000) Journal of Artificial Intelligence Research , vol.12 , pp. 338-386
    • Koehler, J.1    Hoffmann, J.2
  • 22
    • 84898681853 scopus 로고    scopus 로고
    • Extending planning graphs to an ADL subset
    • Steel & Alami, 1997
    • Koehler, J., Nebel, B., Hoffmann, J., & Dimopoulos, Y. (1997). Extending planning graphs to an ADL subset.. In Steel, & Alami (Steel & Alami, 1997), pp. 273-285.
    • (1997) Steel, & Alami , pp. 273-285
    • Koehler, J.1    Nebel, B.2    Hoffmann, J.3    Dimopoulos, Y.4
  • 23
    • 9444231507 scopus 로고    scopus 로고
    • The 3rd international planning competition: Results and analysis
    • Long, D., & Fox, M. (2003). The 3rd international planning competition: Results and analysis. Journal of Artificial Intelligence Research, 20, 1-59.
    • (2003) Journal of Artificial Intelligence Research , vol.20 , pp. 1-59
    • Long, D.1    Fox, M.2
  • 24
    • 0031200240 scopus 로고    scopus 로고
    • Engineering and compiling planning domain models to promote validity and efficiency
    • McCluskey, T. L., & Porteous, J. M. (1997). Engineering and compiling planning domain models to promote validity and efficiency. Artificial Intelligence, 95(1), 1-65.
    • (1997) Artificial Intelligence , vol.95 , Issue.1 , pp. 1-65
    • McCluskey, T.L.1    Porteous, J.M.2
  • 26
    • 0033522716 scopus 로고    scopus 로고
    • Using regression-match graphs to control search in planning
    • McDermott, D. V. (1999). Using regression-match graphs to control search in planning. Artificial Intelligence, 109(1-2), 111-159.
    • (1999) Artificial Intelligence , vol.109 , Issue.1-2 , pp. 111-159
    • McDermott, D.V.1
  • 32
    • 23144436438 scopus 로고    scopus 로고
    • Recent advances in AI planning. 4th european conference on planning (ECP'97)
    • Toulouse, France. Springer-Verlag
    • Steel, S., & Alami, R. (Eds.). (1997). Recent Advances in AI Planning. 4th European Conference on Planning (ECP'97), Vol. 1348 of Lecture Notes in Artificial Intelligence, Toulouse, France. Springer-Verlag.
    • (1997) Lecture Notes in Artificial Intelligence , vol.1348
    • Steel, S.1    Alami, R.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.