메뉴 건너뛰기




Volumn 170, Issue 4-5, 2006, Pages 337-384

Strong planning under partial observability

Author keywords

Binary decision diagrams; Heuristic search in belief space; Planning in nondeterministic domains; Planning under partial observability; Symbolic model checking

Indexed keywords

BENCHMARKING; COMPUTER SIMULATION; GENETIC ALGORITHMS; PLANNING; PROBLEM SOLVING; SEARCH ENGINES;

EID: 32944468402     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2006.01.004     Document Type: Article
Times cited : (88)

References (89)
  • 1
    • 9444228192 scopus 로고    scopus 로고
    • Generating safe assumption-based plans for partially observable, nondeterministic domains
    • Seattle, WA AAAI Press
    • A. Albore, and P. Bertoli Generating safe assumption-based plans for partially observable, nondeterministic domains Proceedings of AAAI-04 Seattle, WA 2004 AAAI Press
    • (2004) Proceedings of AAAI-04
    • Albore, A.1    Bertoli, P.2
  • 3
    • 0031379970 scopus 로고    scopus 로고
    • Structured solution methods for non-Markovian decision processes
    • Providence, RI
    • F. Bacchus, C. Boutilier, A.J. Grove, Structured solution methods for non-Markovian decision processes, in: Proceedings of AAAI-97, Providence, RI, 1997
    • (1997) Proceedings of AAAI-97
    • Bacchus, F.1    Boutilier, C.2    Grove, A.J.3
  • 11
    • 32944472322 scopus 로고    scopus 로고
    • Interleaving execution and planning for nondeterministic, partially observable domains
    • P. Bertoli, A. Cimatti, P. Traverso, Interleaving execution and planning for nondeterministic, partially observable domains, in: Proceedings of ECAI-04, 2004
    • (2004) Proceedings of ECAI-04
    • Bertoli, P.1    Cimatti, A.2    Traverso, P.3
  • 12
    • 0346942368 scopus 로고    scopus 로고
    • Decision-theoretic planning: Structural assumptions and computational leverage
    • C. Boutilier, T. Dean, and S. Hanks Decision-theoretic planning: structural assumptions and computational leverage J. Artificial Intelligence Res. (JAIR) 11 1 1999 1 94
    • (1999) J. Artificial Intelligence Res. (JAIR) , vol.11 , Issue.1 , pp. 1-94
    • Boutilier, C.1    Dean, T.2    Hanks, S.3
  • 13
    • 0031074857 scopus 로고    scopus 로고
    • Fast planning through planning graph analysis
    • A.L. Blum, and M.L. Furst Fast planning through planning graph analysis Artificial Intelligence 1-2 90 1997 279 298
    • (1997) Artificial Intelligence 1-2 , vol.90 , pp. 279-298
    • Blum, A.L.1    Furst, M.L.2
  • 16
    • 85166261608 scopus 로고    scopus 로고
    • Planning with incomplete information as heuristic search in belief space
    • AAAI Press
    • B. Bonet, and H. Geffner Planning with incomplete information as heuristic search in belief space Proceedings of AIPS-00 2000 AAAI Press 52 61
    • (2000) Proceedings of AIPS-00 , pp. 52-61
    • Bonet, B.1    Geffner, H.2
  • 17
    • 9444233135 scopus 로고    scopus 로고
    • Labeled RTDP: Improving the convergence of real-time dynamic programming
    • AAAI Press
    • B. Bonet, and H. Geffner Labeled RTDP: improving the convergence of real-time dynamic programming Proceedings of ICAPS-03 2003 AAAI Press 12 21
    • (2003) Proceedings of ICAPS-03 , pp. 12-21
    • Bonet, B.1    Geffner, H.2
  • 19
    • 13444256696 scopus 로고    scopus 로고
    • Conformant planning via heuristic forward search: A new approach
    • R. Brafman, J. Hoffmann, Conformant planning via heuristic forward search: a new approach, in: Proceedings of ICAPS-04, 2004
    • (2004) Proceedings of ICAPS-04
    • Brafman, R.1    Hoffmann, J.2
  • 20
    • 0033897011 scopus 로고    scopus 로고
    • Using temporal logic to express search control knowledge for planning
    • F. Bacchus, and F. Kabanza Using temporal logic to express search control knowledge for planning Artificial Intelligence 116 1 2000 123 191
    • (2000) Artificial Intelligence , vol.116 , Issue.1 , pp. 123-191
    • Bacchus, F.1    Kabanza, F.2
  • 22
    • 84862299563 scopus 로고    scopus 로고
    • A POMDP formulation of preference elicitation problems
    • C. Boutilier, A POMDP formulation of preference elicitation problems, in: AAAI/IAAI Proceedings, 2002
    • (2002) AAAI/IAAI Proceedings
    • Boutilier, C.1
  • 23
    • 13444312263 scopus 로고    scopus 로고
    • Planning with extended goals and partial observability
    • P. Bertoli, M. Pistore, Planning with extended goals and partial observability, in: Proceedings of ICAPS-04, 2004
    • (2004) Proceedings of ICAPS-04
    • Bertoli, P.1    Pistore, M.2
  • 24
  • 25
    • 0022769976 scopus 로고
    • Graph-based algorithms for boolean function manipulation
    • R.E. Bryant Graph-based algorithms for boolean function manipulation IEEE Trans. Comput. C-35 8 1986 677 691
    • (1986) IEEE Trans. Comput. , vol.C-35 , Issue.8 , pp. 677-691
    • Bryant, R.E.1
  • 26
    • 0026107125 scopus 로고
    • On the complexity of VLSI implementations and graph representations of boolean functions with application to integer multiplication
    • R.E. Bryant On the complexity of VLSI implementations and graph representations of boolean functions with application to integer multiplication IEEE Trans. Comput. 40 2 1991 205 213
    • (1991) IEEE Trans. Comput. , vol.40 , Issue.2 , pp. 205-213
    • Bryant, R.E.1
  • 27
    • 0026913667 scopus 로고
    • Symbolic boolean manipulation with ordered binary-decision diagrams
    • R.E. Bryant Symbolic boolean manipulation with ordered binary-decision diagrams ACM Comput. Surv. 24 3 1992 293 318
    • (1992) ACM Comput. Surv. , vol.24 , Issue.3 , pp. 293-318
    • Bryant, R.E.1
  • 30
    • 0022706656 scopus 로고
    • Automatic verification of finite-state concurrent systems using temporal logic specifications
    • E.M. Clarke, E.A. Emerson, and A.P. Sistla Automatic verification of finite-state concurrent systems using temporal logic specifications ACM Trans. Programming Languages Systems 8 2 1986 244 263
    • (1986) ACM Trans. Programming Languages Systems , vol.8 , Issue.2 , pp. 244-263
    • Clarke, E.M.1    Emerson, E.A.2    Sistla, A.P.3
  • 31
    • 0037503164 scopus 로고    scopus 로고
    • SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
    • C. Castellini, E. Giunchiglia, and A. Tacchella SAT-based planning in complex domains: concurrency, constraints and nondeterminism Artificial Intelligence J. 147 1,2 2003 85 117
    • (2003) Artificial Intelligence J. , vol.147 , Issue.12 , pp. 85-117
    • Castellini, C.1    Giunchiglia, E.2    Tacchella, A.3
  • 34
    • 0038517219 scopus 로고    scopus 로고
    • Weak, strong, and strong cyclic planning via symbolic model checking
    • A. Cimatti, M. Pistore, M. Roveri, and P. Traverso Weak, strong, and strong cyclic planning via symbolic model checking Artificial Intelligence 147 1-2 2003 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
  • 36
    • 4644364683 scopus 로고    scopus 로고
    • Conformant planning via symbolic model checking and heuristic search
    • A. Cimatti, M. Roveri, and P. Bertoli Conformant planning via symbolic model checking and heuristic search Artificial Intelligence 159 1-2 2004 127 206
    • (2004) Artificial Intelligence , vol.159 , Issue.1-2 , pp. 127-206
    • Cimatti, A.1    Roveri, M.2    Bertoli, P.3
  • 37
    • 84880900203 scopus 로고    scopus 로고
    • Strong planning in non-deterministic domains via model checking
    • AAAI Press
    • A. Cimatti, M. Roveri, and P. Traverso Strong planning in non-deterministic domains via model checking Proceedings of AIPS-98 1998 AAAI Press
    • (1998) Proceedings of AIPS-98
    • Cimatti, A.1    Roveri, M.2    Traverso, P.3
  • 38
    • 0000289556 scopus 로고    scopus 로고
    • Formal methods: State of the art and future directions
    • E.M. Clarke, and J.M. Wing Formal methods: state of the art and future directions ACM Comput. Surv. 28 4 1996 626 643
    • (1996) ACM Comput. Surv. , vol.28 , Issue.4 , pp. 626-643
    • Clarke, E.M.1    Wing, J.M.2
  • 40
    • 32944469820 scopus 로고    scopus 로고
    • Automata-theoretic approach to planning for temporally extended goals
    • S. Biundo(Ed.) Durham, UK Lecture Notes in Artificial Intelligence,Springer-Verlag
    • G. De Giacomo, and M.Y. Vardi Automata-theoretic approach to planning for temporally extended goals S. Biundo (Ed.) Proceeding of the Fifth European Conference on Planning Durham, UK Lecture Notes in Artificial Intelligence 1999 Springer-Verlag
    • (1999) Proceeding of the Fifth European Conference on Planning
    • De Giacomo, G.1    Vardi, M.Y.2
  • 50
    • 84890304446 scopus 로고    scopus 로고
    • Contingent planning via heuristic forward search with implicit belief states
    • J. Hoffmann, R. Brafman, Contingent planning via heuristic forward search with implicit belief states, in: Proceedings of ICAPS-05, 2005
    • (2005) Proceedings of ICAPS-05
    • Hoffmann, J.1    Brafman, R.2
  • 53
    • 0035369425 scopus 로고    scopus 로고
    • LAO*: A heuristic search algorithm that finds solutions with loops
    • E.A. Hansen, and S. Zilberstein LAO*: a heuristic search algorithm that finds solutions with loops Artificial Intelligence 129 1-2 2001 35 62
    • (2001) Artificial Intelligence , vol.129 , Issue.1-2 , pp. 35-62
    • Hansen, E.A.1    Zilberstein, S.2
  • 54
    • 0342520857 scopus 로고    scopus 로고
    • An efficient algorithm for searching implicit AND/OR graphs with cycles
    • P. Jimenez, and C. Torras An efficient algorithm for searching implicit AND/OR graphs with cycles Artificial Intelligence 124 2000 1 30
    • (2000) Artificial Intelligence , vol.124 , pp. 1-30
    • Jimenez, P.1    Torras, C.2
  • 55
    • 0000235433 scopus 로고    scopus 로고
    • OBDD-based universal planning for synchronized agents in non-deterministic domains
    • R.M. Jensen, and M.M. Veloso OBDD-based universal planning for synchronized agents in non-deterministic domains J. Artificial Intelligence Res. (JAIR) 13 2000 189 226
    • (2000) J. Artificial Intelligence Res. (JAIR) , vol.13 , pp. 189-226
    • Jensen, R.M.1    Veloso, M.M.2
  • 60
    • 0032073263 scopus 로고    scopus 로고
    • Planning and acting in partially observable stochastic domains
    • L. Kaelbling, M. Littman, and A. Cassandra Planning and acting in partially observable stochastic domains Artificial Intelligence 101 1-2 1998 99 134
    • (1998) Artificial Intelligence , vol.101 , Issue.1-2 , pp. 99-134
    • Kaelbling, L.1    Littman, M.2    Cassandra, A.3
  • 61
    • 0030352389 scopus 로고    scopus 로고
    • Pushing the envelope: Planning, propositional logic, and stochastic search
    • Portland, OR
    • H.A. Kautz, B. Selman, Pushing the envelope: planning, propositional logic, and stochastic search, in: Proceedings of AAAI-96, Portland, OR, 1996
    • (1996) Proceedings of AAAI-96
    • Kautz, H.A.1    Selman, B.2
  • 63
    • 0021973537 scopus 로고
    • AND/OR graph heuristics search methods
    • A. Mahanti, and A. Bagchi AND/OR graph heuristics search methods J. ACM 32 1 1985 28 51
    • (1985) J. ACM , vol.32 , Issue.1 , pp. 28-51
    • Mahanti, A.1    Bagchi, A.2
  • 67
    • 0018046320 scopus 로고
    • Optimising decision trees through heuristically guided search
    • A. Martelli, and U. Montanari Optimising decision trees through heuristically guided search Comm. ACM 21 12 1978 1025 1039
    • (1978) Comm. ACM , vol.21 , Issue.12 , pp. 1025-1039
    • Martelli, A.1    Montanari, U.2
  • 73
    • 0010222581 scopus 로고    scopus 로고
    • Planning for contingency: A decision based approach
    • L. Pryor, and G. Collins Planning for contingency: a decision based approach J. Artificial Intelligence Res. 4 1996 81 120
    • (1996) J. Artificial Intelligence Res. , vol.4 , pp. 81-120
    • Pryor, L.1    Collins, G.2
  • 75
    • 0000977910 scopus 로고
    • The complexity of Markov decision processes
    • C.H. Papadimitriou, and J.N. Tsitsiklis The complexity of Markov decision processes Math. Oper. Res. 12 3 1987 441 450
    • (1987) Math. Oper. Res. , vol.12 , Issue.3 , pp. 441-450
    • Papadimitriou, C.H.1    Tsitsiklis, J.N.2
  • 76
    • 84880882182 scopus 로고    scopus 로고
    • Planning as model checking for extended goals in non-deterministic domains
    • Seattle, WA
    • M. Pistore, P. Traverso, Planning as model checking for extended goals in non-deterministic domains, in: Proceedings of IJCAI-01, Seattle, WA, 2001
    • (2001) Proceedings of IJCAI-01
    • Pistore, M.1    Traverso, P.2
  • 77
    • 0033332766 scopus 로고    scopus 로고
    • Constructing conditional plans by a theorem-prover
    • J. Rintanen Constructing conditional plans by a theorem-prover J. Artificial Intellegence Res. 10 1999 323 352
    • (1999) J. Artificial Intellegence Res. , vol.10 , pp. 323-352
    • Rintanen, J.1
  • 82
    • 0004000699 scopus 로고    scopus 로고
    • Department of Electrical and Computer Engineering - University of Colorado at Boulder, April
    • F. Somenzi, CUDD: CU decision diagram package - release 2.1.2. Department of Electrical and Computer Engineering - University of Colorado at Boulder, April 1997
    • (1997) CUDD: CU Decision Diagram Package - Release 2.1.2
    • Somenzi, F.1
  • 83
    • 0017943242 scopus 로고
    • The optimal control of partially observable Markov decision processes over the infinite horizon: Discounted costs
    • E.J. Sondik The optimal control of partially observable Markov decision processes over the infinite horizon: discounted costs Oper. Res. 26 2 1978 282 304
    • (1978) Oper. Res. , vol.26 , Issue.2 , pp. 282-304
    • Sondik, E.J.1
  • 84
    • 13444255527 scopus 로고    scopus 로고
    • Supply restoration in power distribution systems: A benchmark for planning under uncertainty
    • S. Thiebaux, M.O. Cordier, Supply restoration in power distribution systems: a benchmark for planning under uncertainty, in: Proceedings of ECP-01, 2001
    • (2001) Proceedings of ECP-01
    • Thiebaux, S.1    Cordier, M.O.2


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