Search - Heuristic star

Search - Heuristic star - List

[AI-NN-PR] 8digitsA DL : 0: A星算法+强启发函数解八数码问题，自带判断是否有解-A Star Algorithm+ strong heuristic function solution of 8 digital issues, bring their own to determine whether the broken
Date : Size : 966kb User : 胡茂名
[Windows Develop] A-star DL : 0: A*算法，启发式路径搜索（星际，帝国等即时战略游戏中AI寻路）-A* algorithm, heuristic path search (Star, Imperial and other real-time strategy game AI pathfinding)
Date : Size : 394kb User : 赵鹏
[AI-NN-PR] AstarAlgorithm DL : 0: 基于启发式收索的A算法，A星算法的C++类的完整实现源代码-A collection of cable based on heuristic algorithms, A star algorithm in C++ source code for the complete implementation of class
Date : Size : 3kb User : wangzhenjun
[Other] Astar DL : 0: 利用A星算法解决迷宫问题，用到了耗散函数，即启发式的h-A star algorithm to solve the maze, use the dissipation function, that is, heuristic h
Date : Size : 1kb User : 张强
[Other] AStar DL : 0: A* A星算法，经典的启发式寻求最短路径的算法，启发函数采用最简单的曼哈顿法，从OPEN表中选出最小的f值的点采用堆排序，里面注释很多，谢谢，共同学习！-A* A Star algorithm, classical heuristic seeks the shortest path algorithm, heuristic function takes the simplest Manhattan method selected from the OPEN statement smallest f-value point using heap sort, which notes a lot, thank you, learn together!
Date : Size : 8kb User : 彭陶
[matlab] Astar-KO DL : 0: 区别于以往传统最短路算法，如：Dijkstra算法或者Floyd算法。该算法为启发式最短路径搜寻算法：A STAR-Finding the shortest path: a heuristic algorithm named A STAR
Date : Size : 18kb User : 覃文
[CSharp] AiiPn DL : 0: C++ A星算法实现八数码问题，启发函数为每一个将牌与其目标位置之间距离（不考虑夹在其间的将牌）的总和。-C++ A star algorithm eight digital, distance heuristic function sum (without considering sandwiched therebetween trump) between each of the brand to its target location
Date : Size : 3kb User : 张阳
[AI-NN-PR] Astar DL : 0: A星算法解决8数码问题,一种启发式搜索程序-A star algorithm to solve 8 digital problem, a heuristic search procedures
Date : Size : 3kb User : 王勇
[Other Riddle games] maze-game DL : 0: 一个用C语言写的迷宫游戏定义一个8*8的格子，这64个格子是人物可以移动到的位置；障碍物定义为两个相邻格子之间的挡板，0或1两种状态。类似上述方法，可以定义整个迷宫的布局，64个格子，对应数目的挡板，迷宫出口，迷宫入口，小人，这些元素。文件里，需要存储迷宫大小，挡板位置，出口，入口。小人在任一位置，可以向四个方向移动，有挡板则可以移动，没挡板则不可以移动。最优路径的提示，使用A星路径算法去做，实质是一个启发式广度优先遍历。-A written in C language maze game The definition of a 8x8 grid, which is a character grid 64 can be moved to the position the obstacle is defined as a baffle between two adjacent grid, 0 or 1 two states. Similar to the above method, you can define the entire layout of the maze, 64 grid, a corresponding number of baffles, exit the maze, the maze entrance, villain, these elements. File, the need to store the size of the maze, damper position, export, import. Villain in either position, you can move in four directions, you can move baffled, did not baffle can be moved. Tip optimal path using A star path algorithm to do, in essence, it is a heuristic breadth-first traversal.
Date : Size : 3kb User : ShichaoLiang
[AI-NN-PR] TheEightDigits DL : 0: 运用启发式搜索算法，用来解决一个简单的八数码问题。这里用的是A星算法。-Using heuristic search algorithm, which is used to solve a simple eight digital problem. Here is A star algorithm.
Date : Size : 912kb User : 武林
[Algorithm] ProjectAI DL : 0: c++ AI project artificial intelligence path planning route best first a * star * greedy first uniform cost dijkstra s optimal search heuristic incomplete project not working fully
Date : Size : 219kb User :
[GPS develop] astardemo DL : 0: A*搜寻算法俗称A星算法。A*算法是比较流行的启发式搜索算法之一，被广泛应用于路径优化领域[。它的独特之处是检查最短路径中每个可能的节点时引入了全局信息，对当前节点距终点的距离做出估计，并作为评价该节点处于最短路线上的可能性的量度。(A * search algorithm commonly known as A Star algorithm. A * algorithm is one of the more popular heuristic search algorithms and is widely used in the field of path optimization. It is unique in that it examines every possible node in the shortest path by introducing global information, estimating the distance from the end of the current node, and serving as a measure of the likelihood of the node being on the shortest path.)
Date : Size : 5kb User : diuman
[Other] AStarPath DL : 0: A*搜寻算法俗称A星算法。A*算法是比较流行的启发式搜索算法之一，被广泛应用于路径优化领域[。它的独特之处是检查最短路径中每个可能的节点时引入了全局信息，对当前节点距终点的距离做出估计，并作为评价该节点处于最短路线上的可能性的量度。(The A* search algorithm is commonly known as the A-star algorithm. The A* algorithm is one of the more popular heuristic search algorithms and is widely used in the field of path optimization [. It is unique in that it introduces global information when examining every possible node in the shortest path, estimates the distance from the current node to the end point, and serves as a measure of the probability that the node is on the shortest route.)
Date : Size : 708kb User : xiaoqiangzi