{"title":"多机器人系统的网格形成目标分配策略。","authors":"Grigoris Lionis, K. Kyriakopoulos","doi":"10.1109/MED.2009.5164580","DOIUrl":null,"url":null,"abstract":"In this paper we investigate a class of algorithms for solving a target allocation problem for a team of mobile robots. The problem solved concerns the concurrent solution of the target allocation problem and the motion planning problem, and it is solved for a specific class of targets. Specifically we are studying the solution of the target allocation problem when the targets are structured on a full grid structure. The problem is solved decentralized, with each agent having information regarding its position and its immediate vicinity. The main idea is to transform the problem from a 2D problem in a 1D problem. Time bounds for convergence are also given.","PeriodicalId":422386,"journal":{"name":"2009 17th Mediterranean Conference on Control and Automation","volume":"96 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A grid forming target allocation strategy for multi robot systems.\",\"authors\":\"Grigoris Lionis, K. Kyriakopoulos\",\"doi\":\"10.1109/MED.2009.5164580\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we investigate a class of algorithms for solving a target allocation problem for a team of mobile robots. The problem solved concerns the concurrent solution of the target allocation problem and the motion planning problem, and it is solved for a specific class of targets. Specifically we are studying the solution of the target allocation problem when the targets are structured on a full grid structure. The problem is solved decentralized, with each agent having information regarding its position and its immediate vicinity. The main idea is to transform the problem from a 2D problem in a 1D problem. Time bounds for convergence are also given.\",\"PeriodicalId\":422386,\"journal\":{\"name\":\"2009 17th Mediterranean Conference on Control and Automation\",\"volume\":\"96 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-06-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 17th Mediterranean Conference on Control and Automation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MED.2009.5164580\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 17th Mediterranean Conference on Control and Automation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MED.2009.5164580","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A grid forming target allocation strategy for multi robot systems.
In this paper we investigate a class of algorithms for solving a target allocation problem for a team of mobile robots. The problem solved concerns the concurrent solution of the target allocation problem and the motion planning problem, and it is solved for a specific class of targets. Specifically we are studying the solution of the target allocation problem when the targets are structured on a full grid structure. The problem is solved decentralized, with each agent having information regarding its position and its immediate vicinity. The main idea is to transform the problem from a 2D problem in a 1D problem. Time bounds for convergence are also given.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
