By Topic

An abstract method for extracting goal orderings

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
$33 $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

2 Author(s)
Li Ying ; Inst. of Comput. Technol., Chinese Acad. of Sci., Beijing, China ; Jin Zhi

Extracting and using goal orderings is a way to improve efficiencies of planning algorithms. During extracting goal orderings, some of existing methods can only deal with atomic goals of a specific problem that will introduce too much redundant work, and the others deal with predicates of a planning domain that can not extract enough goal orderings. The paper addressed an abstract method to extract goal orderings. The method used unification to identify different instantiations of a predicate when dealing with predicates. It can not only reduce redundant work during extracting, but also get enough goal orderings.

Published in:

Intelligent Control and Automation, 2004. WCICA 2004. Fifth World Congress on  (Volume:6 )

Date of Conference:

15-19 June 2004