Approximation in time dependent multiple objective path planning

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....

Full description

Saved in:
Bibliographic Details
Published in[Proceedings] 1992 IEEE International Conference on Systems, Man, and Cybernetics pp. 861 - 866 vol.1
Main Authors Kostreva, M.M., Wiecek, M.M.
Format Conference Proceeding
LanguageEnglish
Published IEEE 1992
Subjects
Approximation methods
Cost function
Dynamic programming
Fires
Intelligent networks
Laboratories
NIST
Path planning
Power system modeling
Transportation
Online AccessGet full text

Cover

More Information
Summary: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.< >
ISBN:0780307208
9780780307209
DOI:10.1109/ICSMC.1992.271685