initialmap.m

用深度优先算法做的一个路径规划。可以从开始点一直移动到目标点

s = [50;50];              %起始点
g = [250;250];            %目标点

obstaclesx = [100,150,150,100,100; %障碍物
    170,200,200,170,170;
    190,220,220,190,190];
obstaclesy = [100,100,150,150,100;
    50,50,200,200,50;
    230,230,250,250,230];

figure(1)
hold on
axis([0 300 0 300])
xlabel('x');
ylabel('y');
for i = 1:size(obstaclesx,1)
    plot(obstaclesx(i,:),obstaclesy(i,:),'r')
end
plot(s(1),s(2),'s',g(1),g(2),'x')
title('Obstacles (polygon), initial vehicle (square) and goal (x)');
hold off