Complexity results for standard benchmark domains in planning
作者:
摘要
The efficiency of AI planning systems is usually evaluated empirically. For the validity of conclusions drawn from such empirical data, the problem set used for evaluation is of critical importance. In planning, this problem set usually, or at least often, consists of tasks from the various planning domains used in the first two international planning competitions, hosted at the 1998 and 2000 AIPS conferences. It is thus surprising that comparatively little is known about the properties of these benchmark domains, with the exception of Blocksworld, which has been studied extensively by several research groups.
论文关键词:Complexity of planning,Planning benchmarks,Planning domains,Transportation problems
论文评审过程:Received 22 February 2002, Available online 24 December 2002.
论文官网地址:https://doi.org/10.1016/S0004-3702(02)00364-8