Incrementalgraph search algorithms such as D* Lite reuse previous, and perhaps partial, searches to expedite subsequent path planning tasks. In this article, we are interested in developing incremental graph for finding problems simultaneously optimize multiple objectives travel risk, arrival time, etc. This is challenging because a multi-objective setting, the number of “Pareto-optimal” soluti...