Search:
Computing and Library Services - delivering an inspiring information environment

Revisiting Inner Entanglements in Classical Planning

Chrpa, Lukáš and Vallati, Mauro (2013) Revisiting Inner Entanglements in Classical Planning. In: Scandinavian Conference on Artificial Intelligence, 20-22 November 2013, Aalborg, Denmark. (Unpublished)

[img] PDF - Accepted Version
Download (154kB)

Abstract

In Automated Planning, learning and exploiting structural patterns of plans, domain models and/or problem models, in order to improve plan generation speed-up and increase the scope of problems solved, has attracted much research. Reformulation techniques such as those based on macro-operators or entanglements are very promising, mainly because they are planner independent. This paper aims to extend and revisit the recent work on inner entanglements, relations between pairs of planning operators and predicates encapsulating exclusivity of predicate ‘achievements‘ or ‘requirements’, in order to bring new theoretical results (PSPACE completeness of deciding inner entanglements), present a new way of encoding of inner entanglements and empirical comparison between different kinds of inner entanglements.

Item Type: Conference or Workshop Item (Paper)
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Schools: School of Computing and Engineering
School of Computing and Engineering > High-Performance Intelligent Computing > Planning, Autonomy and Representation of Knowledge
School of Computing and Engineering > High-Performance Intelligent Computing > Planning, Autonomy and Representation of Knowledge
Related URLs:
Depositing User: Lukas Chrpa
Date Deposited: 11 Oct 2013 10:46
Last Modified: 05 Dec 2016 16:39
URI: http://eprints.hud.ac.uk/id/eprint/18317

Downloads

Downloads per month over past year

Repository Staff Only: item control page

View Item View Item

University of Huddersfield, Queensgate, Huddersfield, HD1 3DH Copyright and Disclaimer All rights reserved ©