Increasing the Numeric Expressiveness of the Planning Domain Definition Language

Parkinson, Simon and Longstaff, Andrew P. (2012) Increasing the Numeric Expressiveness of the Planning Domain Definition Language. Proceedings of The 30th Workshop of the UK Planning and Scheduling Special Interest Group (PlanSIG2012).

PDF - Accepted Version Download (158kB)

Abstract

The technology of artificial intelligence (AI) planning is being adopted across many different disciplines. This has resulted in the wider use of the Planning Domain Definition Language (PDDL), where it is being used to model planning problems of different natures. One such area where AI planning is particularly attractive is engineering, where the optimisation problems are mathematically rich. The example used throughout this paper is the optimisation (minimisation) of machine tool measurement uncertainty. This planning problem highlights the limits of PDDL's numerical expressiveness in the absence of the square root function. A workaround method using the Babylonian algorithm is then evaluated before the extension of PDDL to include more mathematics functions is discussed.

Item Type:	Article
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Schools:	School of Computing and Engineering School of Computing and Engineering > Centre for Precision Technologies > Engineering Control and Machine Performance Research Group
Related URLs:	Author Conference
Depositing User:	Simon Parkinson
Date Deposited:	18 Dec 2012 11:23
Last Modified:	01 Dec 2016 09:35
URI:	http://eprints.hud.ac.uk/id/eprint/16366

Downloads

Repository Staff Only: item control page

View Item