The use of teams of small unmanned aircraft in real-world rapid-response missions is fast becoming a reality. One such application is search and detection of an evader in urban areas. This paper draws on results in graph-based pursuit-evasion, developing mappings from these abstractions to primitive motions that may be performed by aircraft, to produce search strategies providing guaranteed capture of road-bound targets. The first such strategy is applicable to evaders of arbitrary speed and agility, offering a conservative solution that is insensitive to motion constraints pursuers may possess. This is built upon to generate two strategies for capture of targets having a known speed bound that require searcher teams of much smaller size. The efficacy of these algorithms is demonstrated by evaluation in extensive simulation using realistic vehicle models across a spectrum of environment classes.

Geolocation of a ground object or target of interest from live video is a common task required of small and micro unmanned aerial vehicles (SUAVs and MAVs) in surveillance and rescue applications. However, such vehicles commonly carry low-cost and light-weight sensors providing poor bandwidth and accuracy whose contribution to observations is nonlinear, resulting in poor geolocation performance by standard techniques. This paper proposes the application of an efficient over-parameterized state representation to the problem of geolocation that is able to handle large, time-varying, and non-Gaussian sensor error to produce better geolocation estimates than typical approaches and which provides computing and communication benefits in applications such as predictive control and distributed collaboration. We evaluate our filter on real flight data, demonstrating its ability to efficiently produce a solution with tight confidence bounds given highly uncertain data.

This article compares several parameterizations and motion models for improving the estimation of the nonlinear uncertainty distribution produced by robot motion. In previous work, we have shown that the use of a modified polar parameterization provides a way to represent nonlinear measurements distributions in the Cartesian space as linear distributions in polar space. Following the same reasoning, we present a motion model extension that utilizes the same polar parameterization to achieve improved modeling of mobile robot motion in between measurements, gaining robustness with no additional overhead. We present both simulated and experimental results to validate the effectiveness of our approach.

A key problem in the deployment of sensor networks is that of determining the location of each sensor such that subsequent data gathered can be registered. We would also like the network to provide localization for mobile entities, allowing them to navigate and explore the environment. In this paper, we present a robust decentralized algorithm for mapping the nodes in a sparsely connected sensor network using range- only measurements and odometry from a mobile robot. Our approach utilizes an extended Kalman filter (EKF) in polar space allowing us to model the nonlinearities within the range-only measurements using Gaussian distributions. We also extend this unimodal centralized EKF to a multi-modal decentralized framework enabling us to accurately model the ambiguities in range-based position estimation. Each node within the network estimates its position along with its neighbor's position and uses a message-passing algorithm to propagate its belief to its neighbors. Thus, the global network localization problem is solved in pieces, by each node independently estimating its local network, greatly reducing the computation done by each node. We demonstrate the effectiveness of our approach using simulated and real-world experiments with little to no prior information about the node locations.

This paper concerns the problem of actively searching for and localizing ground features by a coordinated team of air and ground robotic sensor platforms. The approach taken builds on well known Decentralized Data Fusion (DDF) methodology. In particular, it brings together established representations developed for identification and linearized estimation problems to jointly address feature detection and localization. This provides transparent and scalable integration of sensor information from air and ground platforms. As in previous studies, an Information-theoretic utility measure and local control strategy drive the robots to uncertainty reducing team configurations. Complementary characteristics in terms of coverage and accuracy are revealed through analysis of the observation uncertainty for air and ground on-board cameras. Implementation results for a detection and localization example indicate the ability of this approach to scalably and efficiently realize such collaborative potential.

This paper addresses the problem of coordinating aerial and ground vehicles in tasks that involve exploration, identification of targets and maintaining a connected communication network. We focus on the problem of localizing vehicles in urban environments where GPS signals are often unreliable or unavailable. We first describe our multi-robot testbed and the control software used to coordinate ground and aerial vehicles. We present the results of experiments in air-ground localization analyzing three complementary approaches to determining the positions of vehicles on the ground. We show that the coordination of aerial vehicles with ground vehicles is necessary to get accurate estimates of the state of the system.

The paper presents a decentralized approach to the solution of the distributed information gathering problem. The main design objectives are scalability with the number of network components, maximum flexibility in implementation and deployment, and robustness to component and communication failure. The design approach emphasizes interactions between components rather than the definition of the components themselves. The architecture specifies a small set of interfaces sufficient to implement a wide range of information gathering systems. The results of two deployment scenarios on an indoor sensor network are presented.

In this paper, we consider the problem of cooperatively localizing a formation of networked mobile robots/vehicles in SE(2), and adapting the formation to reduce localization errors. First, we propose necessary and sufficient conditions to establish when a team of robots with heterogeneous sensors can be completely localized. We present experimental measurements of range and bearing with omni-directional cameras to motivate a simple model for noisy sensory information. We propose a measure of quality of team localization, and show how this measure directly depends on a sensing graph. Finally, we show how the formation and the sensing graph can be adapted to improve the measure of performance for team localization and for localization of targets through experiments and simulations.

This paper describes an information-theoretic approach to distributed and coordinated control of a multi-robot sensor system. The approach is based on techniques long established for the related problem of decentralised data fusion (DDF). The DDF architecture uses information measures to communicate state estimates in a network of sensors. For coordinated control of robot sensors, the control objective becomes maximisation of these information measures. This yields platform trajectories, which maximise the total information, gained by the system. This approach inherits the many benefits of the DDF method including scalability, robustness to sub-system failure and addition, and interoperability among heterogeneous systems. The approach is applied to a practical bearings-only multi-feature localisation problem.

Exploration involving mapping and concurrent localization in an unknown environment is a pervasive task in mobile robotics. In general, the accuracy of the mapping process depends directly on the accuracy of the localization process. This paper address the problem of maximizing the accuracy of the map building process during exploration by adaptively selecting control actions that maximize localisation accuracy. The map building and exploration task is modeled using an Occupancy Grid (OG) with concurrent localisation performed using a feature-based Simultaneous Localisation And Mapping (SLAM) algorithm. Adaptive sensing aims at maximizing the map information by simultaneously maximizing the expected Shannon information gain (Mutual Information) on the OG map and minimizing the uncertainty of the vehicle pose and map feature uncertainty in the SLAM process. The resulting map building system is demonstrated in an indoor environment using data from a laser scanner mounted on a mobile platform.