DocumentCode
1628213
Title
Approximation in time dependent multiple objective path planning
Author
Kostreva, Michael M. ; Wiecek, Malgorzata M.
Author_Institution
Dept. of Math. Sci., Clemson Univ., SC, USA
fYear
1992
Firstpage
861
Abstract
The authors present a new method for approximating the set of nondominated paths in a dynamic network with vector costs that are monotone increasing step functions of time. The method includes solving a sequence of constant cost dynamic programming problems. Two path planning examples are provided. A comparison of the method of approximation with other algorithms is given
Keywords
approximation theory; dynamic programming; network routing; operations research; path planning; approximation; constant cost dynamic programming; dynamic network; multiple objective path planning; nondominated paths; operations research; vector costs; Approximation methods; Cost function; Dynamic programming; Fires; Intelligent networks; Laboratories; NIST; Path planning; Power system modeling; Transportation;
fLanguage
English
Publisher
ieee
Conference_Titel
Systems, Man and Cybernetics, 1992., IEEE International Conference on
Conference_Location
Chicago, IL
Print_ISBN
0-7803-0720-8
Type
conf
DOI
10.1109/ICSMC.1992.271685
Filename
271685
Link To Document