{"title":"移动机器人编队的最优感知策略:资源约束定位","authors":"Anastasios I. Mourikis, S. Roumeliotis","doi":"10.15607/RSS.2005.I.037","DOIUrl":null,"url":null,"abstract":"This paper addresses the problem of resource allocation in formations of mobile robots localizing as a group. Each robot receives measurements from various sensors that provide relative (robot-to-robot) and absolute positioning information. Constraints on the sensors’ bandwidth, as well as communication and processing requirements, limit the number of measurements that are available or can be processed at each time step. The localization uncertainty of the group, determined by the covariance matrix of the equivalent continuous-time system at steady state, is expressed as a function of the sensor measurements’ frequencies. The trace of the submatrix corresponding to the position estimates is selected as the optimization criterion, under linear constraints on the measuring frequency of each sensor and the cumulative rate of EKF updates. This formulation leads to a convex optimization problem whose solution provides the sensing frequencies, for each sensor on every robot, required in order to maximize the positioning accuracy for the group. Simulation experiments are presented that demonstrate the applicability of this method and provide insight into the properties of the resource-constrained cooperative localization problem.","PeriodicalId":87357,"journal":{"name":"Robotics science and systems : online proceedings","volume":"409 1","pages":"281-288"},"PeriodicalIF":0.0000,"publicationDate":"2005-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":"{\"title\":\"Optimal Sensing Strategies for Mobile Robot Formations: Resource-Constrained Localization\",\"authors\":\"Anastasios I. Mourikis, S. Roumeliotis\",\"doi\":\"10.15607/RSS.2005.I.037\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper addresses the problem of resource allocation in formations of mobile robots localizing as a group. Each robot receives measurements from various sensors that provide relative (robot-to-robot) and absolute positioning information. Constraints on the sensors’ bandwidth, as well as communication and processing requirements, limit the number of measurements that are available or can be processed at each time step. The localization uncertainty of the group, determined by the covariance matrix of the equivalent continuous-time system at steady state, is expressed as a function of the sensor measurements’ frequencies. The trace of the submatrix corresponding to the position estimates is selected as the optimization criterion, under linear constraints on the measuring frequency of each sensor and the cumulative rate of EKF updates. This formulation leads to a convex optimization problem whose solution provides the sensing frequencies, for each sensor on every robot, required in order to maximize the positioning accuracy for the group. Simulation experiments are presented that demonstrate the applicability of this method and provide insight into the properties of the resource-constrained cooperative localization problem.\",\"PeriodicalId\":87357,\"journal\":{\"name\":\"Robotics science and systems : online proceedings\",\"volume\":\"409 1\",\"pages\":\"281-288\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-06-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"24\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Robotics science and systems : online proceedings\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.15607/RSS.2005.I.037\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Robotics science and systems : online proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15607/RSS.2005.I.037","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Optimal Sensing Strategies for Mobile Robot Formations: Resource-Constrained Localization
This paper addresses the problem of resource allocation in formations of mobile robots localizing as a group. Each robot receives measurements from various sensors that provide relative (robot-to-robot) and absolute positioning information. Constraints on the sensors’ bandwidth, as well as communication and processing requirements, limit the number of measurements that are available or can be processed at each time step. The localization uncertainty of the group, determined by the covariance matrix of the equivalent continuous-time system at steady state, is expressed as a function of the sensor measurements’ frequencies. The trace of the submatrix corresponding to the position estimates is selected as the optimization criterion, under linear constraints on the measuring frequency of each sensor and the cumulative rate of EKF updates. This formulation leads to a convex optimization problem whose solution provides the sensing frequencies, for each sensor on every robot, required in order to maximize the positioning accuracy for the group. Simulation experiments are presented that demonstrate the applicability of this method and provide insight into the properties of the resource-constrained cooperative localization problem.