CAMPS: a constraint-based architecture for multiagent planning and scheduling

被引：0
|
作者：
ETL , Ibaraki, Japan [1 ]
机构：
来源：
J Intell Manuf | / 2卷 / 147-154期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [31] Numeric state variables in constraint-based planning
    Rintanen, J
    Jungholt, H
    RECENT ADVANCES IN AI PLANNING, 2000, 1809 : 109 - 121
  • [32] A constraint-based approach to camera path planning
    Christie, M
    Languénou, E
    SMART GRAPHICS, PROCEEDINGS, 2003, 2733 : 172 - 181
  • [33] Constraint-based round robin tournament planning
    Henz, M
    LOGIC PROGRAMMING: PROCEEDINGS OF THE 1999 INTERNATIONAL CONFERENCE ON LOGIC PROGRAMMING, 1999, : 545 - 557
  • [34] Constraint-based partial-order planning
    IEEE Intelligent Systems and Their Applications, 2001, 16 (01):
  • [35] Constraint-Based Design in Participatory Housing Planning
    Donath, Dirk
    Gonzalez Boehme, Luis Felipe
    INTERNATIONAL JOURNAL OF ARCHITECTURAL COMPUTING, 2008, 6 (01) : 97 - 117
  • [36] A CONSTRAINT-BASED PERSPECTIVE IN RESOURCE CONSTRAINED PROJECT SCHEDULING
    ULUSOY, G
    OZDAMAR, L
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1994, 32 (03) : 693 - 705
  • [37] On supporting Lean methodologies using constraint-based scheduling
    van der Krogt, Roman
    Geraghty, John
    Salman, Mustafa Ramzi
    Little, James
    JOURNAL OF SCHEDULING, 2010, 13 (04) : 301 - 314
  • [38] Embedded System Verification Through Constraint-Based Scheduling
    El-Mahi, Olfat
    Pesant, Gilles
    Nicolescu, Gabriela
    Beltrame, Giovanni
    RAPID SYSTEM PROTOTYPING: SHORTENING THE PATH FROM SPECIFICATION TO PROTOTYPE (RSP 2013), 2013, : 73 - 79
  • [39] Constraint-based proactive scheduling for MPTCP in wireless networks
    Oh, Bong-Hwan
    Lee, Jaiyong
    COMPUTER NETWORKS, 2015, 91 : 548 - 563
  • [40] A CONSTRAINT-BASED SCHEDULING MODEL FOR OPTIMAL TRAIN DISPATCHING
    Rodriguez, Joaquin
    Marliere, Gregory
    Sobieraj, Sonia
    PROCEEDINGS OF THE ASME JOINT RAIL CONFERENCE, VOL 2, 2010, : 399 - 406
12345