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.

Multirotor aircraft have become a popular platform for indoor flight. To navigate these vehicles indoors through an unknown environment requires the use of a SLAM algorithm, which can be processing intensive. However, their size, weight, and power capacity limit the processing capabilities available onboard. In this paper, we describe an approach to state estimation that helps to alleviate this problem. By using an improved dynamic model we show how to more accurately estimate the aircraft states than can be done with the traditional approach of integrating IMU measurements. The estimation is done with relatively infrequent corrections from accelerometers (40Hz) and even less frequent updates from a vision-based SLAM algorithm (2–5 Hz). This benefit of requiring less frequent updates from processing intensive sources comes without significant increase in the estimator's complexity.