Uni-Logo

Diese Seite ist nur auf Englisch verfügbar.

Seminar: Multi-Agent Planning - Topics

Please note that some of the linked PDF-files are only accessible within the university network.

Area A: Distributed Multi-Agent Planning

A1: Total Order Multi-Agent Planning (MAFS)

Supervisor: Prof. Dr. Felix Lindner (Juniorprof.)
Presentation: Milan Benninger
Short commentary: Dennis Raith

  • Brafman, Ronen I. A Privacy Preserving Algorithm for Multi-Agent Planning and Search. IJCAI 2015. (PDF)

A2: Multi-Agent Planning Complexity

Supervisor: Dr. Tim Schulte
Presentation: -
Short commentary: -

  • Brafman, Ronen I., and Carmel Domshlak. On the complexity of planning for agent teams and its implications for single agent planning. Artificial Intelligence 198 (2013): 52-71. (PDF)

A3: Partial-Order Multi-Agent Planning (FMAP)

Supervisor: Dr. Tim Schulte
Presentation: Daniel Bindemann
Short commentary: André Bajorat

  • Torreno, Alejandro, Eva Onaindia, and Oscar Sapena. FMAP: Distributed cooperative multi-agent planning. Applied Intelligence 41.2 (2014): 606-626. (PDF)

A4: Relaxation Heuristics for Multi-Agent Planning

Supervisor: Dr. Johannes Aldinger
Presentation: Alexander Heinz
Short commentary: Milan Benninger

  • Štolba, Michal, and Antonín Komenda. Relaxation Heuristics for Multiagent Planning." ICAPS 2014. (PDF)

A5: Potential Heuristics for Multi-Agent Planning

Supervisor: Dr. Robert Mattmüller
Presentation: André Bajorat
Short commentary: Jakob Stigler

  • Štolba, Michal, Daniel Fišer, and Antonın Komenda. Potential heuristics for multi-agent planning." ICAPS 2016. (PDF)

Area B: Multi-Agent Path Finding

B1: Cooperative Pathfinding

Supervisor: Dr. Florian Geißer
Presentation: Fabrizio Costea
Short commentary: Ilia Dobrusin

  • Silver, David. Cooperative Pathfinding. AIIDE 1 (2005): 117-122. (PDF)

B2: Pathfinding and Target Assignment

Supervisor: Dr. Florian Geißer
Presentation: Max Dippel
Short commentary: Michael Burkart

  • Ma, Hang, and Sven Koenig. Optimal target assignment and path finding for teams of agents. AAMAS 2016. (PDF)

B3: Complexity of MAPF

Supervisor: Prof. Dr. Bernhard Nebel
Presentation: -
Short commentary: -

  • Kornhauser, Daniel Martin, Gary L. Miller, and Paul G. Spirakis. Coordinating pebble motion on graphs, the diameter of permutation groups, and applications. MS thesis. M. I. T., Dept. of Electrical Engineering and Computer Science, 1984. (PDF)

B4: Complexity of optimal MAPF

Supervisor: Dr. Florian Geißer
Presentation: Rolf-David Bergdoll
Short commentary: Evgeny Anatskiy

  • Goldreich, Oded. Finding the shortest move-sequence in the graph-generalized 15-puzzle is NP-hard. Springer Berlin Heidelberg, 2011. (PDF)

B5: The Push and Swap / Push and Rotate Algorithm

Supervisor: Dr. Florian Geißer
Presentation: Jakob Stigler
Short commentary: Fabrizio Costea

  • de Wilde, Boris, Adriaan W. ter Mors, and Cees Witteveen. Push and rotate: cooperative multi-agent path planning. AAMAS, 2013. (PDF)

Area C: Probabilistic Planning

C1: Factored MDPs

Supervisor: Prof. Dr. Felix Lindner (Juniorprof.)
Presentation: -
Short commentary: -

  • Guestrin, Carlos, Shobha Venkataraman, and Daphne Koller. Context-specific multiagent coordination and planning with factored MDPs. AAAI 2002. (PDF)

C2: Decentralized POMDPs

Supervisor: Dr. Thorsten Engesser
Presentation: Michael Burkart
Short commentary: Max Dippel

  • Spaan, Matthijs TJ, Geoffrey J. Gordon, and Nikos Vlassis. Decentralized planning under uncertainty for teams of communicating agents. IJCAI 2006. (PDF)

C3: Interaction-driven Markov Games

Supervisor: Dr. Thorsten Engesser
Presentation: Ibrahim Alshibani
Short commentary: Daniel Bindemann

  • Spaan, Matthijs TJ, and Francisco S. Melo. Interaction-driven Markov games for decentralized multiagent planning under uncertainty. AAMAS 2008. (PDF)

Area D: Epistemic Planning

D1: Alternating Temporal Epistemic Logic

Supervisor: Dr. Robert Mattmüller
Presentation: Lars Sipos
Short commentary: Grigoris Mouratidis

  • Van Der Hoek, Wiebe, and Michael Wooldridge. Tractable multiagent planning for epistemic goals. AAMAS 2002. (PDF)

D2: Compilation into Classical Planning

Supervisor: Dr. Robert Mattmüller
Presentation: Grigoris Mouratidis
Short commentary: Fabian Meyer

  • Muise, Christian, et al. Planning Over Multi-Agent Epistemic States: A Classical Planning Approach (Amended Version). DMAP 2015. (PDF)

D3: Planning in DEL (Dynamic Epistemic Logic)

Supervisor: Prof. Dr. Felix Lindner (Juniorprof.)
Presentation: Fabian Meyer
Short commentary: Lars Sipos

  • Bolander, Thomas, and Mikkel Birkegaard Andersen. Epistemic planning for single-and multi-agent systems. Journal of Applied Non-Classical Logics 21.1 (2011): 9. (PDF)

Area E: Adversarial Planning

E1: Adversarial Planning Through Strategy Simulation

Supervisor: Dr. Johannes Aldinger
Presentation: Dennis Raith
Short commentary: Rolf-David Bergdoll

  • Sailer, Frantisek, Michael Buro, and Marc Lanctot. Adversarial planning through strategy simulation. CIG 2007. (PDF)

E2: Using FOND Planning for Multi-Agent Tasks

Supervisor: Dr. Tim Schulte
Presentation: -
Short commentary: -

  • Muise, Christian, et al. Planning for a single agent in a multi-agent environment using FOND. IJCAI 2016. (PDF)

E3: Multi-Agent Reinforcement Learning

Supervisor: Dr. Thorsten Engesser
Presentation: Ilia Dobrusin
Short commentary: Ibrahim Alshibani

  • Littman, Michael L. Markov games as a framework for multi-agent reinforcement learning. ICML 1994. (PDF)

Area F: Plan Recognition

F1: Action-Model Based Multi-agent Plan Recognition

Supervisor: Prof. Dr. Bernhard Nebel
Presentation: Evgeny Anatskiy
Short commentary: Alexander Heinz

  • Zhuo, Hankz H., Qiang Yang, and Subbarao Kambhampati. Action-model based multi-agent plan recognition. NIPS 2012. (PDF)