Abstraction through clustering: complexity reduction in automated planning domains
by Luke Dicken; Peter Gregory; John Levine
International Journal of Data Mining, Modelling and Management (IJDMMM), Vol. 4, No. 2, 2012

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.

Online publication date: Sat, 23-Aug-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Data Mining, Modelling and Management (IJDMMM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com