메뉴 건너뛰기




Volumn , Issue , 2007, Pages 1852-1859

When is temporal planning really temporal?

Author keywords

[No Author keywords available]

Indexed keywords

ACTION LANGUAGE; CLASSICAL PLANNING; INTERNATIONAL PLANNING COMPETITIONS; PLANNING COMPETITIONS; REACHABILITY HEURISTICS; TEMPORAL PLANNING;

EID: 84880855376     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (134)

References (24)
  • 1
    • 84880884193 scopus 로고    scopus 로고
    • Planning with resources and concurrency: A forward chaining approach
    • F. Bacchus and M. Ady. Planning with resources and concurrency: A forward chaining approach. In IJCAI, 2001.
    • (2001) IJCAI
    • Bacchus, F.1    Ady, M.2
  • 2
    • 0002247682 scopus 로고    scopus 로고
    • A robust and fast action selection mechanism for planning
    • B. Bonet, G. Loerincs, and H. Geffner. A robust and fast action selection mechanism for planning. In AAAI, 1997.
    • (1997) AAAI
    • Bonet, B.1    Loerincs, G.2    Geffner, H.3
  • 3
    • 33749015487 scopus 로고    scopus 로고
    • Temporal planning using subgoal partitioning and resolution in SGPlan
    • to appear
    • Y. Chen, C. Hsu, and B. Wah. Temporal planning using subgoal partitioning and resolution in SGPlan. JAIR, to appear, 2006.
    • (2006) JAIR
    • Chen, Y.1    Hsu, C.2    Wah, B.3
  • 5
    • 9444221185 scopus 로고    scopus 로고
    • Taming numbers and durations in the model checking integrated planning system
    • S. Edelkamp. Taming numbers and duration in the model checking integrated planning system. JAIR, 20:195-238, 2003. (Pubitemid 41530526)
    • (2003) Journal of Artificial Intelligence Research , vol.20 , pp. 195-238
    • Edelkamp, S.1
  • 6
    • 27444434099 scopus 로고    scopus 로고
    • PDDL2.1: An extension to PDDL for expressing temporal planning domains
    • M. Fox and D. Long. PDDL2.1: An extension to PDDL for expressing temporal planning domains. JAIR, 20:61-124, 2003. (Pubitemid 41530519)
    • (2003) Journal of Artificial Intelligence Research , vol.20 , pp. 61-124
    • Fox, M.1    Long, D.2
  • 7
    • 85017389684 scopus 로고    scopus 로고
    • An investigation into the expressive power of PDDL2.1
    • M. Fox, D. Long, and K. Halsey. An investigation into the expressive power of PDDL2.1. In ECAI, pages 328-342, 2004.
    • (2004) ECAI , pp. 328-342
    • Fox, M.1    Long, D.2    Halsey, K.3
  • 8
    • 85164908935 scopus 로고    scopus 로고
    • LPG: A planner based on local search for planning graphs
    • A. Gerevini and I. Serina. LPG: A planner based on local search for planning graphs. In AIPS, 2002.
    • (2002) AIPS
    • Gerevini, A.1    Serina, I.2
  • 10
    • 0003264788 scopus 로고    scopus 로고
    • Heuristic planning with time and resources
    • P. Haslum and H. Geffner. Heuristic planning with time and resources. In ECP, 2001.
    • (2001) ECP
    • Haslum, P.1    Geffner, H.2
  • 11
    • 33744475106 scopus 로고    scopus 로고
    • a* in the 2004 planning competition
    • a* in the 2004 planning competition. JAIR, 25:233-267, 2006.
    • (2006) JAIR , vol.25 , pp. 233-267
    • Haslum, P.1
  • 12
    • 13444260042 scopus 로고    scopus 로고
    • A planning heuristic based on causal graph analysis
    • M. Helmert. A planning heuristic based on causal graph analysis. In ICAPS, pages 161-170, 2004.
    • (2004) ICAPS , pp. 161-170
    • Helmert, M.1
  • 13
    • 0036377352 scopus 로고    scopus 로고
    • The FF planning system: Fast plan generation through heuristic search
    • J. Hoffmann and B. Nebel. The FF planning system: Fast plan generation through heuristic search. JAIR, 14:253-302, 2001.
    • (2001) JAIR , vol.14 , pp. 253-302
    • Hoffmann, J.1    Nebel, B.2
  • 14
    • 0002818007 scopus 로고    scopus 로고
    • Extending TALplanner with concurrency and resources
    • J. Kvarnström, P. Doherty, and P. Haslum. Extending TALplanner with concurrency and resources. In ECAI, 2000.
    • (2000) ECAI
    • Kvarnström, J.1    Doherty, P.2    Haslum, P.3
  • 15
    • 9444281820 scopus 로고    scopus 로고
    • Exploiting a graphplan framework in temporal planning
    • D. Long and M. Fox. Exploiting a graphplan framework in temporal planning. In ICAPS, pages 51-62, 2003.
    • (2003) ICAPS , pp. 51-62
    • Long, D.1    Fox, M.2
  • 16
    • 44449135985 scopus 로고    scopus 로고
    • Probabilistic temporal planning with uncertain durations
    • Mausam and D. S. Weld. Probabilistic temporal planning with uncertain durations. In AAAI, 2006.
    • (2006) AAAI
    • Mausam1    Weld, D.S.2
  • 17
    • 14344285181 scopus 로고    scopus 로고
    • On the compilability and expressive power of propositional planning formalisms
    • B. Nebel. On the compilability and expressive power of propositional planning formalisms. JAIR, 12:271-315, 2000.
    • (2000) JAIR , vol.12 , pp. 271-315
    • Nebel, B.1
  • 18
    • 0036468047 scopus 로고    scopus 로고
    • Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search
    • DOI 10.1016/S0004-3702(01)00158-8, PII S0004370201001588
    • X. Nguyen, S. Kambhampati, and R. Nigenda. Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search. AIJ, 135:73-123, 2001. (Pubitemid 34110155)
    • (2002) Artificial Intelligence , vol.135 , Issue.1-2 , pp. 73-123
    • Nguyen, X.1    Kambhampati, S.2    Nigenda, R.S.3
  • 19
    • 58349103689 scopus 로고
    • Temporal planning with continuous change
    • S. Penberthy and D. Weld. Temporal planning with continuous change. In AAAI, 1994.
    • (1994) AAAI
    • Penberthy, S.1    Weld, D.2
  • 20
    • 84880691938 scopus 로고    scopus 로고
    • Temporal planning with mutual exclusion reasoning
    • D. E. Smith and D. Weld. Temporal planning with mutual exclusion reasoning. In IJCAI, 1999.
    • (1999) IJCAI
    • Smith, D.E.1    Weld, D.2
  • 21
    • 27444444626 scopus 로고    scopus 로고
    • The case for durative actions: A commentary on PDDL2.1
    • D. E. Smith. The case for durative actions: A commentary on PDDL2.1. JAIR, 20:149-154, 2003.
    • (2003) JAIR , vol.20 , pp. 149-154
    • Smith, D.E.1
  • 22
    • 84855778941 scopus 로고    scopus 로고
    • CPT: An optimal temporal POCL planner based on constraint programming
    • V. Vidal and H. Geffner. CPT: An optimal temporal POCL planner based on constraint programming. In IPC (ICAPS), 2004.
    • (2004) IPC (ICAPS)
    • Vidal, V.1    Geffner, H.2
  • 23
    • 84990575188 scopus 로고
    • Formalizing planning knowledge for hierarchical planning
    • Q. Yang. Formalizing planning knowledge for hierarchical planning. Computational Intelligence, 6:12-24, 1990.
    • (1990) Computational Intelligence , vol.6 , pp. 12-24
    • Yang, Q.1


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