多代理寻路问题的高效有界次优搜索

IF 0.4 Q4 INFORMATION SCIENCE & LIBRARY SCIENCE Scientific and Technical Information Processing Pub Date : 2024-03-05 DOI:10.3103/s0147688223050015

A. A. Andreichuk

{"title":"多代理寻路问题的高效有界次优搜索","authors":"A. A. Andreichuk","doi":"10.3103/s0147688223050015","DOIUrl":null,"url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract—</h3><p>This article considers the problem of planning a complex of nonconflicting paths for a set of agents that are capable of performing actions of arbitrary duration. Two bounded-suboptimal modifications of a conflict-based search algorithm are proposed as solutions to the problem. The results of model experimental studies demonstrate the high computational efficiency of the proposed modifications.</p>","PeriodicalId":43962,"journal":{"name":"Scientific and Technical Information Processing","volume":"1 1","pages":""},"PeriodicalIF":0.4000,"publicationDate":"2024-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Efficient Bounded-Suboptimal Search for the Multiagent Pathfinding Problem\",\"authors\":\"A. A. Andreichuk\",\"doi\":\"10.3103/s0147688223050015\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<h3 data-test=\\\"abstract-sub-heading\\\">Abstract—</h3><p>This article considers the problem of planning a complex of nonconflicting paths for a set of agents that are capable of performing actions of arbitrary duration. Two bounded-suboptimal modifications of a conflict-based search algorithm are proposed as solutions to the problem. The results of model experimental studies demonstrate the high computational efficiency of the proposed modifications.</p>\",\"PeriodicalId\":43962,\"journal\":{\"name\":\"Scientific and Technical Information Processing\",\"volume\":\"1 1\",\"pages\":\"\"},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2024-03-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Scientific and Technical Information Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3103/s0147688223050015\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"INFORMATION SCIENCE & LIBRARY SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Scientific and Technical Information Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3103/s0147688223050015","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"INFORMATION SCIENCE & LIBRARY SCIENCE","Score":null,"Total":0}

引用次数: 0

摘要

摘要--本文考虑的问题是为一组能够执行任意持续时间的行动的代理规划一系列不冲突的路径。文章提出了基于冲突的搜索算法的两个有界次优修正，作为该问题的解决方案。模型实验研究结果表明，所提出的修改方案具有很高的计算效率。

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

摘要图片

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Efficient Bounded-Suboptimal Search for the Multiagent Pathfinding Problem

Abstract—

This article considers the problem of planning a complex of nonconflicting paths for a set of agents that are capable of performing actions of arbitrary duration. Two bounded-suboptimal modifications of a conflict-based search algorithm are proposed as solutions to the problem. The results of model experimental studies demonstrate the high computational efficiency of the proposed modifications.

求助全文

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

来源期刊

Scientific and Technical Information Processing INFORMATION SCIENCE & LIBRARY SCIENCE-

CiteScore

1.00

自引率

42.90%

发文量

期刊介绍： Scientific and Technical Information Processing is a refereed journal that covers all aspects of management and use of information technology in libraries and archives, information centres, and the information industry in general. Emphasis is on practical applications of new technologies and techniques for information analysis and processing.