5 papers
Bridging Multi-Valued Heuristics and Dimensionality Reduction in Multi-Objective Search
Maya Wolff, Ariel Felner, Oren Salzman
Multi-objective shortest-path (MOSP) algorithms traditionally rely on single-valued heuristics (SVHs), which associate each state with a single admissible cost vector. While SVHs p…
Scalable Algorithms with Provable Optimality Bounds for the Multiple Watchman Route Problem
Srikar Gouru, Ariel Felner, Jiaoyang Li
In this paper, we tackle the Multiple Watchman Route Problem (MWRP), which aims to find a set of paths that M watchmen can follow such that every location on the map can be seen by…
Bridging the Evaluation Gap: Standardized Benchmarks for Multi-Objective Search
Hadar Peer, Carlos Hernandez, Sven Koenig +2
Empirical evaluation in multi-objective search (MOS) has historically suffered from fragmentation, relying on heterogeneous problem instances with incompatible objective definition…
Multi-Objective Search: Algorithms, Applications, and Emerging Directions
Oren Salzman, Carlos Hernández Ulloa, Ariel Felner +1
Multi-objective search (MOS) has emerged as a unifying framework for planning and decision-making problems where multiple, often conflicting, criteria must be balanced. While the p…
A Preprocessing Framework for Efficient Approximate Bi-Objective Shortest-Path Computation in the Presence of Correlated Objectives
Yaron Halle, Ariel Felner, Sven Koenig +1
The bi-objective shortest-path (BOSP) problem seeks to find paths between start and target vertices of a graph while optimizing two conflicting objective functions. We consider the…