Uni-Logo

Tim Schulte – Publikationen

(Alle Abstracts einblenden) (Alle Abstracts ausblenden)

2019

  • Tim Schulte und Bernhard Nebel.
    Trial-based Heuristic Tree-search for Distributed Multi-Agent Planning.
    In Proceedings of the Twelth Annual Symposium on Combinatorial Search (SoCS 2019). 2019.

2018

  • Tim Schulte.
    Stubborn Sets Pruning for Privacy Preserving Planning.
    In Proceedings of the Eleventh Annual Symposium on Combinatorial Search (SoCS 2018) (SoCS 2018). 2018.
    (Abstract einblenden) (PDF)

  • Tim Schulte.
    Stubborn Sets Pruning for Privacy Preserving Planning.
    In Proceedings of the 5th Workshop on Distributed and Multi-Agent Planning (DMAP 2018) (DMAP 2018). 2018.
    (Abstract einblenden) (PDF)

2016

  • Tim Schulte und Bernhard Nebel.
    Trial-based Heuristic Tree-search for Distributed Multi-Agent Planning.
    In Proceedings of the Ninth Annual Symposium on Combinatorial Search (SoCS 2016) (SoCS 2016). 2016.
    (Abstract einblenden) (PDF)

  • Tim Schulte und Bernhard Nebel.
    Trial-based Heuristic Tree-search for Distributed Multi-Agent Planning.
    In Proceedings of the 4th Workshop on Distributed and Multi-Agent Planning (DMAP 2016) (DMAP 2016). 2016.
    (Abstract einblenden) (PDF)

2014

  • Tim Schulte und Thomas Keller.
    Balancing Exploration and Exploitation in Classical Planning.
    In Proceedings of the Seventh Annual Symposium on Combinatorial Search (SoCS 2014) (SoCS 2014). 2014.
    (Abstract einblenden) (PDF) (BIB)