메뉴 건너뛰기




Volumn 141, Issue , 2006, Pages 580-584

Strong cyclic planning under partial observability

Author keywords

[No Author keywords available]

Indexed keywords

OBSERVABILITY;

EID: 84886077004     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: None     Document Type: Article
Times cited : (7)

References (11)
  • 1
    • 9444280630 scopus 로고    scopus 로고
    • A framework for planning with extended goals and partial observability
    • (June)
    • P. Bertoli, A. Cimatti, M. Pistore, and P. Traverso, 'A Framework for Planning with Extended Goals and Partial Observability', in Proc. of ICAPS03, (June 2003).
    • (2003) Proc. of ICAPS03
    • Bertoli, P.1    Cimatti, A.2    Pistore, M.3    Traverso, P.4
  • 2
    • 84880890864 scopus 로고    scopus 로고
    • Planning in nondeterministic domains under partial observability via symbolic model checking
    • P. Bertoli, A. Cimatti, M. Roveri, and P. Traverso, 'Planning in Nondeterministic Domains under Partial Observability via Symbolic Model Checking', in Proc. IJCAI'01, (2001).
    • (2001) Proc. IJCAI'01
    • Bertoli, P.1    Cimatti, A.2    Roveri, M.3    Traverso, P.4
  • 3
    • 13444312263 scopus 로고    scopus 로고
    • Planning with extended goals and partial observability
    • (June)
    • P. Bertoli and M. Pistore, 'Planning with Extended Goals and Partial Observability', in Proc. of ICAPS04, (June 2004).
    • (2004) Proc. of ICAPS04
    • Bertoli, P.1    Pistore, M.2
  • 4
    • 85166261608 scopus 로고    scopus 로고
    • Planning with incomplete information as heuristic search in belief space
    • AAAI Press, (April)
    • B. Bonet and H. Geffner, 'Planning with Incomplete Information as Heuristic Search in Belief Space', in Proc. of AIPS'00, pp. 52-61. AAAI Press, (April 2000).
    • (2000) Proc. of AIPS'00 , pp. 52-61
    • Bonet, B.1    Geffner, H.2
  • 5
    • 0038517219 scopus 로고    scopus 로고
    • Weak, strong, and strong cyclic planning via symbolic model checking
    • (July)
    • A. Cimatti, M. Pistore, M. Roveri, and P. Traverso, 'Weak, Strong, and Strong Cyclic Planning via Symbolic Model Checking', Artificial Intelligence, 147(1-2), 35-84, (July 2003).
    • (2003) Artificial Intelligence , vol.147 , Issue.1-2 , pp. 35-84
    • Cimatti, A.1    Pistore, M.2    Roveri, M.3    Traverso, P.4
  • 6
    • 0035369425 scopus 로고    scopus 로고
    • LAO: A heuristic search algorithm that finds solutions with loops
    • E. Hansen and S. Zilberstein, 'LAO: a Heuristic Search Algorithm that finds Solutions with Loops', Artificial Intelligence, 129(1), 35-62, (2001).
    • (2001) Artificial Intelligence , vol.129 , Issue.1 , pp. 35-62
    • Hansen, E.1    Zilberstein, S.2
  • 8
    • 11444268553 scopus 로고    scopus 로고
    • OBDD-Based optimistic and strong cyclic adversarial planning
    • R. M. Jensen, M. M. Veloso, and M. H. Bowling, 'OBDD-Based Optimistic and Strong Cyclic Adversarial Planning', in Proc. of ECP'01, (2001).
    • (2001) Proc. of ECP'01
    • Jensen, R.M.1    Veloso, M.M.2    Bowling, M.H.3
  • 9
  • 10
    • 84890305668 scopus 로고    scopus 로고
    • A hierarchical task network planner based symbolic model checking
    • Ugur Kuter, Dand Nau, Marco Pistore, and Paolo Traverso, 'A Hierarchical Task Network Planner based Symbolic Model Checking', in Proc. of ICAPS-2005, pp. 300-309, (2005).
    • (2005) Proc. of ICAPS-2005 , pp. 300-309
    • Kuter, U.1    Nau, D.2    Pistore, M.3    Traverso, P.4
  • 11
    • 0033332766 scopus 로고    scopus 로고
    • Constructing conditional plans by a theorem-prover
    • J. Rintanen, 'Constructing Conditional Plans by a Theorem-Prover', Journal of Artificial Intellegence Research, 10, 323-352, (1999).
    • (1999) Journal of Artificial Intellegence Research , vol.10 , pp. 323-352
    • Rintanen, J.1


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