Abstraction through clustering : complexity reduction in automated planning domains
Dicken, L. and Gregory, P. and Levine, J. (2012) Abstraction through clustering : complexity reduction in automated planning domains. International Journal of Data Mining, Modelling and Management, 4 (2). 123 - 137.
Full text not available in this repository.Request a copy from the Strathclyde authorAbstract
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.
| Creators(s): |
Dicken, L., Gregory, P. and Levine, J.  ORCID: https://orcid.org/0000-0001-7016-2978;
| Item type: | Article |
|---|---|
| ID code: | 42531 |
| Keywords: | clustering, automated planning, complexity reduction, planning domains, artificial intelligence, data modelling, data mining , Electronic information resources, Management Information Systems, Modelling and Simulation, Computer Science Applications |
| Subjects: | Bibliography. Library Science. Information Resources > Information resources > Electronic information resources |
| Department: | Faculty of Science > Computer and Information Sciences |
| Depositing user: | Pure Administrator |
| Date deposited: | 11 Jan 2013 15:20 |
| Last modified: | 08 Sep 2020 02:42 |
| Related URLs: | |
| URI: | https://strathprints.strath.ac.uk/id/eprint/42531 |
| Export data: |
CORE (COnnecting REpositories)
CORE (COnnecting REpositories)