1 code implementation • 1 Apr 2022 • David Speck
In this thesis, we propose to use symbolic search for cost-optimal planning for different expressive extensions of classical planning, all capturing different aspects of the problem.
1 code implementation • 15 Jun 2020 • David Speck, André Biedenkapp, Frank Hutter, Robert Mattmüller, Marius Lindauer
We show that dynamic algorithm configuration can be used for dynamic heuristic selection which takes into account the internal search dynamics of a planning system.
no code implementations • 11 Dec 2019 • Benjamin Kolb, Leon Lang, Henning Bartsch, Arwin Gansekoele, Raymond Koopmanschap, Leonardo Romor, David Speck, Mathijs Mul, Elia Bruni
Previous research into agent communication has shown that a pre-trained guide can speed up the learning process of an imitation learning agent.
no code implementations • WS 2019 • Benjamin Kolb, Leon Lang, Henning Bartsch, Arwin Gansekoele, Raymond Koopmanschap, Leonardo Romor, David Speck, Mathijs Mul, Elia Bruni
Previous research into agent communication has shown that a pre-trained guide can speed up the learning process of an imitation learning agent.