Authors: L Mandow J L PĂ©rez de la Cruz
Publish Date: 2008/11/12
Volume: 21, Issue: 1, Pages: 89-99
Abstract
Frontier search is a bestfirst graph search technique that allows significant memory savings over previous bestfirst algorithms The fundamental idea is to remove from memory already explored nodes keeping only open nodes in the search frontier However once the goal node is reached additional techniques are needed to recover the solution path This paper describes and analyzes a path recovery procedure for frontier search applied to multiobjective shortest path problems Differences with the scalar case are outlined and performance is evaluated over a random problem set
Keywords: