A note on the complexity of some multiobjective A* search algorithms
Lawrence Mandow, José-Luís Pérez-de-la-Cruz · Frontiers in artificial intelligence and applications · 2010
This paper studies the complexity of two different algorithms proposed as extensions of A* for multiobjective search: MOA* and NAMOA*. It is known that, for any given problem, NAMOA* requires the consideration of no more alternatives than MOA* when provided with the same heuristic information.