A Bilinear programming approach for multiagent planning

被引:0
|
作者
Petrik, Marek [1 ]
Zilberstein, Shlomo [1 ]
机构
[1] Department of Computer Science, University of Massachusetts, Amherst, MA 01003, United States
关键词
Multi agent systems;
D O I
暂无
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Journal article (JA)
引用
收藏
页码:235 / 274
相关论文
共 50 条
  • [1] A Bilinear Programming Approach for Multiagent Planning
    Petrik, Marek
    Zilberstein, Shlomo
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2009, 35 : 235 - 274
  • [2] Logic Programming for Multiagent Planning with Negotiation
    Son, Tran Cao
    Pontelli, Enrico
    Sakama, Chiaki
    LOGIC PROGRAMMING, 2009, 5649 : 99 - +
  • [3] Bilinear Programming Approach to Solve Interval Bimatrix Games in Tourism Planning Management
    Fei, Wei
    Li, Deng-Feng
    INTERNATIONAL JOURNAL OF FUZZY SYSTEMS, 2016, 18 (03) : 504 - 510
  • [4] Bilinear Programming Approach to Solve Interval Bimatrix Games in Tourism Planning Management
    Wei Fei
    Deng-Feng Li
    International Journal of Fuzzy Systems, 2016, 18 : 504 - 510
  • [5] An integer linear programming approach for bilinear integer programming
    Freire, Alexandre S.
    Moreno, Eduardo
    Vielma, Juan Pablo
    OPERATIONS RESEARCH LETTERS, 2012, 40 (02) : 74 - 77
  • [6] Reactive motion planning: a multiagent approach
    Odense Univ, Denmark
    Appl Artif Intell, 1 (35-51):
  • [7] MultiAgent planning:: A resource based approach
    Pérez, JJP
    MICAI 2000: ADVANCES IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2000, 1793 : 649 - 660
  • [8] Reactive motion planning: A multiagent approach
    Overgaard, L
    Petersen, HG
    Perram, JW
    APPLIED ARTIFICIAL INTELLIGENCE, 1996, 10 (01) : 35 - 51
  • [9] A Single-Agent Approach to Multiagent Planning
    Crosby, Matthew
    Jonsson, Anders
    Rovatsos, Michael
    21ST EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE (ECAI 2014), 2014, 263 : 237 - +
  • [10] A LINEAR-PROGRAMMING APPROACH TO SOLVING BILINEAR PROGRAMS
    WHITE, DJ
    MATHEMATICAL PROGRAMMING, 1992, 56 (01) : 45 - 50