메뉴 건너뛰기




Volumn , Issue , 2011, Pages 918-923

Generalized planning: Synthesizing plans that work for multiple environments

Author keywords

[No Author keywords available]

Indexed keywords

FINITE SET; FINITE-STATE; FORMAL DEFINITION; GENERALIZED PLANNING; ONE-DIMENSIONAL PROBLEM; REPRESENTATION FORMALISMS;

EID: 84880107329     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.5591/978-1-57735-516-8/IJCAI11-159     Document Type: Conference Paper
Times cited : (106)

References (17)
  • 3
    • 78650600888 scopus 로고    scopus 로고
    • Automatic derivation of memoryless policies and finitestate controllers using classical planners
    • Bonet Bonet, Héctor Palacios, and Héctor Geffner. Automatic derivation of memoryless policies and finitestate controllers using classical planners. In ICAPS, 2009.
    • (2009) ICAPS
    • Bonet, B.1    Palacios, H.2    Geffner, H.3
  • 4
    • 0028498153 scopus 로고
    • The computational complexity of propositional strips planning
    • Tom Bylander. The computational complexity of propositional strips planning. Artificial Intelligence, 69(1-2):165-204, 1994.
    • (1994) Artificial Intelligence , vol.69 , Issue.1-2 , pp. 165-204
    • Bylander, T.1
  • 5
    • 0038256832 scopus 로고    scopus 로고
    • Automata-theoretic approach to planning for temporally extended goals
    • Giuseppe De Giacomo and Moshe Y. Vardi. Automata-theoretic approach to planning for temporally extended goals. In ECP, 1999.
    • (1999) ECP
    • De Giacomo, G.1    Vardi, M.Y.2
  • 8
    • 84943278573 scopus 로고    scopus 로고
    • Some results on the complexity of planning with incomplete information
    • Patrik Haslum and Peter Jonsson. Some results on the complexity of planning with incomplete information. In ECP, pages 308-318, 1999.
    • (1999) ECP , pp. 308-318
    • Haslum, P.1    Jonsson, P.2
  • 10
    • 84860591727 scopus 로고    scopus 로고
    • A correctness result for reasoning about one-dimensional planning problems
    • Yuxiao Hu and Hector Levesque. A correctness result for reasoning about one-dimensional planning problems. In KR, 2010.
    • (2010) KR
    • Hu, Y.1    Levesque, H.2
  • 11
    • 84880731557 scopus 로고    scopus 로고
    • Planning with loops
    • Hector Levesque. Planning with loops. In IJCAI, 2005.
    • (2005) IJCAI
    • Levesque, H.1
  • 12
    • 77956048571 scopus 로고    scopus 로고
    • Compiling uncertainty away in conformant planning problems with bounded width
    • Héctor Palacios and Héctor Geffner. Compiling uncertainty away in conformant planning problems with bounded width. Journal of Artificial Intelligence Research, 35:623-675, 2009.
    • (2009) Journal of Artificial Intelligence Research , vol.35 , pp. 623-675
    • Palacios, H.1    Geffner, H.2
  • 13
    • 0024864157 scopus 로고
    • On the synthesis of a reactive module
    • Amir Pnueli and Roni Rosner. On the synthesis of a reactive module. In POPL, pages 179-190, 1989.
    • (1989) POPL , pp. 179-190
    • Pnueli, A.1    Rosner, R.2
  • 14
    • 77956047996 scopus 로고    scopus 로고
    • Constraint-based controller synthesis in non-deterministic and partially observable domains
    • Cédric Pralet, Gérard Verfaillie, Michel Lemaître, and Guillaume Infantes. Constraint-based controller synthesis in non-deterministic and partially observable domains. In ECAI, 2010.
    • (2010) ECAI
    • Pralet, C.1    Verfaillie, G.2    Lemaître, M.3    Infantes, G.4
  • 15
    • 13444301648 scopus 로고    scopus 로고
    • Complexity of planning with partial observability
    • Jussi Rintanen. Complexity of planning with partial observability. In ICAPS, pages 345-354, 2004.
    • (2004) ICAPS , pp. 345-354
    • Rintanen, J.1
  • 16
    • 77956030015 scopus 로고    scopus 로고
    • Learning generalized plans using abstract counting
    • S. Srivastava, N. Immerman, and S. Zilberstein. Learning generalized plans using abstract counting. In AAAI, 2008.
    • (2008) AAAI
    • Srivastava, S.1    Immerman, N.2    Zilberstein, S.3
  • 17
    • 78650945131 scopus 로고    scopus 로고
    • A new representation and associated algorithms for generalized planning
    • Siddharth Srivastava, Neil Immerman, and Shlomo Zilberstein. A new representation and associated algorithms for generalized planning. Artificial Intelligence, 175(2):615-647, 2011.
    • (2011) Artificial Intelligence , vol.175 , Issue.2 , pp. 615-647
    • Srivastava, S.1    Immerman, N.2    Zilberstein, S.3


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