Time Dependent Vector Dynamic Programming Algorithm for the Path Planning Problem.
Time Dependent Vector Dynamic Programming Algorithm for
the Path Planning Problem.
Wilson, M. R.
NIST GCR 93-636; 67 p. December 1993.
Sponsor:National Institute of Standards and Technology,
Available from: National Technical Information Service
Order number: PB94-215688
computer programs; building fires; egress; escape; fire
models; fire research; dynamic programming
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