{"title":"在多代理路径查找中完成所有最优解（扩展摘要）","authors":"Shahar Bardugo, Dor Atzmon","doi":"10.1609/socs.v17i1.31570","DOIUrl":null,"url":null,"abstract":"The Multi-Agent Path Finding problem (MAPF) aims to find conflict-free paths for a group of agents leading each agent to its respective goal. In this paper, we study the requirement of finding all optimal solutions in MAPF. We discuss the representation of all optimal solutions, propose three algorithms for finding them, and compare the algorithms experimentally.","PeriodicalId":425645,"journal":{"name":"Symposium on Combinatorial Search","volume":"38 11","pages":"259-260"},"PeriodicalIF":0.0000,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Finiding All Optimal Solutions in Multi-Agent Path Finding (Extended Abstract)\",\"authors\":\"Shahar Bardugo, Dor Atzmon\",\"doi\":\"10.1609/socs.v17i1.31570\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Multi-Agent Path Finding problem (MAPF) aims to find conflict-free paths for a group of agents leading each agent to its respective goal. In this paper, we study the requirement of finding all optimal solutions in MAPF. We discuss the representation of all optimal solutions, propose three algorithms for finding them, and compare the algorithms experimentally.\",\"PeriodicalId\":425645,\"journal\":{\"name\":\"Symposium on Combinatorial Search\",\"volume\":\"38 11\",\"pages\":\"259-260\"},\"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.31570\",\"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.31570","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Finiding All Optimal Solutions in Multi-Agent Path Finding (Extended Abstract)
The Multi-Agent Path Finding problem (MAPF) aims to find conflict-free paths for a group of agents leading each agent to its respective goal. In this paper, we study the requirement of finding all optimal solutions in MAPF. We discuss the representation of all optimal solutions, propose three algorithms for finding them, and compare the algorithms experimentally.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
