BriefGPT.xyz
Mar, 2025
并行化多目标A*搜索
Parallelizing Multi-objective A* Search
HTML
PDF
Saman Ahmadi, Nathan R. Sturtevant, Andrea Raith, Daniel Harabor, Mahdi Jalili
TL;DR
本研究解决了多目标最短路径问题（MOSP），通过提出一种新的搜索框架实现了多目标A*搜索（MOA*）的高效并行化。研究发现，独特的上界策略能够在某些情况下将问题的维度降低到一，实验结果表明，该框架显著提升了基于A*的解决方案的性能，且加速效果与问题维度成正比。
Abstract
The Multi-objective Shortest Path (MOSP) problem is a classic network
Optimization
problem that aims to find all
Pareto-optimal Paths
between two points in a graph with multiple edge costs. Recent studies on
→