NIST Time|NIST Home|About NIST|Contact NIST

HomeAll Years:AuthorKeywordTitle2005-2010:AuthorKeywordTitle

Time Dependent Vector Dynamic Programming Algorithm for the Path Planning Problem.


pdf icon Time Dependent Vector Dynamic Programming Algorithm for the Path Planning Problem. (2828 K)
Wilson, M. R.

NIST GCR 93-636; 67 p. December 1993.

Sponsor:

National Institute of Standards and Technology, Gaithersburg, MD

Available from:

National Technical Information Service
Order number: PB94-215688

Keywords:

computer programs; building fires; egress; escape; fire models; fire research; dynamic programming

Abstract:

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.