Many interesting search problems can be formulated as bi-objective search problems, that
is, search problems where two kinds of costs have to be minimized, for example, travel …

This work addresses a Multi-Objective Shortest Path Problem (MO-SPP) on a graph where
the goal is to find a set of Pareto-optimal solutions from a start node to a destination in the …

Incrementalgraph search algorithms such as D* Lite reuse previous, and perhaps partial,
searches to expedite subsequent path planning tasks. In this article, we are interested in …

Bi-objective search is a problem of finding a set of optimal solutions in a two-dimensional
domain. This study proposes several enhancements to the state-of-the-art bi-objective …

Path planning among dynamic obstacles is a fundamental problem in Robotics with
numerous applications. In this work, we investigate a problem called Multi-Objective Path …

Conventional multi-agent path planners typically determine a path that optimizes a single
objective, such as path length. Many applications, however, may require multiple objectives …

Conventional multi-agent path planners typically compute an ensemble of paths while
optimizing a single objective, such as path length. However, many applications may require …

We introduce the Targeted Multiobjective Dijkstra Algorithm (T‐MDA), a label setting
algorithm for the One‐to‐One Multiobjective Shortest Path (MOSP) Problem. It is based on …

In multi-objective search, edges are annotated with cost vectors consisting of multiple cost
components. A path dominates another path with the same start and goal vertices iff the …

Bi-objective search problems are a useful generalization of shortest path search. This paper
reviews some recent contributions for the solution of this problem with emphasis on the …