蚁群路径搜索算法的MATLAB仿真
clc;
clear;
close all;
n=20;
wallpercent=0.1;
[ field,startposind,goalposind,costchart,fieldpointers ] = initializefield( n,wallpercent );
axishandle = creatureFigure( field,startposind,goalposind );
setopen=[startposind];setopencosts=[0];setopenheuristics=[inf];
setclose=[];setclosecosts=[];
movementdirection=['R','L','D','U'];
while ~max(ismember(setopen,goalposind))&&~isempty(setopen)
[temp,ii]=min(setopencosts+setopenheuristics);
[costs,heuristics,posinds]=findfvalue(setopen(ii),setopencosts(ii),field,goalposind);
setclose=[setclose;setopen(ii)];setclosecosts=[setclosecosts;setopencosts(ii)];
if ii>1&&ii<length(setopen)
setopen=[setopen(1:ii-1);setopen(ii+1:end)];
setopencosts=[setopencosts(1:ii-1);setopencosts(ii+1:end)];
setopenheuristics=[setopenheuristics(1:ii-1);setopenheuristics(ii+1:end)];
elseif 1==ii
setopen=[setopen(ii+1:end)];
setopencosts=[setopencosts(ii+1:end)];
setopenheuristics=[setopenheuristics(ii+1:end)];
else
setopen=[setopen(ii+1:end)];
setopencosts=[setopencosts(ii+1:end)];
setopenheuristics=[setopenheuristics(ii+1:end)];
end
for jj=1:length(posinds)
if ~isinf(costs(jj))
if ~max([setopen;setclose]==posinds(jj))
fieldpointers{posinds(jj)}=movementdirection(jj);
setopen = [setopen; posinds(jj)];
setopencosts = [setopencosts; costs(jj)];
setopenheuristics = [setopenheuristics; heuristics(jj)];
elseif max(setopen==posinds(jj))
i=find(setopen==posinds(jj));
if setopencosts(i)>costs(jj)
setopencosts(i)=costs(jj);
setopenheuristics(i)=heuristics(jj);
fieldpointers{setopen(i)}=movementdirection(jj);
end
else i=find(setclose==posinds(jj));
if setclosecosts(i)>costs(jj)
setclosecosts(i)=costs(jj);
fieldpointers{setclose(i)}=movementdirection(jj);
end
end
end
end
if isempty(setopen)
break;
end
end
if max(ismember(setopen,goalposind))
p=findwayback(goalposind,fieldpointers);
p=[p;inf*ones(2)];
for kk=1:length(p)
if p(kk+2,1)==inf||p(kk+1,1)==inf
break;
elseif abs(p(kk+2,1)-p(kk,1))==1&&abs(p(kk+2,2)-p(kk,2))==1
if p(kk+1,1)-p(kk,1)==1&&p(kk+2,2)-p(kk+1,2)==1
if field(p(kk,2)+1,p(kk,1))==inf
p;
else p=[p(1:kk,:);p(kk+2:end,:)];
end
elseif p(kk+1,2)-p(kk,2)==1&&p(kk+2,1)-p(kk+1,1)==1
if field(p(kk,2),p(kk,1)+1)==inf
p;
else p=[p(1:kk,:);p(kk+2:end,:)];
end
elseif p(kk+1,1)-p(kk,1)==-1&&p(kk+2,2)-p(kk+1,2)==1
if field(p(kk,2)+1,p(kk,1))==inf
p;
else p=[p(1:kk,:);p(kk+2:end,:)];
end
elseif p(kk+1,2)-p(kk,2)==1&&p(kk+2,1)-p(kk+1,1)==-1
if field(p(kk,2),p(kk,1)-1)==inf
p;
else p=[p(1:kk,:);p(kk+2:end,:)];
end
elseif p(kk+1,1)-p(kk,1)==-1&&p(kk+2,2)-p(kk+1,2)==-1
if field(p(kk,2)-1,p(kk,1))==inf
p;
else p=[p(1:kk,:);p(kk+2:end,:)];
end
elseif p(kk+1,2)-p(kk,2)==-1&&p(kk+2,1)-p(kk+1,1)==-1
if field(p(kk,2),p(kk,1)-1)==inf
p;
else p=[p(1:kk,:);p(kk+2:end,:)];
end
elseif p(kk+1,1)-p(kk,1)==1&&p(kk+2,2)-p(kk+1,2)==-1
if field(p(kk,2)-1,p(kk,1))==inf
p;
else p=[p(1:kk,:);p(kk+2:end,:)];
end
else p(kk+1,2)-p(kk,2)==-1&&p(kk+2,1)-p(kk+1,1)==1
if field(p(kk,2),p(kk,1)+1)==inf
p;
else p=[p(1:kk,:);p(kk+2:end,:)];
end
end
else
p;
end
end
p=p(1:end-2,:);
plot(p(:,1)+0.5,p(:,2)+0.5,'color',[0.95 0.95 0],'LineWidth',5);drawnow;
elseif isempty(setopen)
disp('no solution');
end
C81
相关文章
- 【MATLAB教程案例100】人脸图像的无线传输通信链路及远程识别系统matlab仿真(下)——人脸识别
- 【MATLAB教程案例98】基于混沌序列的图像加解密matlab仿真,并进行各类攻击测试
- 【MATLAB教程案例77】WSN网络覆盖率问题与matlab仿真
- 【MATLAB教程案例62】使用matlab实现基于PointNet++网络的点云数据分类仿真分析
- 【MATLAB教程案例61】使用matlab实现基于ResNet残差网络的数据分类仿真分析
- 【MATLAB教程案例60】使用matlab实现基于GRU网络的数据分类预测功能与仿真分析
- 【MATLAB教程案例57】使用matlab实现RCNN,FastRCNN以及FasterRCNN网络目标检测功能与仿真分析
- 【MATLAB教程案例49】三维点云数据ICP配准算法的matlab仿真学习
- 【MATLAB教程案例45】基于双目视觉的图像深度信息提取算法matlab仿真
- 【MATLAB教程案例36~42总结】语音信号处理matlab仿真经验和技巧总结
- 【MATLAB教程案例37】语音信号的端点检测方法matlab仿真学习——ZCR过零法,双门限法
- 5.MATLAB路径管理
- 【MATLAB教程案例16】基于GWO灰狼优化算法的函数极值计算matlab仿真及其他应用
- 【MATLAB教程案例15】基于WOA鲸鱼优化算法的函数极值计算matlab仿真及其他应用
- 【MATLAB教程案例11】基于PSO粒子群优化算法的函数极值计算matlab仿真及其他应用
- 基于蚁群算法的障碍物路径搜索算法的matlab仿真
- 【Matlab小问题】matlab启动时出现Warning: Name is nonexistent or not a directory
- 【Matlab算法】MATLAB求解背包问题(附MATLAB代码)