A New Approach to Iterative Deepening Multiobjective A* [chapter]

J. Coego, L. Mandow, J. L. Pérez de la Cruz
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
more » ... g. Empirical results show that IPID is usually faster than those approaches. ECAI 2012 Luc De Raedt et al. (Eds.)
doi:10.1007/978-3-642-10291-2_27 fatcat:cxfwke5aszhc3occdjleh5qc7e