In the multi-objective shortest-path problem we are interested in computing a path, or a set of
paths that simultaneously balance multiple cost functions. This problem is important for a …

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 …

Multi-objective search can be used to model many real-world problems that require finding
Paretooptimal paths from a specified start state to a specified goal state, while considering …

The landscape of applications and subroutines relying on shortest path computations
continues to grow steadily. This growth is driven by the undeniable success of shortest path …

Abstract Agent Scheduling Problems (ASPs) are common in various real-world situations,
requiring explainable decision-making processes to effectively allocate resources to multiple …

The Resource Constrained Shortest Path Problem (RCSPP) seeks to determine a minimum-
cost path between a start and a goal location while ensuring that one or multiple types of …

Inspection planning, the task of planning motions for a robot that enable it to inspect a set of
points of interest, has applications in domains such as industrial, field, and medical robotics …

This paper considers a multi-agent multi-objective path-finding problem that requires not
only finding collision-free paths for multiple agents from their respective start locations to …

A major area of application of multiobjective path problems and resolution algorithms is
telecommunication network routing design, taking into account the extremely rapid …

Abstract Contraction Hierarchies (CHs) have been successfully used as a preprocessing
technique in single-objective graph search for finding shortest paths. However, only a few …