Table of Contents
ISRN Artificial Intelligence
Volume 2012, Article ID 714245, 9 pages
Research Article

Planning for Multiple Preferences versus Planning with No Preference

Department of Computer Science, Utah State University, 4205 Old Main Hill, Logan, UT 84322, USA

Received 26 July 2011; Accepted 27 August 2011

Academic Editors: P. Brezillon, K. W. Chau, and L. Utkin

Copyright © 2012 Daniel Bryce. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


Many planning applications must address conflicting plan objectives, such as cost, duration, and resource consumption, and decision makers want to know the possible tradeoffs. Traditionally, such problems are solved by invoking a single-objective algorithm (such as A*) on multiple, alternative preferences of the objectives to identify nondominated plans. The less-popular alternative is to delay such reasoning and directly optimize multiple plan objectives with a search algorithm like multiobjective A* (MOA*). The relative performance of these two approaches hinges upon the number of 𝑓 -values computed for individual search nodes. A* may revisit a node several times and compute a different 𝑓 -value each time. MOA* visits each node once and may compute some number of 𝑓 -values (each estimating the value of a different nondominated solution constructed from the node). While A* does not share 𝑓 -values between searches for different solutions, MOA* can sometimes find multiple solutions while computing a single 𝑓 -value per node. The results of extensive empirical comparison show that (i) the performance of multiple invocations of a single-objective A* versus a single invocation of MOA* is often worse in time and quality and (ii) that techniques for balancing per node cost and exploration are promising.