OBDDs in heuristic search

1998 ◽  
pp. 81-92 ◽  
Author(s):  
Stefan Edelkamp ◽  
Frank Reffel
Keyword(s):  
Heuristic Search

Best Neighbor Heuristic Search for Finding Minimum Paths in Transportation Networks

1998 ◽  
Vol 1651 (1) ◽  
pp. 48-52 ◽  
Author(s):  
Jeffrey L. Adler
Keyword(s):  
Heuristic Search ◽  
Transportation Networks ◽  
Transportation Network ◽  
Search Problems ◽  
A Algorithm ◽  
Running Time ◽  
Search Effort ◽  
Wide Range ◽  
Path Search ◽  
Sparse Networks

For a wide range of transportation network path search problems, the A* heuristic significantly reduces both search effort and running time when compared to basic label-setting algorithms. The motivation for this research was to determine if additional savings could be attained by further experimenting with refinements to the A* approach. We propose a best neighbor heuristic improvement to the A* algorithm that yields additional benefits by significantly reducing the search effort on sparse networks. The level of reduction in running time improves as the average outdegree of the network decreases and the number of paths sought increases.

Bidirectional heuristic search to find the optimal Bayesian network structure

2021 ◽  
Vol 426 ◽  
pp. 35-46
Author(s):  
Xiangyuan Tan ◽  
Xiaoguang Gao ◽  
Zidong Wang ◽  
Chuchao He
Keyword(s):  
Bayesian Network ◽  
Network Structure ◽  
Heuristic Search ◽  
Bayesian Network Structure
Sign in / Sign up

Export Citation Format

Share Document