避碰路径规划算法

代码说明：

说明：  输入：障碍物和起止点坐标信息； 输出：避碰最短路径； 思路：利用切线图算法对障碍物区域进行环境建模，然后利用Dijkstra算法进行路径规划。(Input: coordinate information of obstacles and starting and ending points; Output: shortest path to avoid collision; Idea: use tangent graph algorithm to model the environment of obstacle area, and then use Dijkstra algorithm to plan the path.)

文件列表：

避碰路径规划hp\SegmentCrossObstacle_Judge.m, 800 , 2018-06-08
避碰路径规划hp\SegmentCrossSegment_Judge.m, 819 , 2018-06-08
避碰路径规划hp\TangentGraph.m, 18443 , 2019-10-23
避碰路径规划hp\TangentLine_Judge.m, 1742 , 2018-06-13
避碰路径规划hp\mydijkstra.m, 1061 , 2018-06-15
避碰路径规划hp, 0 , 2018-06-17