{"title":"分配问题的共识方法:在移动传感器调度中的应用","authors":"T. Wongpiromsarn, Keyou You, Lihua Xie","doi":"10.1109/ICCA.2010.5524255","DOIUrl":null,"url":null,"abstract":"We propose a consensus protocol to solve the assignment problem in a completely distributed manner without any central management or global knowledge. Our protocol is based on the auction algorithm and ensures convergence to an assignment that is within n∈ of being optimal where n is the number of agents and ∈ is a design parameter. We then apply the proposed protocol to the mobile sensor dispatch problem to let each mobile sensor determines, in a completely distributed manner, the failed static sensor it should recover so that the total distance traveled by all the mobile sensors is minimized.","PeriodicalId":155562,"journal":{"name":"IEEE ICCA 2010","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"A consensus approach to the assignment problem: Application to mobile sensor dispatch\",\"authors\":\"T. Wongpiromsarn, Keyou You, Lihua Xie\",\"doi\":\"10.1109/ICCA.2010.5524255\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose a consensus protocol to solve the assignment problem in a completely distributed manner without any central management or global knowledge. Our protocol is based on the auction algorithm and ensures convergence to an assignment that is within n∈ of being optimal where n is the number of agents and ∈ is a design parameter. We then apply the proposed protocol to the mobile sensor dispatch problem to let each mobile sensor determines, in a completely distributed manner, the failed static sensor it should recover so that the total distance traveled by all the mobile sensors is minimized.\",\"PeriodicalId\":155562,\"journal\":{\"name\":\"IEEE ICCA 2010\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-06-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE ICCA 2010\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCA.2010.5524255\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE ICCA 2010","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCA.2010.5524255","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A consensus approach to the assignment problem: Application to mobile sensor dispatch
We propose a consensus protocol to solve the assignment problem in a completely distributed manner without any central management or global knowledge. Our protocol is based on the auction algorithm and ensures convergence to an assignment that is within n∈ of being optimal where n is the number of agents and ∈ is a design parameter. We then apply the proposed protocol to the mobile sensor dispatch problem to let each mobile sensor determines, in a completely distributed manner, the failed static sensor it should recover so that the total distance traveled by all the mobile sensors is minimized.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
