By Topic

A heuristic search approach for solving a minimum path problem requiring arc cost determination

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

2 Author(s)
Ching-Fang Liaw ; Dept. of Ind. Eng., Chaoyang Inst. of Technol., Taichung, Taiwan ; White, C.C., III

Two generalizations of A*, BA* and DA*, are presented and analyzed. Both consider the problem of finding a minimum cost path from the start node to a finite goal node set in a directed OR-graph, assuming that estimates of the optimal costs from each node to the goal node set are given (as described by the heuristic function), estimates of all arc costs are given, but the actual arc costs require determination. DA* tends to determine a solution (not necessarily optimal) more rapidly than BA*. Improved admissible heuristics and arc cost estimates tend to reduce node expansions and arc cost determination steps for BA*; however, these results do not necessarily hold for DA*. We also show that BA* tends to require more arc cost determination steps and fewer node expansions than does DA*

Published in:

Systems, Man and Cybernetics, Part A: Systems and Humans, IEEE Transactions on  (Volume:26 ,  Issue: 5 )