A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
A New Approach to Iterative Deepening Multiobjective A*
[chapter]
2009
Lecture Notes in Computer Science
Many real world search problems involve different objectives, usually in conflict. In these cases the cost of a transition is given by a cost vector. This paper presents IPID, a new exact algorithm based on iterative deepening, that finds the set of all Paretooptimal paths for a search problem in a graph with vectorial costs. Formal proofs of the admissibility of IPID are presented, as well as the results of some empirical comparisons between IPID and other approaches based on iterative
doi:10.1007/978-3-642-10291-2_27
fatcat:cxfwke5aszhc3occdjleh5qc7e