메뉴 건너뛰기




Volumn , Issue , 2007, Pages 1924-1929

Constraint partitioning for solving planning problems with trajectory constraints and goal preferences

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT PARTITIONING; GLOBAL CONSTRAINTS; INTERNATIONAL PLANNING COMPETITIONS; LOWER COMPLEXITY; MULTI-VALUED; PLANNING PROBLEM; SOLUTION SPACE; TRAJECTORY CONSTRAINTS;

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

References (13)
  • 2
    • 33749015487 scopus 로고    scopus 로고
    • Temporal planning using subgoal partitioning and resolution in SGPlan
    • Y. X. Chen, B.W. Wah, and C. W. Hsu. Temporal planning using subgoal partitioning and resolution in SGPlan. J. of Artificial Intelligence Research, 26:323-369, August 2006. (Pubitemid 44452214)
    • (2006) Journal of Artificial Intelligence Research , vol.26 , pp. 323-369
    • Chen, Y.1    Wah, B.W.2    Hsu, C.-W.3
  • 4
    • 33746069015 scopus 로고    scopus 로고
    • On the compilation of plan constraints and preferences
    • S. Edelkamp. On the compilation of plan constraints and preferences. In ICAPS, pages 374-377, 2006.
    • (2006) ICAPS , pp. 374-377
    • Edelkamp, S.1
  • 5
    • 33750728214 scopus 로고    scopus 로고
    • Technical report, R.T. 2005-08-07, Dept. of Electronics for Automation, U. of Brescia, Brescia, Italy, August
    • A. Gerevini and D. Long. Plan constraints and preferences for PDDL3. Technical report, R.T. 2005-08-07, Dept. of Electronics for Automation, U. of Brescia, Brescia, Italy, August 2005.
    • (2005) Plan Constraints and Preferences for PDDL3
    • Gerevini, A.1    Long, D.2
  • 7
    • 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
  • 8
    • 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. J. of Artificial Intelligence Research, 14:253-302, 2001.
    • (2001) J. of Artificial Intelligence Research , vol.14 , pp. 253-302
    • Hoffmann, J.1    Nebel, B.2
  • 10
    • 13444301819 scopus 로고    scopus 로고
    • The metric-FF planning system: Translating ignoring delete lists to numeric state variables
    • J. Hoffmann. The Metric-FF planning system: Translating ignoring delete lists to numeric state variables. J. of Artificial Intelligence Research, 20:291-341, 2003. (Pubitemid 41530528)
    • (2003) Journal of Artificial Intelligence Research , vol.20 , pp. 291-341
    • Hoffmann, J.1
  • 12
    • 84890292517 scopus 로고    scopus 로고
    • Reviving integer programming approaches for AI planning: A branch-and-cut framework
    • M. van den Briel, T. Vossen, and S. Kambhampati. Reviving integer programming approaches for AI planning: A branch-and-cut framework. In ICAPS, pages 310-319, 2005.
    • (2005) ICAPS , pp. 310-319
    • Van Den Briel, M.1    Vossen, T.2    Kambhampati, S.3
  • 13
    • 31144437356 scopus 로고    scopus 로고
    • Constraint partitioning in penalty formulations for solving temporal planning problems
    • DOI 10.1016/j.artint.2005.07.001, PII S0004370205001128
    • B. Wah and Y. X. Chen. Constraint partitioning in penalty formulations for solving temporal planning problems. Artificial Intelligence, 170(3):187-231, 2006. (Pubitemid 43134174)
    • (2006) Artificial Intelligence , vol.170 , Issue.3 , pp. 187-231
    • Wah, B.W.1    Chen, Y.2


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