Time Dependent Vector Dynamic Programming Algorithm for the Path Planning Problem

摘要

Dynamic programming is a modeling technique used for the decision making process.This method can be used to find the set of nondominated paths in a network with time dependent vector costs. In this report a dynamic programming algorithm and its implementation are discussed. An application to a fire egress problem is also included.