TY - GEN
T1 - Asynchronous multi-centralized cooperative localization
AU - Nerurkar, Esha D.
AU - Roumeliotis, Stergios
PY - 2010/12/1
Y1 - 2010/12/1
N2 - This paper presents a generalized framework for inter-robot information-transfer schemes in Multi-Centralized Cooperative Localization (MC-CL) under asynchronous communication, i.e., when the communication graph associated with the mobile robot network is time-varying and intermittently disconnected. Specifically, two information-transfer schemes, which differ based on their communication bandwidth requirements per link, are discussed. Even under asynchronous communication constraints, these schemes enable robots to compute pose estimates identical to those generated using the centralized CL framework, albeit delayed. For each of these schemes, necessary and sufficient conditions for the communication-graph connectivity, that enable each robot to generate the centralized estimates, are developed. Moreover, detailed description of these schemes, along with their communication-complexity analysis and analytical results for the expected time delay in obtaining these estimates, are presented. Lastly, simulation results are used to validate the performance (the trade-off between communication link bandwidth and accuracy/delay) of these information-transfer schemes.
AB - This paper presents a generalized framework for inter-robot information-transfer schemes in Multi-Centralized Cooperative Localization (MC-CL) under asynchronous communication, i.e., when the communication graph associated with the mobile robot network is time-varying and intermittently disconnected. Specifically, two information-transfer schemes, which differ based on their communication bandwidth requirements per link, are discussed. Even under asynchronous communication constraints, these schemes enable robots to compute pose estimates identical to those generated using the centralized CL framework, albeit delayed. For each of these schemes, necessary and sufficient conditions for the communication-graph connectivity, that enable each robot to generate the centralized estimates, are developed. Moreover, detailed description of these schemes, along with their communication-complexity analysis and analytical results for the expected time delay in obtaining these estimates, are presented. Lastly, simulation results are used to validate the performance (the trade-off between communication link bandwidth and accuracy/delay) of these information-transfer schemes.
UR - http://www.scopus.com/inward/record.url?scp=78651492316&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=78651492316&partnerID=8YFLogxK
U2 - 10.1109/IROS.2010.5650133
DO - 10.1109/IROS.2010.5650133
M3 - Conference contribution
AN - SCOPUS:78651492316
SN - 9781424466757
T3 - IEEE/RSJ 2010 International Conference on Intelligent Robots and Systems, IROS 2010 - Conference Proceedings
SP - 4352
EP - 4359
BT - IEEE/RSJ 2010 International Conference on Intelligent Robots and Systems, IROS 2010 - Conference Proceedings
T2 - 23rd IEEE/RSJ 2010 International Conference on Intelligent Robots and Systems, IROS 2010
Y2 - 18 October 2010 through 22 October 2010
ER -