Skip to content
Sagan

Paper

Bridging Multi-Valued Heuristics and Dimensionality Reduction in Multi-Objective Search

Unreadunread

AI summary

arXiv:2606. 20644v1 Announce Type: new Abstract: Multi-objective shortest-path (MOSP) algorithms traditionally rely on single-valued heuristics (SVHs), which associate each state with a single admissible cost vector.