Comparison of Various Heuristic Search Techniques for Finding Shortest Path
نویسندگان
چکیده
منابع مشابه
Heuristic Search for Generalized Stochastic Shortest Path MDPs
Research in efficient methods for solving infinite-horizon MDPs has so far concentrated primarily on discounted MDPs and the more general stochastic shortest path problems (SSPs). These are MDPs with 1) an optimal value function V ∗ that is the unique solution of Bellman equation and 2) optimal policies that are the greedy policies w.r.t. V ∗. This paper’s main contribution is the description o...
متن کاملTwo optimal algorithms for finding bi-directional shortest path design problem in a block layout
In this paper, Shortest Path Design Problem (SPDP) in which the path is incident to all cells is considered. The bi-directional path is one of the known types of configuration of networks for Automated Guided Vehi-cles (AGV).To solve this problem, two algorithms are developed. For each algorithm an Integer Linear Pro-gramming (ILP) is determined. The objective functions of both algorithms are t...
متن کاملHeuristic Search Viewed as Path Finding in a Graph
This paper presents a particular model of heuristic search as a path-finding problem in a directed graph. A class of graph-searching procedures is described which uses a heuristic function to guide search. Heuristic functions are estimates of the number o f edges that remain to be traversed in reaching a goal node. A number of theoretical results for this model, and the intuition for these resu...
متن کاملHeuristic estimates in shortest path algorithms
Shortest path problems occupy an important position in Operations Research as well as in Artificial Intelligence. In this paper we study shortest path algorithms that exploit heuristic estimates. The well-known algorithms are put into one framework. Besides we present an interesting application of binary numbers in the shortest path theory.
متن کاملK⁎: A heuristic search algorithm for finding the k shortest paths
We present a directed search algorithm, called K∗, for finding the k shortest paths between a designated pair of vertices in a given directed weighted graph. K∗ has two advantages compared to current k-shortest-paths algorithms. First, K∗ operates on-the-fly, which means that it does not require the graph to be explicitly available and stored in main memory. Portions of the graph will be genera...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Artificial Intelligence & Applications
سال: 2014
ISSN: 0976-2191,0975-900X
DOI: 10.5121/ijaia.2014.5405