{"title":"分布式区域覆盖与勘探的多智能体联盟形成","authors":"C. Banerjee, N. Deepthi","doi":"10.1109/RACE.2015.7097274","DOIUrl":null,"url":null,"abstract":"In area coverage problems with multiple agents, team formation turns out quite beneficial. In this paper we propose a team formation algorithm using coalition game theory. We also implement elements from weighted graph games and weighted synergy graphs for making the approach simpler in representation and application.","PeriodicalId":161131,"journal":{"name":"2015 International Conference on Robotics, Automation, Control and Embedded Systems (RACE)","volume":"171 4356 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Multiagent coalition formation for distributed area coverage & exploration\",\"authors\":\"C. Banerjee, N. Deepthi\",\"doi\":\"10.1109/RACE.2015.7097274\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In area coverage problems with multiple agents, team formation turns out quite beneficial. In this paper we propose a team formation algorithm using coalition game theory. We also implement elements from weighted graph games and weighted synergy graphs for making the approach simpler in representation and application.\",\"PeriodicalId\":161131,\"journal\":{\"name\":\"2015 International Conference on Robotics, Automation, Control and Embedded Systems (RACE)\",\"volume\":\"171 4356 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 International Conference on Robotics, Automation, Control and Embedded Systems (RACE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RACE.2015.7097274\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Conference on Robotics, Automation, Control and Embedded Systems (RACE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RACE.2015.7097274","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Multiagent coalition formation for distributed area coverage & exploration
In area coverage problems with multiple agents, team formation turns out quite beneficial. In this paper we propose a team formation algorithm using coalition game theory. We also implement elements from weighted graph games and weighted synergy graphs for making the approach simpler in representation and application.