Evolutionary-based learning of generalised policies for AI planning domains

Galea, M. and Humphreys, D. and Levine, J. and Westerberg, H.; (2009) Evolutionary-based learning of generalised policies for AI planning domains. In: Proceedings of the 11th Annual conference on Genetic and evolutionary computation (GECCO '09). ACM, New York, pp. 1195-1202. ISBN 978-1-60558-325-9 (https://doi.org/10.1145/1569901.1570062)

Full text not available in this repository.Request a copy

Abstract

This work investigates the application of Evolutionary Computation (EC) to the induction of generalised policies used to solve AI planning problems. A policy is defined as an ordered list of rules that specifies which action to perform under which conditions; a solution (plan) to a planning problem is a sequence of actions suggested by the policy. We compare an evolved policy with one produced by a state-of-the-art approximate policy iteration approach. We discuss the relative merits of the two approaches with a focus on the impact of the knowledge representation and the learning strategy. In particular we note that a strategy commonly and successfully used for the induction of classification rules, that of Iterative Rule Learning, is not necessarily an optimal strategy for the induction of generalised policies aimed at minimising the number of actions in a plan.

ORCID iDs

Galea, M., Humphreys, D., Levine, J. ORCID logoORCID: https://orcid.org/0000-0001-7016-2978 and Westerberg, H.;
CORE (COnnecting REpositories)