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

On Comparing Planning Domain Models

Shoeeb , S and McCluskey, T.L. (2011) On Comparing Planning Domain Models. In: The 29th Workshop of the UK Planning and Scheduling Special Interest Group PlanSIG 2011, 8-9 Dec 2011, University of Huddersfield, UK.

[img]
Preview
PDF
Download (127kB) | Preview

    Abstract

    Whereas research into the characteristics and properties of AI planning algorithms is overwhelming, a similar science of domain model comparison and analysis is underdeveloped. It has long been acknowledged that there can be a range of di�erent encodings for the same domain, whatever coding language used, but the question of which is the \best" encoding is an open one, and partly dependent on the requirements of the planning application itself. There is a growing need to measure and compare domain models, however, in particular to evaluate learning methods. In this paper we motivate the research by considering the challenges in evaluating domain model learning algorithms. We describe an
    ongoing doctoral research project which is exploring model classifications for comparing domain models.

    Item Type: Conference or Workshop Item (Paper)
    Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
    Q Science > QA Mathematics > QA76 Computer software
    Schools: School of Computing and Engineering
    School of Computing and Engineering > Informatics Research Group > Knowledge Engineering and Intelligent Interfaces
    School of Computing and Engineering > Pedagogical Research Group
    Related URLs:
    Depositing User: Salihin Shoeeb
    Date Deposited: 16 Feb 2012 15:15
    Last Modified: 23 Dec 2013 14:14
    URI: http://eprints.hud.ac.uk/id/eprint/12717

    Document Downloads

    Downloader Countries

    More statistics for this item...

    Item control for Repository Staff only:

    View Item

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