└── Astar ├── README.md ├── doc └── A_Formal_Basis_for_the_Heuristic_Determination_of_Minimum_Cost_Paths.pdf ├── image ├── MindStructure.png └── Result.png └── src └── AStarFind.m /Astar/README.md: -------------------------------------------------------------------------------- 1 | # A*搜索算法 2 | ## 核心思想 3 | ![](https://github.com/wanghuohuo0716/algorithm-recurrence/blob/master/Astar/image/Result.png) 4 | ![](https://github.com/wanghuohuo0716/algorithm-recurrence/blob/master/Astar/image/MindStructure.png) 5 | 6 | ## 注意 7 | 这里有一部分代码是将实际坐标（单位：米）转换为了栅格坐标（i，j）。转换关系为x坐标转换为列，y坐标转换为行。在画图（plot）的时候要注意，画的是x，y坐标，需要把行和列再换回来，代码中栅格的行是数据的第一位，换成x后，就在数据的第二位了。 8 | -------------------------------------------------------------------------------- /Astar/doc/A_Formal_Basis_for_the_Heuristic_Determination_of_Minimum_Cost_Paths.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wanghuohuo0716/AlgorithmTrain/392d92b8fa5399b03b1b44dc97a7eed9f2836f4f/Astar/doc/A_Formal_Basis_for_the_Heuristic_Determination_of_Minimum_Cost_Paths.pdf -------------------------------------------------------------------------------- /Astar/image/MindStructure.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wanghuohuo0716/AlgorithmTrain/392d92b8fa5399b03b1b44dc97a7eed9f2836f4f/Astar/image/MindStructure.png -------------------------------------------------------------------------------- /Astar/image/Result.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wanghuohuo0716/AlgorithmTrain/392d92b8fa5399b03b1b44dc97a7eed9f2836f4f/Astar/image/Result.png -------------------------------------------------------------------------------- /Astar/src/AStarFind.m: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wanghuohuo0716/AlgorithmTrain/392d92b8fa5399b03b1b44dc97a7eed9f2836f4f/Astar/src/AStarFind.m --------------------------------------------------------------------------------