By Topic

Multiobjective heuristic search in AND/OR graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ching-Fang Liaw ; Chaoyang Inst. of Technol., Taichung, Taiwan ; Stewart, B.S. ; White, C.C., III

Develops and analyzes a heuristic search algorithm that determines the nondominated set of solution graphs for a multiobjective AND/OR graph. This algorithm, MOAO*, is a multiobjective generalization of AO*. MOAO* uses sets of vector-valued heuristic estimates to give guidance to the search. The authors show that MOAO* satisfies termination, completeness, and admissibility conditions, generalizing results associated with AO*. Further, the authors prove that if the heuristic sets satisfy a monotonicity condition, then MOAO* possesses an efficiency property reminiscent of a well-known result associated with A*

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:25 ,  Issue: 11 )