資源簡(jiǎn)介
D* Lite路徑規(guī)劃算法,可以在源代碼中修改地圖大小、起始點(diǎn)、目標(biāo)點(diǎn)、四向或八向搜尋,算法隨機(jī)生成原始地圖和實(shí)際地圖,路徑規(guī)劃過程中根據(jù)實(shí)際障礙物情況改變生成路徑。

代碼片段和文件信息
function?[key1key2]=CalculateKey(s)%計(jì)算節(jié)點(diǎn)key值參數(shù)(當(dāng)前節(jié)點(diǎn))返回該節(jié)點(diǎn)key值
????global?km;
????global?g;
????global?rhs;
????global?key;
????global?s_start;
????global?neighbour;
????if(size(neighbour1)==4)%四向時(shí)兩點(diǎn)間代價(jià)為橫做坐標(biāo)差值相加
????????h=abs(s_start(1)-s(1))+abs(s_start(2)-s(2));????
????else%八向時(shí)兩點(diǎn)間代價(jià)為橫做坐標(biāo)差值最大的數(shù)
%?????????h=max(abs(s_start(1)-s(1))abs(s_start(2)-s(2)));%h是可以改進(jìn)的點(diǎn)
????????h=min(abs(s_start(1)-s(1))abs(s_start(2)-s(2)))*1.4+abs(abs(s_start(1)-s(1))-abs(s_start(2)-s(2)));
%?????????h=0;
????end
????key2=min(g(s(1)s(2))rhs(s(1)s(2)));
????key1=key2+km+h;
????key(s(1)s(2)).key1=key1;
????key(s(1)s(2)).key2=key2;
end
?屬性????????????大小?????日期????時(shí)間???名稱
-----------?---------??----------?-----??----
?????目錄???????????0??2019-05-27?17:35??D_star?Lite_veryok\
?????文件?????????789??2019-05-27?14:47??D_star?Lite_veryok\rhs_cal.m
?????文件????????7213??2019-05-27?17:20??D_star?Lite_veryok\main.m~
?????文件?????????391??2019-05-23?17:10??D_star?Lite_veryok\UTopKey.m
?????文件????????7259??2019-05-27?17:33??D_star?Lite_veryok\main.m
?????文件????????1905??2019-05-27?14:49??D_star?Lite_veryok\ComputeShortestPath.m
?????文件?????????420??2019-05-27?09:12??D_star?Lite_veryok\UpdateVertex.m
?????文件?????????234??2019-05-23?16:35??D_star?Lite_veryok\CompareKey.m
?????文件?????????203??2019-05-23?19:39??D_star?Lite_veryok\over_border.m
?????文件?????????690??2019-05-27?09:04??D_star?Lite_veryok\CalculateKey.m
評(píng)論
共有 條評(píng)論