并行化多目标 A* 搜索（扩展摘要）

Symposium on Combinatorial Search Pub Date : 2024-06-01 DOI:10.1609/socs.v17i1.31567

Saman Ahmadi

{"title":"并行化多目标 A* 搜索（扩展摘要）","authors":"Saman Ahmadi","doi":"10.1609/socs.v17i1.31567","DOIUrl":null,"url":null,"abstract":"The Multi-objective Shortest Path (MOSP) problem aims to find all Pareto-optimal paths between two points in a graph with multiple edge costs. Recent studies on multi-objective search with A* have demonstrated superior performance in solving difficult MOSP instances. This paper proposes a novel parallel multi-objective search framework that can accelerate recent A*-based solutions by several factors.","PeriodicalId":425645,"journal":{"name":"Symposium on Combinatorial Search","volume":"55 1","pages":"253-254"},"PeriodicalIF":0.0000,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Parallelizing Multi-objective A* Search (Extended Abstract)\",\"authors\":\"Saman Ahmadi\",\"doi\":\"10.1609/socs.v17i1.31567\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Multi-objective Shortest Path (MOSP) problem aims to find all Pareto-optimal paths between two points in a graph with multiple edge costs. Recent studies on multi-objective search with A* have demonstrated superior performance in solving difficult MOSP instances. This paper proposes a novel parallel multi-objective search framework that can accelerate recent A*-based solutions by several factors.\",\"PeriodicalId\":425645,\"journal\":{\"name\":\"Symposium on Combinatorial Search\",\"volume\":\"55 1\",\"pages\":\"253-254\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Symposium on Combinatorial Search\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1609/socs.v17i1.31567\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Symposium on Combinatorial Search","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1609/socs.v17i1.31567","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

多目标最短路径（MOSP）问题的目的是找到具有多边成本的图中两点之间的所有帕累托最优路径。最近关于使用 A* 进行多目标搜索的研究表明，在解决困难的 MOSP 实例时，A* 具有卓越的性能。本文提出了一种新颖的并行多目标搜索框架，它能将基于 A* 的最新解决方案的速度提高数倍。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Parallelizing Multi-objective A* Search (Extended Abstract)

The Multi-objective Shortest Path (MOSP) problem aims to find all Pareto-optimal paths between two points in a graph with multiple edge costs. Recent studies on multi-objective search with A* have demonstrated superior performance in solving difficult MOSP instances. This paper proposes a novel parallel multi-objective search framework that can accelerate recent A*-based solutions by several factors.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Symposium on Combinatorial Search

自引率

0.00%

发文量