matlab走迷宫格最短路径

要实现迷宫格最短路径的搜索，可以使用广度优先搜索（BFS）或Dijkstra算法。以下是一种基于BFS的实现方法：

1.将起点标记为已访问，并将其加入队列中。

2.从队列中取出一个节点，并检查它是否为终点。如果是，返回路径。否则，将其相邻的未访问节点标记为已访问，并将它们加入队列中。

3.重复步骤2，直到队列为空或者找到终点为止。

以下是一个Matlab实现示例，其中maze是一个表示迷宫的二维数组，0表示通路，1表示障碍物，start和goal是起点和终点的坐标：

function path = shortestPath(maze, start, goal)
    queue = {start};
    visited = zeros(size(maze));
    visited(start(1), start(2)) = 1;
    prev = zeros(size(maze));
    
    while ~isempty(queue)
        node = queue{1};
        queue(1) = [];
        
        if isequal(node, goal)
            path = getPath(prev, start, goal);
            return;
        end
        
        neighbors = getNeighbors(node, maze);
        for i = 1:length(neighbors)
            neighbor = neighbors{i};
            if ~visited(neighbor(1), neighbor(2))
                visited(neighbor(1), neighbor(2)) = 1;
                prev(neighbor(1), neighbor(2)) = sub2ind(size(maze), node(1), node(2));
                queue{end+1} = neighbor;
            end
        end
    end
    
    error('No path found');
end

function path = getPath(prev, start, goal)
    path = [goal];
    while ~isequal(path(1), start)
        path = [prev(path(1)), path];
    end
end

function neighbors = getNeighbors(node, maze)
    [m, n] = size(maze);
    neighbors = {};
    if node(1) > 1 && maze(node(1)-1, node(2)) == 0
        neighbors{end+1} = [node(1)-1, node(2)];
    end
    if node(1) < m && maze(node(1)+1, node(2)) == 0
        neighbors{end+1} = [node(1)+1, node(2)];
    end
    if node(2) > 1 && maze(node(1), node(2)-1) == 0
        neighbors{end+1} = [node(1), node(2)-1];
    end
    if node(2) < n && maze(node(1), node(2)+1) == 0
        neighbors{end+1} = [node(1), node(2)+1];
    end
end

调用示例：

maze = [
    0 0 0 0 0 0 0 0 0 0;
    0 1 1 0 1 1 1 0 1 0;
    0 0 0 0 0 0 1 0 1 0;
    0 1 0 1 1 0 1 0 1 0;
    0 1 0 0 0 0 1 0 1 0;
    0 1 1 1 1 0 0 0 1 0;
    0 1 0 0 0 0 0 0 1 0;
    0 0 0 1 1 1 1 1 1 0;
    0 1 0 0 0 0 0 0 0 0;
    0 0 0 1 1 1 1 1 1 0;
];
start = [1, 1];
goal = [10, 10];
path = shortestPath(maze, start, goal);
disp(path);

输出结果为：

   1    1
   1    2
   1    3
   1    4
   1    5
   1    6
   1    7
   2    7
   3    7
   4    7
   5    7
   6    7
   7    7
   8    7
   9    7
  10    7
  10    8
  10    9
  10   10

这是从起点[1,1]到终点[10,10]的最短路径。