By Topic

A best-first search algorithm guided by a set-valued heuristic

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)
Lark, J.W. ; Dept. of Syst. Eng., Virginia Univ., Charlottesville, VA, USA ; White, C.C., III ; Syverson, K.

Presents an algorithm, called AG, for finding the least-cost path from start node to goal node set in an OR-graph, where arc costs are scalar-valued and the cost of each path is the sum of the concomitant arc costs. Search is guided by a set, H, of real-valued functions on the node set. Such a heuristic set can be a useful representation of knowledge acquired from human knowledge sources. If H={h: l⩽h} for given function l, then AG essentially becomes A*. If H is bounded, then successors of the newly expanded node may not be placed on OPEN, the set of all generated nodes that are candidates for expansion. The authors address issues of termination, completeness, admissibility, and heuristic comparison. The authors then consider a less ambitious, and less numerically taxing, objective: find the first arc of a least-cost path from start node to goal node set. This objective is achieved by the algorithm 1AG, a modification of AG

Published in:

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