DocumentCode :
1408062
Title :
Graph-Based Observability Analysis of Bearing-Only Cooperative Localization
Author :
Sharma, Ritu ; Beard, R.W. ; Taylor, C.N. ; Quebe, S.
Author_Institution :
Dept. of Electr. & Comput. Eng., Brigham Young Univ., Provo, UT, USA
Volume :
28
Issue :
2
fYear :
2012
fDate :
4/1/2012 12:00:00 AM
Firstpage :
522
Lastpage :
529
Abstract :
In this paper, we investigate the nonlinear observability properties of bearing-only cooperative localization. We establish a link between observability and a graph that represents measurements and communication between the robots. It is shown that graph theoretic properties like the connectivity and the existence of a path between two nodes can be used to explain the observability of the system. We obtain the maximum rank of the observability matrix without global information and derive conditions under which the maximum rank can be achieved. Furthermore, we show that for complete observability, all of the nodes in the graph must have a path to at least two different landmarks of known location.
Keywords :
graph theory; matrix algebra; mobile robots; multi-robot systems; nonlinear systems; observability; path planning; bearing-only cooperative localization; graph theoretic properties; graph-based observability analysis; multiagent navigation; networked robots; nonlinear observability properties; observability matrix; Observability; Robot kinematics; Robot sensing systems; Vectors; Vehicles; Multi-agent navigation; networked robots; non-linear observability analysis;
fLanguage :
English
Journal_Title :
Robotics, IEEE Transactions on
Publisher :
ieee
ISSN :
1552-3098
Type :
jour
DOI :
10.1109/TRO.2011.2172699
Filename :
6112245
Link To Document :
بازگشت