Title: Abstraction through clustering: complexity reduction in automated planning domains

Authors: Luke Dicken; Peter Gregory; John Levine

Addresses: Department of Computer and Information Sciences, University of Strathclyde, Livingstone Tower, 26 Richmond Street, Glasgow, G1 1XH, Scotland, UK. ' Department of Computer and Information Sciences, University of Strathclyde, Livingstone Tower, 26 Richmond Street, Glasgow, G1 1XH, Scotland, UK. ' Department of Computer and Information Sciences, University of Strathclyde, Livingstone Tower, 26 Richmond Street, Glasgow, G1 1XH, Scotland, UK.

Abstract: Automated planning is a very active area of research within artificial intelligence. Broadly this discipline deals with the methods by which an agent can independently determine the sequence of actions required to successfully achieve a set of objectives. In this paper, we will present work outlining a new approach to planning based on clustering techniques, in order to group states of the world together and use the fundamental structure of the world to lift out more abstract representations. We will show that this approach can limit the combinatorial explosion of a typical planning problem in a way that is much more intuitive and reusable than has previously been possible, and outline ways that this approach can be developed further.

Keywords: clustering; automated planning; complexity reduction; domain abstraction; planning domains; artificial intelligence; AI; action sequences; objectives achievement; fundamental structures; abstract representations; combinatorial explosions; planning problems; intuitive approaches; reusable approaches; data mining; data modelling; data management; intelligent data analysis.

DOI: 10.1504/IJDMMM.2012.046806

International Journal of Data Mining, Modelling and Management, 2012 Vol.4 No.2, pp.123 - 137

Received: 08 May 2021
Accepted: 12 May 2021

Published online: 09 May 2012 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article