初识A算法（The first A algorithm）.docVIP

初识A算法（The first A algorithm） Data worth having From the usual study, accumulation and summary Where there is a problem, there must be some Please also criticize and correct me! The first A* algorithm A* algorithm is a typical heuristic search algorithm in artificial intelligence To make it clear, the A* algorithm First explain what heuristic algorithms are First, what is heuristic search algorithm? In search of state space to pass it before The state space search is the process of finding the path from the initial state to the target state Popular point says Its when you solve a problem Finding a solution can begin with the solution to the problem There are many branches in the process of solving the problem The uncertainty of solving condition is mainly in the process of solving Incompleteness A lot of paths are solved, which makes up a graph This diagram is called state space The solution to the problem is to find a path in the diagram, from the beginning to the end The search process is a state space search The commonly used state space search has depth first and breadth first Breadth first is looking down from the initial layer to the next level Until you find your target Depth first is to look up a branch in a certain order Search for another branch So far as to find the target One of the big drawbacks to breadth and depth first search is that they are all exhausted in a given state space This is a very suitable algorithm in the case of little state space But when the state space is very large In the absence of prediction, it is inadvisable His efficiency is too low Not even complete Heuristic search is used here Heuristic search is the search in the state space to evaluate the location of each search Get the best seat Search from this location until you reach the target This allows you to omit a large number of intrepid search paths Efficiency is mentioned In heuristic search The evaluation of location is very important Different valuations can have different