메뉴 건너뛰기




Volumn , Issue , 2010, Pages 161-168

Computing applicability conditions for plans with loops

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTED PLANS; GENERAL CLASS; NOVEL ALGORITHM; PLANNING COMMUNITY; POST PROCESSING; SAFETY PROPERTY;

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

References (11)
  • 1
    • 78650600888 scopus 로고    scopus 로고
    • Automatic derivation of memoryless policies and finite-state controllers using classical planners
    • Bonet, B.; Palacios, H.; and Geffner, H. 2009. Automatic derivation of memoryless policies and finite-state controllers using classical planners. In Proc. of ICAPS, 34-41.
    • (2009) Proc. of ICAPS , pp. 34-41
    • Bonet, B.1    Palacios, H.2    Geffner, H.3
  • 2
    • 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. Artif. Intell. 147(1-2):35-84.
    • (2003) Artif. Intell. , vol.147 , Issue.1-2 , pp. 35-84
    • Cimatti, A.1    Pistore, M.2    Roveri, M.3    Traverso, P.4
  • 5
    • 0001483328 scopus 로고
    • How to program an infinite abacus
    • Lambek, J. 1961. How to program an infinite abacus. Canadian Mathematical Bulletin 4(3):295-302.
    • (1961) Canadian Mathematical Bulletin , vol.4 , Issue.3 , pp. 295-302
    • Lambek, J.1
  • 6
    • 84880731557 scopus 로고    scopus 로고
    • Planning with loops
    • Levesque, H. J. 2005. Planning with loops. In Proc. of IJCAI, 509-515.
    • (2005) Proc. of IJCAI , pp. 509-515
    • Levesque, H.J.1
  • 9
    • 57749181751 scopus 로고    scopus 로고
    • Learning generalized plans using abstract counting
    • Srivastava, S.; Immerman, N.; and Zilberstein, S. 2008. Learning generalized plans using abstract counting. In Proc. of AAAI, 991-997.
    • (2008) Proc. of AAAI , pp. 991-997
    • Srivastava, S.1    Immerman, N.2    Zilberstein, S.3
  • 10
    • 78650949742 scopus 로고    scopus 로고
    • Merging example plans into generalized plans for non-deterministic environments
    • to appear
    • Srivastava, S.; Immerman, N.; and Zilberstein, S. 2010. Merging example plans into generalized plans for non-deterministic environments. In Proc. of AAMAS (to appear).
    • (2010) Proc. of AAMAS
    • Srivastava, S.1    Immerman, N.2    Zilberstein, S.3


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