动态规划Matlab代码

这是是一个MATLAB中动态规划算法的例子，它可以在路径网格中找到最小代价路径

function [cost, path] = dynamicProgramming(grid)
% Dynamic programming algorithm to find the minimum cost path in a grid
% grid: matrix representing the grid
% cost: minimum cost
% path: minimum cost path

[rows, cols] = size(grid);

% Initialize the cost and path arrays
cost = zeros(rows, cols);
path = zeros(rows, cols);

% Initialize the first row and column of the cost and path arrays
cost(1,:) = cumsum(grid(1,:));
path(1,:) = 1:cols;
cost(:,1) = cumsum(grid(:,1));
path(:,1) = 1:rows;

% Iterate through the rest of the grid
for i = 2:rows
    for j = 2:cols
        % Find the minimum cost to reach the current cell
        [minCost, minIndex] = min([cost(i-1,j), cost(i,j-1)]);
        cost(i,j) = grid(i,j) + minCost;
        % Update the path based on the minimum cost
        if minIndex == 1
            path(i,j) = path(i-1,j);
        else
            path(i,j) = path(i,j-1);
        end
    end
end

% Extract the minimum cost path
[row, col] = size(path);
i = row;
j = col;
minPath = [i, j];
while i > 1 || j > 1
    if i > 1 && j > 1
        [~, minIndex] = min([cost(i-1,j), cost(i,j-1)]);
    elseif i > 1
        [~, minIndex] = min([cost(i-1,j)]);
    else
        [~, minIndex] = min([cost(i,j-1)]);
    end
    if minIndex == 1
        i = i - 1;
    else
        j = j - 1;
    end
    minPath = [minPath; [i,j]];
end

% Reverse the path so it starts from the top left corner
path = fliplr(minPath);

end