Information-Theoretic Control of Multiple Sensor Platforms

This thesis is concerned with the development of a consistent, information-theoretic basis for understanding of coordination and cooperation decentralised multi-sensor multi-platform systems. Autonomous systems composed of multiple sensors and multiple platforms potentially have significant importance in applications such as defence, search and rescue mining or intelligent manufacturing. However, the effective use of multiple autonomous systems requires that an understanding be developed of the mechanisms of coordination and cooperation between component systems in pursuit of a common goal. A fundamental, quantitative, understanding of coordination and cooperation between decentralised autonomous systems is the main goal of this thesis. This thesis focuses on the problem of coordination and cooperation for teams of autonomous systems engaged in information gathering and data fusion tasks. While this is a subset of the general cooperative autonomous systems problem, it still encompasses a range of possible applications in picture compilation, navigation, searching and map building problems. The great advantage of restricting the domain of interest in this way is that an underlying mathematical model for coordination and cooperation can be based on the use of information-theoretic models of platform and sensor abilities. The information theoretic approach builds on the established principles and architecture previously developed for decentralised data fusion systems. In the decentralised control problem addressed in this thesis, each platform and sensor system is considered to be a distinct decision maker with an individual information-theoretic utility measure capturing both local objectives and the inter-dependencies among the decisions made by other members of the team. Together these information-theoretic utilities constitute the team objective. The key contributions of this thesis lie in the quantification and study of cooperative control between sensors and platforms using information as a common utility measure. In particular, * The problem of information gathering is formulated as an optimal control problem by identifying formal measures of information with utility or pay-off. * An information-theoretic utility model of coupling and coordination between decentralised decision makers is elucidated. This is used to describe how the information gathering strategies of a team of autonomous systems are coupled. * Static and dynamic information structures for team members are defined. It is shown that the use of static information structures can lead to efficient, although sub-optimal, decentralised control strategies for the team. * Significant examples in decentralised control of a team of sensors are developed. These include the multi-vehicle multi-target bearings-only tracking problem, and the area coverage or exploration problem for multiple vehicles. These examples demonstrate the range of non-trivial problems to which the theory in this thesis can be employed

Information-Theoretic Control of Multiple Sensor Platforms

This thesis is concerned with the development of a consistent, information-theoretic basis for understanding of coordination and cooperation decentralised multi-sensor multi-platform systems. Autonomous systems composed of multiple sensors and multiple platforms potentially have significant importance in applications such as defence, search and rescue mining or intelligent manufacturing. However, the effective use of multiple autonomous systems requires that an understanding be developed of the mechanisms of coordination and cooperation between component systems in pursuit of a common goal. A fundamental, quantitative, understanding of coordination and cooperation between decentralised autonomous systems is the main goal of this thesis. This thesis focuses on the problem of coordination and cooperation for teams of autonomous systems engaged in information gathering and data fusion tasks. While this is a subset of the general cooperative autonomous systems problem, it still encompasses a range of possible applications in picture compilation, navigation, searching and map building problems. The great advantage of restricting the domain of interest in this way is that an underlying mathematical model for coordination and cooperation can be based on the use of information-theoretic models of platform and sensor abilities. The information theoretic approach builds on the established principles and architecture previously developed for decentralised data fusion systems. In the decentralised control problem addressed in this thesis, each platform and sensor system is considered to be a distinct decision maker with an individual information-theoretic utility measure capturing both local objectives and the inter-dependencies among the decisions made by other members of the team. Together these information-theoretic utilities constitute the team objective. The key contributions of this thesis lie in the quantification and study of cooperative control between sensors and platforms using information as a common utility measure. In particular, * The problem of information gathering is formulated as an optimal control problem by identifying formal measures of information with utility or pay-off. * An information-theoretic utility model of coupling and coordination between decentralised decision makers is elucidated. This is used to describe how the information gathering strategies of a team of autonomous systems are coupled. * Static and dynamic information structures for team members are defined. It is shown that the use of static information structures can lead to efficient, although sub-optimal, decentralised control strategies for the team. * Significant examples in decentralised control of a team of sensors are developed. These include the multi-vehicle multi-target bearings-only tracking problem, and the area coverage or exploration problem for multiple vehicles. These examples demonstrate the range of non-trivial problems to which the theory in this thesis can be employed

Guaranteed Road Network Search with Small Unmanned Aircraft

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

Renyi Entropy based Target Tracking in Mobile Sensor Networks

This paper proposes an entropy based target tracking approach for mobile sensor networks. The proposed tracking algorithm runs a target state estimation stage and a motion control stage alternatively. A distributed particle filter is developed to estimate the target position in the first stage. This distributed particle filter does not require to transmit the weighted particles from one sensor node to another. Instead, a Gaussian mixture model is formulated to approximate the posterior distribution represented by the weighted particles via an EM algorithm. The EM algorithm is developed in a distributed form to compute the parameters of Gaussian mixture model via local communication, which leads to the distributed implementation of the particle filter. A flocking controller is developed to control the mobile sensor nodes to track the target in the second stage. The flocking control algorithm includes three components. Collision avoidance component is based on the design of a separation potential function. Alignment component is based on a consensus algorithm. Navigation component is based on the minimization of an quadratic Renyi entropy. The quadratic Renyi entropy of Gaussian mixture model has an analytical expression so that its optimization is feasible in mobile sensor networks. The proposed active tracking algorithm is tested in simulation. © 2011 IFAC

Cooperative Air and Ground Survaillance

Unmanned aerial vehicles (UAVs) can be used to cover large areas searching for targets. However, sensors on UAVs are typically limited in their accuracy of localization of targets on the ground. On the other hand, unmanned ground vehicles (UGVs) can be deployed to accurately locate ground targets, but they have the disadvantage of not being able to move rapidly or see through such obstacles as buildings or fences. In this article, we describe how we can exploit this synergy by creating a seamless network of UAVs and UGVs. The keys to this are our framework and algorithms for search and localization, which are easily scalable to large numbers of UAVs and UGVs and are transparent to the specificity of individual platforms. We describe our experimental testbed, the framework and algorithms, and some results

Formations of Localization of Robot Networks

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

Cooperative Air and Ground Surveillance

Unmanned aerial vehicles (UAVs) can be used to cover large areas searching for targets. However, sensors on UAVs are typically limited in their accuracy of localization of targets on the ground. On the other hand, unmanned ground vehicles (UGVs) can be deployed to accurately locate ground targets, but they have the disadvantage of not being able to move rapidly or see through such obstacles as buildings or fences. In this article, we describe how we can exploit this synergy by creating a seamless network of UAVs and UGVs. The keys to this are our framework and algorithms for search and localization, which are easily scalable to large numbers of UAVs and UGVs and are transparent to the specificity of individual platforms. We describe our experimental testbed, the framework and algorithms, and some results

Cooperative Control for Localization of Mobile Sensor Networks

In this paper, we consider the problem of cooperatively control a formation of networked mobile robots/vehicles to optimize the relative and absolute localization performance in 1D and 2D space. A framework for active perception is presented utilizing a graphical representation of sensory information obtained from the robot network. Performance measures are proposed that capture the estimate quality of team localization. We show that these measures directly depend on the sensing graph and shape of the formation. This dependence motivates implementation of a gradient based control scheme to adapt the formation geometry in order to optimize team localization performance. This approach is illustrated through application to a cooperative target localization problem involving a small robot team. Simulation results are presented using experimentally validated noise models

Proactive Highly Ambulatory Sensor Routing (PHASeR) protocol for mobile wireless sensor networks

This paper presents a novel multihop routing protocol for mobile wireless sensor networks called PHASeR (Proactive Highly Ambulatory Sensor Routing). The proposed protocol uses a simple hop-count metric to enable the dynamic and robust routing of data towards the sink in mobile environments. It is motivated by the application of radiation mapping by unmanned vehicles, which requires the reliable and timely delivery of regular measurements to the sink. PHASeR maintains a gradient metric in mobile environments by using a global TDMA MAC layer. It also uses the technique of blind forwarding to pass messages through the network in a multipath manner. PHASeR is analysed mathematically based on packet delivery ratio, average packet delay, throughput and overhead. It is then simulated with varying mobility, scalability and traffic loads. The protocol gives good results over all measures, which suggests that it may also be suitable for a wider array of emerging applications

Scaling in a continuous time model for biological aging

In this paper we consider a generalization to the asexual version of the Penna model for biological aging, where we take a continuous time limit. The genotype associated to each individual is an interval of real numbers over which Dirac $\delta$--functions are defined, representing genetically programmed diseases to be switched on at defined ages of the individual life. We discuss two different continuous limits for the evolution equation and two different mutation protocols, to be implemented during reproduction. Exact stationary solutions are obtained and scaling properties are discussed.Comment: 10 pages, 6 figure