ICAPS Rome 2013

Distributed and Multi-Agent Planning (DMAP)

DMAP-banner_1280x360-640x180

Multi-agent planning is a broad field with many applications, but its subfields remain mostly dispersed and uncoordinated. The main goal of the workshop is to bridge the gap between the planning and multi-agent systems communities, while focusing on formalizing models, algorithmic techniques and solution concepts.

Online Proceedings (dmap13-proceedings)

The DMAP workshop is scheduled on the 11th of June in the A4 room at the Department of Computer, Control and Management Engineering (DIAG), University of Rome “SAPIENZA”.

Schedule


Session 1

09:00-09:30

Raz Nissim and Ronen Brafman
Cost-Optimal Planning by Self-Interested Agents

09:30-10:00

 Aurélie Beynier and Sylvia Estivie
Optimizing distributed resource exchanges in multiagent systems under uncertainty

10:00-10:30

 Joris Scharpff, Matthijs T.J. Spaan, Leentje Volker and Mathijs de Weerdt
Coordinating Stochastic Multi-Agent Planning in a Private Values Setting

10:30-11:00

Coffee Break


Session 2

11:00-11:30

 Guy Shani, Ronen Brafman and Shlomo Zilberstein
Qualitative Planning under Partial Observability in Multi-Agent Domains

11:30-12:00

Gonzalo Milla-Millán, Juan Fdez-Olivares and Inmaculada Sánchez-Garzón
Multi-agent Planning based on the Dynamic Selection and Merging of Hierarchical Task Networks

12:00-12:20

Karel Durkota and Antonín Komenda
Deterministic Multiagent Planning Techniques: Experimental Comparison
(short paper)

12:30-14:30

Lunch Break


Session 3

14:30-15:00

Kartik Talamadupula, David Smith, William Cushing and Subbarao Kambhampati
A Theory of Intra-Agent Replanning

15:00-15:30

Daniel Borrajo
Plan Sharing for Multi-Agent Planning

15:30-16:00

Antonín Komenda, Peter Novák and Michal Pechoucek
How to Repair Multi-agent Plans: Experimental Approach

16:00-16:30

Coffee Break


Session 4

16:30-17:00

Michal Štolba and Antonín Komenda
Fast-Forward Heuristic for Multiagent Planning

17:00-17:30

Alejandro Torreño, Eva Onaindia and Óscar Sapena
FMAP: a Heuristic Approach to Cooperative Multi-Agent Planning

17:30-18:30

CLOSING REMARKS AND PANEL DISCUSSION

 

List of Accepted Papers

Workshop Proceedings (PDF)

  • Guy Shani, Ronen Brafman and Shlomo Zilberstein
    Qualitative Planning under Partial Observability in Multi-Agent Domains
  • Antonín Komenda, Peter Novák and Michal Pechoucek
    How to Repair Multi-agent Plans: Experimental Approach
  • Aurélie Beynier and Sylvia Estivie
    Optimizing distributed resource exchanges in multiagent systems under uncertainty
  • Raz Nissim and Ronen Brafman
    Cost-Optimal Planning by Self-Interested Agents
  • Alejandro Torreño, Eva Onaindia and Óscar Sapena
    FMAP: a Heuristic Approach to Cooperative Multi-Agent Planning
  • Daniel Borrajo
    Plan Sharing for Multi-Agent Planning
  • Karel Durkota and Antonín Komenda
    Deterministic Multiagent Planning Techniques: Experimental Comparison
  • Michal Štolba and Antonín Komenda
    Fast-Forward Heuristic for Multiagent Planning
  • Gonzalo Milla-Millán, Juan Fdez-Olivares and Inmaculada Sánchez-Garzón
    Multi-agent Planning based on the Dynamic Selection and Merging of Hierarchical Task Networks
  • Kartik Talamadupula, David Smith, William Cushing and Subbarao Kambhampati
    A Theory of Intra-Agent Replanning
  • Joris Scharpff, Matthijs T.J. Spaan, Leentje Volker and Mathijs de Weerdt
    Coordinating Stochastic Multi-Agent Planning in a Private Values Setting

 

Call for papers (download the CFP PDF TXT)

Topics and Objectives

The organizing committee of DMAP’13 invites paper submissions on topics related to distributed and multi-agent planning. Multiagent planning is a broad field with many applications, but its subfields remain mostly dispersed and uncoordinated. The main goal of the workshop is to bring researchers working in these subfields together and to bridge the gap between the planning and multi-agent systems communities. The focus of the workshop program is on:

  • Multiagent planning and scheduling applications
  • Techniques to overcome multiagent planning complexity
  • Plan coordination/merging
  • Distributed planning and scheduling
  • Multiagent planning system architectures
  • Self-interested planning agents
  • Game theoretic planning
  • Distributed planning under uncertainty
  • Privacy in distributed planning
  • Evaluation and benchmarks for distributed planning
  • Centralized, decentralized and factored multiagent planning
  • Multiagent planning problem modeling techniques and languages
  • Domain-dependent and domain-independent multiagent planning

Submissions

Paper submission is in PDF only, formatted in AAAI style (http://www.aaai.org/Publications/Author/author.php). Refer to the author instructions on the AAAI web site for detailed formatting instructions and LaTeX style files. Final papers will be in the same format, keep them to at most 8+1 pages long (meaning 8 pages plus 1 extra page containing only references). We also welcome the submission of short position papers (at most 4+1 pages long). Papers must be submitted by April 5th, 2013. All deadlines refer to 23:59 in the UTC-12 time zone. Paper submissions should be made through the workshop EasyChair web site: https://www.easychair.org/conferences/?conf=dmap2013

Deadlines

Submission deadline (extended): April 5th, 2013
Notification: April 19th, 2013
Final version: May 6th, 2013
Workshop: June 11, 2013

Workshop Program Chairs

Program committee

  • Bradley J. Clement – NASA Jet Propulsion Laboratory
  • Amanda Coles – King’s College London, UK
  • Andrew Coles – King’s College London, UK
  • Carmel Domshlak – Technion, Israel Institute of Technology
  • Naoki Fukuta – Shizuoka University, Japan
  • Antonin Komenda - Czech Technical University
  • Roman van der Krogt – University College Cork
  • Alejandro Torreno Lerma - Universidad Politecnica de Valencia
  • Scott Sanner – National ICT Australia (NICTA)
  • Matthijs Spaan – Delft University of Technology
  • Roni Stern - Harvard University
  • Mathijs de Weerdt – Delft University of Technology
  • Shlomo Zilberstein – University of Massachusetts, Amherst

 The workshop is organized in cooperation with COST Action IC1205 on Computational Social Choice.
Limited, dedicated travel funds will be available to students from participating countries.

 

 Back to workshops home page