文件列表:

3d_Astar -\Astar_tutorial.pdf (80240, 2005-05-09)
3d_Astar -\A_Star1.asv (12370, 2011-10-08)
3d_Astar -\A_Star1.m (12441, 2011-10-08)
3d_Astar -\distance.m (219, 2011-09-10)
3d_Astar -\expand_array.asv (3711, 2011-10-08)
3d_Astar -\expand_array.m (3711, 2011-10-08)
3d_Astar -\insert_open.asv (724, 2011-09-17)
3d_Astar -\insert_open.m (724, 2011-09-17)
3d_Astar -\min_fn.asv (1525, 2011-10-07)
3d_Astar -\min_fn.m (1571, 2011-10-08)
3d_Astar -\node_index.m (323, 2011-09-10)
3d_Astar -\screenShot.jpg (44385, 2010-01-02)
3d_Astar - (0, 2011-10-08)

%{ 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. %}

近期下载者：

相关文件：

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

收藏者：