資源簡介
基于柵格地圖的模型,勢場法的原理,設置初始點與目標點的路徑規劃圖
個人心血
代碼片段和文件信息
clear
map=ones(1010)%創建地圖
%[xy]=find(map)
obst=[1522233233353845475355586374758084858990]%錄入障礙物地圖
%map(15)=map(22)=
%map(23)=map(32)=map(33)=map(35)=map(38)=map(45)=map(47)=map(53)=map(55)=map(55)=map(58)=map(63)=map(74)=map(75)=map(80)=map(84)=map(85)=map(89)=map(90)=0
t=length(obst)
for?i=1:t
????map(obst(i))=0
end%將障礙物柵格值設為零
%for?i=1:t
%?????long(i)=fix(k(i)/10)
%?????width(i)=fix(k(i)/10)
%?????m=(long(i)-8)^2+(width(i)-8)^2
next_orientation=[-9111109-1-11-10];%周圍8個柵格的序號差?
step=[]%路徑數組
%w=[361063212]
%a=[21212121]
%v=a.^(1/2)
j=12;
while?j~=88
????
????next_value=next_orientation+j;
????b=(next_value==88)
????if?max(b)==0
for?i=1:8
????
????high(i)=fix(next_value(i)/10)
????width(i)=mod(next_value(i)10)
????distance(i)=(high(i)-8)^2+(width(i)-8)^2
%next_value=next_orientation+j;
grav(i)=distan
評論
共有 條評論