메뉴 건너뛰기




Volumn , Issue , 2004, Pages 513-518

Forward-chaining planning in nondeterministic domains

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONFORMAL MAPPING; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING;

EID: 9444248635     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (31)

References (22)
  • 1
    • 0033897011 scopus 로고    scopus 로고
    • 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
  • 3
    • 0031074857 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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
  • 12
    • 84929881457 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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
  • 21
    • 0031619318 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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


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