In this paper, we present a framework for performing collaborative localization for groups of micro aerial vehicles (MAV) that use vision based sensing. The vehicles are each assumed to be equipped with a forward-facing monocular camera, and to be capable of communicating with each other. This collaborative localization approach is developed as a decentralized algorithm and built in a distributed fashion where individual and relative pose estimation techniques are combined for the group to localize against surrounding environments. The MAVs initially detect and match salient features between each other to create a sparse reconstruction of the observed environment, which acts as a global map. Once a map is available, each MAV performs feature detection and tracking with a robust outlier rejection process to estimate its own pose in 6 degrees of freedom. Occasionally, one or more MAVs can be tasked to compute poses for another MAV through relative measurements, which is achieved through multiple view geometry concepts. These relative measurements are then fused with individual measurements in a consistent fashion. We present the results of the algorithm on image data from MAV flights both in simulation and real life, and discuss the advantages of collaborative localization in improving pose estimation accuracy.
Collaborative localization has been of interest over the past decade as well, with the theoretical foundations having been studied extensively. The general idea of collaborative localization has involved the concept of fusing different measurements to result in a more accurate fused state. @cite_37 present a localization approach that uses an extended Kalman filter to fuse proprioceptive and exteroceptive measurements, applied to multi-robot localization. @cite_27 present a distributed cooperative localization algorithm through maximum aposteriori estimation, under the condition that continuous synchronous communication exists within the robot group. In @cite_43 , the authors present a decentralized cooperative localization approach where the robots need to communicate only during the presence of relative measurements, an algorithm we use in our paper to facilitate inter-MAV data fusion. @cite_42 propose a multi robot localization algorithm that can handle unknown initial poses and solves the data association problem through expectation maximization. Knuth and Barooah @cite_2 propose a distributed algorithm for GPS-denied scenarios, where the robots fuse each other's information and average the relative pose data in order to achieve cooperative estimation.
@cite_37 @cite_42 @cite_43 @cite_27 @cite_2
2010331587 1501672519 2138890480 1996361697
We propose a distributed algorithm for collaborative localization of multiple autonomous robots that fuses inter-robot relative measurements with odometry measurements to improve upon dead reckoning estimates. It is an extension of our previous work [6], in which a method for fusing inter-robot pose measurements was presented. In this paper we extend the method to fuse any type of inter-robot measurements (distance, bearing, relative position, relative orientation, and any combination thereof), thus increasing the applicability of the method. The proposed method is posed as an optimization problem in a product Riemannian manifold; and is solved by gradient descent without performing a parameterization of the orientations. The proposed distributed algorithm allows each robot to compute its own pose estimate based on local measurements and communication with its neighbors. Simulations show that the proposed distributed algorithm significantly improves localization accuracy over the case of no-collaboration. Simulations show that, in some situations, the proposed distributed algorithm outperforms two competing methods - an Extended Kalman Filter-based algorithm as well as a distributed pose graph optimization method that relies on an Euclidean parameterization of orientations. This paper presents a new approach to the cooperative localization problem, namely distributed multi-robot localization. A group of M robots is viewed as a single system composed of robots that carry, in general, different sensors and have different positioning capabilities. A single Kalman filter is formulated to estimate the position and orientation of all the members of the group. This centralized schema is capable of fusing information provided by the sensors distributed on the individual robots while accommodating independencies and interdependencies among the collected data. In order to allow for distributed processing, the equations of the centralized Kalman filter are treated so that this filter can be decomposed into M modified Kalman filters each running on a separate robot. The distributed localization algorithm is applied to a group of 3 robots and the improvement in localization accuracy is presented. In this paper, we present a new approach to the problem of simultaneously localizing a group of mobile robots capable of sensing one another. Each of the robots collects sensor data regarding its own motion and shares this information with the rest of the team during the update cycles. A single estimator, in the form of a Kalman filter, processes the available positioning information from all the members of the team and produces a pose estimate for every one of them. The equations for this centralized estimator can be written in a decentralized form, therefore allowing this single Kalman filter to be decomposed into a number of smaller communicating filters. Each of these filters processes the sensor data collected by its host robot. Exchange of information between the individual filters is necessary only when two robots detect each other and measure their relative pose. The resulting decentralized estimation schema, which we call collective localization, constitutes a unique means for fusing measurements collected from a variety of sensors with minimal communication and processing requirements. The distributed localization algorithm is applied to a group of three robots and the improvement in localization accuracy is presented. Finally, a comparison to the equivalent decentralized information filter is provided. In this paper we investigate the problem of Simultaneous Localization and Mapping (SLAM) for a multi robot system. Relaxing some assumptions that characterize related work we propose an application of Rao-Blackwellized Particle Filters (RBPF) for the purpose of cooperatively estimating SLAM posterior. We consider a realistic setup in which the robots start from unknown initial poses (relative locations are unknown too), and travel in the environment in order to build a shared representation of the latter. The robots are required to exchange a small amount of information only when a rendezvous event occurs and to measure relative poses during the meeting. As a consequence the approach also applies when using an unreliable wireless channel or short range communication technologies (bluetooth, RFId, etc.). Moreover it allows to take into account the uncertainty in relative pose measurements. The proposed technique, which constitutes a distributed solution to the multi robot SLAM problem, is further validated through simulations and experimental tests.