The Effects of Heuristic Optimisations on Planning Algorithms Within Cooperative AI
Cooperative Planning in Overcooked
J.H.J. Herben (TU Delft - Electrical Engineering, Mathematics and Computer Science)
Robert Loftin – Mentor (TU Delft - Interactive Intelligence)
Frans Oliehoek – Mentor (TU Delft - Interactive Intelligence)
K Hildebrandt – Graduation committee member (TU Delft - Computer Graphics and Visualisation)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
Cooperative AI is AI designed to cooperate with humans. One example of such an AI, made using planning algorithms, was studied in a paper from 2019 which used a simplified version of the video game Overcooked for evaluation. However, only limited evaluations were possible due to the long runtime and heuristic optimisations made. This paper will attempt to increase the amount of evaluations while removing an important optimisation limiting the functionality of the AI: the omission of counters. In the end it will find ways of reducing the runtime and increasing performance, which together allow for the addition of counters in a few instances. The final results with counters suggest there is more to gain upon removal of a select few heuristic optimisations and improvement of the human behavioural clone used to simulate a human.