메뉴 건너뛰기




Volumn 26, Issue , 2006, Pages 35-99

Planning graph heuristics for belief space search

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CONFORMAL MAPPING; DISTANCE MEASUREMENT; FORMAL LOGIC; HEURISTIC METHODS;

EID: 33746045571     PISSN: 10769757     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.1869     Document Type: Article
Times cited : (128)

References (31)
  • 1
    • 0012254239 scopus 로고    scopus 로고
    • Improving heuristics for planning as search in belief space
    • Bertoli, P., & Cimatti, A. (2002). Improving heuristics for planning as search in belief space. In Proceedings of AIPS' 02.
    • (2002) Proceedings of AIPS' 02
    • Bertoli, P.1    Cimatti, A.2
  • 2
    • 84880886485 scopus 로고    scopus 로고
    • Heuristic search + symbolic model checking = efficient conformant planning
    • Bertoli, P., Cimatti, A., & Roveri, M. (2001a). Heuristic search + symbolic model checking = efficient conformant planning. In Proceedings of IJCAI' 01.
    • (2001) Proceedings of IJCAI' 01
    • Bertoli, P.1    Cimatti, A.2    Roveri, M.3
  • 3
    • 84880890864 scopus 로고    scopus 로고
    • Planning in nondeterministic domains under partial observability via symbolic model checking
    • Bertoli, P., Cimatti, A., Roveri, M., & Traverse, P. (2001b). Planning in nondeterministic domains under partial observability via symbolic model checking. In Proceedings of IJCAI' 01.
    • (2001) Proceedings of IJCAI' 01
    • Bertoli, P.1    Cimatti, A.2    Roveri, M.3    Traverse, P.4
  • 4
    • 0001657540 scopus 로고
    • Fast planning through planning graph analysis
    • Blum A., & Furst, M. (1995). Fast planning through planning graph analysis. In Proceedings of IJCAI'95.
    • (1995) Proceedings of IJCAI'95
    • Blum, A.1    Furst, M.2
  • 6
    • 85166261608 scopus 로고    scopus 로고
    • Planning with incomplete information as heuristic search in belief space
    • Bonet, B., & Geffner, H. (2000). Planning with incomplete information as heuristic search in belief space. In Proceedings of AIPS' 00.
    • (2000) Proceedings of AIPS' 00
    • Bonet, B.1    Geffner, H.2
  • 8
    • 0022769976 scopus 로고
    • Graph-based algorithms for Boolean function manipulation
    • Bryant, R. (1986). Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, C-35(8), 677-691.
    • (1986) IEEE Transactions on Computers , vol.C-35 , Issue.8 , pp. 677-691
    • Bryant, R.1
  • 9
  • 14
    • 0022680851 scopus 로고
    • An assumption-based IMS
    • de Kleer, J. (1986). An Assumption-Based IMS. Artificial Intelligence, 28(2), 127-162.
    • (1986) Artificial Intelligence , vol.28 , Issue.2 , pp. 127-162
    • Kleer, J.1
  • 15
    • 0027706865 scopus 로고
    • Time-saving tips for problem solving with incomplete information
    • Genesereth, M. R., & Nourbakhsh, I. R. (1993). Time-saving tips for problem solving with incomplete information. In Proceedings of AAAI'93.
    • (1993) Proceedings of AAAI'93
    • Genesereth, M.R.1    Nourbakhsh, I.R.2
  • 16
    • 0035369425 scopus 로고    scopus 로고
    • LAO: A heuristic-search algorithm that finds solutions with loops
    • Hansen, E., & Zilberstein, S. (2001). LAO: A heuristic-search algorithm that finds solutions with loops. Artificial Intelligence, 129(1-2), 35-62.
    • (2001) Artificial Intelligence , vol.129 , Issue.1-2 , pp. 35-62
    • Hansen, E.1    Zilberstein, S.2
  • 17
    • 13444256696 scopus 로고    scopus 로고
    • Conformant planning via heuristic forward search: A new approach
    • Hoffmann, J., & Brafman, R. (2004). Conformant planning via heuristic forward search: A new approach. In Proceedings of ICAPS'04.
    • (2004) Proceedings of ICAPS'04
    • Hoffmann, J.1    Brafman, R.2
  • 18
    • 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
  • 19
    • 26844547497 scopus 로고    scopus 로고
    • A candidate set based analysis of subgoal interactions in conjunctive goal planning
    • Kambhampati, S., Ihrig, L., & Srivastava, B. (1996). A candidate set based analysis of subgoal interactions in conjunctive goal planning. In Proceedings of AIPS'96.
    • (1996) Proceedings of AIPS'96
    • Kambhampati, S.1    Ihrig, L.2    Srivastava, B.3
  • 22
    • 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
  • 23
    • 0036468047 scopus 로고    scopus 로고
    • Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search
    • Nguyen, X., Kambhampati, S., & Nigenda, R. (2002). Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search. Artificial Intelligence, 135(1-2), 73-123.
    • (2002) Artificial Intelligence , vol.135 , Issue.1-2 , pp. 73-123
    • Nguyen, X.1    Kambhampati, S.2    Nigenda, R.3
  • 25
    • 84990627165 scopus 로고
    • Synthesizing plans that contain actions with context-dependent effects
    • Pednault, E. P. D. (1988). Synthesizing plans that contain actions with context-dependent effects. Computational Intelligence, 4, 356-372.
    • (1988) Computational Intelligence , vol.4 , pp. 356-372
    • Pednault, E.P.D.1
  • 26
    • 85093865817 scopus 로고    scopus 로고
    • A knowledge-based approach to planning with incomplete information and sensing
    • Petrick, R., & Bacchus, F. (2002). A knowledge-based approach to planning with incomplete information and sensing. In Proceedings of AIPS'02.
    • (2002) Proceedings of AIPS'02
    • Petrick, R.1    Bacchus, F.2
  • 27
    • 9444291095 scopus 로고    scopus 로고
    • Expressive equivalence of formalisms for planning with sensing
    • Rintanen, J. (2003a). Expressive equivalence of formalisms for planning with sensing. In Proceedings of ICAPS'03.
    • (2003) Proceedings of ICAPS'03
    • Rintanen, J.1
  • 28
    • 33749024898 scopus 로고    scopus 로고
    • Product representation of belief spaces in planning under partial observability
    • Rintanen, J. (2003b). Product representation of belief spaces in planning under partial observability. In Proceedings of IJCAI'03.
    • (2003) Proceedings of IJCAI'03
    • Rintanen, J.1
  • 29
    • 9444243211 scopus 로고    scopus 로고
    • Distance estimates for planning in the discrete belief space
    • Rintanen, J. (2004). Distance estimates for planning in the discrete belief space. In Proceedings of AAAI'04.
    • (2004) Proceedings of AAAI'04
    • Rintanen, J.1
  • 31
    • 0031619007 scopus 로고    scopus 로고
    • Extending graphplan to handle uncertainty and sensing actions
    • Weld, D., Anderson, C., & Smith, D. (1998). Extending graphplan to handle uncertainty and sensing actions. In Proceedings of AAAI'98.
    • (1998) Proceedings of AAAI'98
    • Weld, D.1    Anderson, C.2    Smith, D.3


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