메뉴 건너뛰기




Volumn , Issue , 2011, Pages 186-193

Visual programming of plan dynamics using constraints and landmarks

Author keywords

[No Author keywords available]

Indexed keywords

INTERACTIVE ENTERTAINMENT; NEW MEDIA; PLANNING TECHNIQUES; SHAKESPEARE; TRADITIONAL PLANNING; VISUAL PROGRAMMING; VISUAL REPRESENTATIONS;

EID: 80054835285     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (19)

References (23)
  • 4
    • 0023381915 scopus 로고
    • Planning for conjunctive goals
    • Chapman, D. 1987. Planning for conjunctive goals. Artificial Intelligence 32:333-377.
    • (1987) Artificial Intelligence , vol.32 , pp. 333-377
    • Chapman, D.1
  • 5
    • 33749015487 scopus 로고    scopus 로고
    • Temporal planning using subgoal partitioning and resolution in SGPlan
    • Chen, Y.; Wah, B.; and Hsu, C. 2006. Temporal Planning using Subgoal Partitioning and Resolution in SGPlan. Journal of Artificial Intelligence Research (JAIR) 26:323-369. (Pubitemid 44452214)
    • (2006) Journal of Artificial Intelligence Research , vol.26 , pp. 323-369
    • Chen, Y.1    Wah, B.W.2    Hsu, C.-W.3
  • 8
  • 12
    • 13444301819 scopus 로고    scopus 로고
    • The metric-FF planning system: Translating 'ignoring delete lists' to numeric state variables
    • Hoffmann, J. 2003. The Metric-FF Planning System: Translating "Ignoring Delete Lists" to Numeric State Variables. Journal of Artificial Intelligence Research 20:291-341. (Pubitemid 41530528)
    • (2003) Journal of Artificial Intelligence Research , vol.20 , pp. 291-341
    • Hoffmann, J.1
  • 14
    • 0036648705 scopus 로고    scopus 로고
    • A Behavior Language for Story-Based Believable Agents
    • Mateas, M., and Stern, A. 2002. A Behavior Language for Story-Based Believable Agents. IEEE Intelligent Systems 17:39-47.
    • (2002) IEEE Intelligent Systems , vol.17 , pp. 39-47
    • Mateas, M.1    Stern, A.2
  • 19
    • 33745626833 scopus 로고    scopus 로고
    • Robust contour matching via the order-preserving assignment problem
    • DOI 10.1109/TIP.2006.877038
    • Scott, C., and Nowak, R. 2006. Robust Contour Matching Via the Order-Preserving Assignment Problem. IEEE Transactions on Image Processing 15(7): 1831-1838. (Pubitemid 43985064)
    • (2006) IEEE Transactions on Image Processing , vol.15 , Issue.7 , pp. 1831-1838
    • Scott, C.1    Nowak, R.2


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