Frontier Search for Bicriterion Shortest Path Problems
Lorenzo Mandow, José-Luís Pérez-de-la-Cruz · Frontiers in artificial intelligence and applications · 2008
Frontier search is a new search technique that achieves important memory savings over previous best-first search algorithms. This paper describes an extension of frontier search to bicriterion graph search problems that achieves also important memory savings. The new algorithm is evaluated using a set of random problems.