文件列表:

Astar\Astar\Astar_tutorial.pdf (80240, 2005-05-08)
Astar\Astar\A_Star1.m (7396, 2010-01-05)
Astar\Astar\distance.m (201, 2010-01-05)
Astar\Astar\expand_array.m (1824, 2010-01-05)
Astar\Astar\insert_open.m (596, 2010-01-05)
Astar\Astar\min_fn.m (1060, 2010-01-05)
Astar\Astar\node_index.m (297, 2010-01-05)
Astar\Astar\screenShot.jpg (44385, 2010-01-01)
Astar\Astar (0, 2012-02-03)
Astar\license.txt (1551, 2010-01-05)
Astar (0, 2012-02-03)

%{ List of Files ReadMe.txt : Contains List of Files and description Astar_tutorial.pdf : Description of A* algorithm, examples A_star1.m : This is the main file that contains the algorithm. This needs to be executed to run the program. distance.m : This is a function that calculates the distance between 2 nodes. min_fn.m : This function takes the list OPEN as one of its arguments and returns the node with the smallest cost function. Node_index.m : This function returns the index of the location of a node in the list OPEN. Expand_array.m : This function takes a node and returns the expanded list of successors, with the calculated fn values. One of the criteria being none of the successors are on the CLOSED list. insert_open.m : This function populates the list OPEN with values that have been passed to it. %}

近期下载者：

相关文件：

评论：[我要评论] [举报此文件]

收藏者：