# Adrian Bishop

### Biography

Dr. Adrian N. Bishop is a Senior Research Fellow/Senior Lecturer in the Centre for Health Technologies and the School of Electrical, Mechanical and Mechatronic Systems.

Dr. Bishop is also a Senior Researcher at Data61 (CSIRO), Australian Technology Park in Sydney.

Dr. Bishop holds an ARC DECRA Fellowship and is supported by the ARC, NICTA/Data61, Boeing, and the US Air Force among other funding bodies.

Prior to joining UTS in 2014, Dr. Bishop held academic positions at the Australian National University (ANU) in Canberra, Australia and the Royal Institute of Technology (KTH) in Stockholm, Sweden.

**Senior Research Fellow,**School of Mechanical and Mechatronic Engineering

**Core Member,**CHT - Centre for Health Technologies

Ph.D.

**Can supervise:**Yes

## Conferences

Wang, Y., Yu, F., Bishop, A. & Yu, C. 2016, 'Adaptive tracking algorithm for a rigid spacecraft with input saturation',

View/Download from: Publisher's site

*Proceedings of the 28th Chinese Control and Decision Conference, CCDC 2016*, pp. 1605-1610.View/Download from: Publisher's site

© 2016 IEEE.In this paper, the tracking problem for a rigid spacecraft with input saturation is investigated. Due to the complexity of the dynamic of a rigid spacecraft, a hierarchical control scheme, dividing the model of a rigid spacecraft into translational level and attitude level, is designed. The controllers for translational dynamic and attitude dynamic of the six-freedom-degrees spacecraft are successively proposed respectively. The input saturation is also considered in designing the two controllers. For translational level, a kind of special saturation function is employed to get the controller whose amplitude is constrained. For the attitude dynamic, a new adaptive quaternion-based control scheme is proposed to withstand the effect of bounded uncertain items and input saturation. Finally, simulation results are provided to show the effectiveness of the proposed scheme.

Manuel, I.L., Bishop, A.N., Anderson, B.D.O. & Yu, C. 2016, 'Controlling the shape and scale of triangular formations using landmarks and bearing-only sensing',

View/Download from: UTS OPUS or Publisher's site

*Chinese Control Conference, CCC*, pp. 7532-7537.View/Download from: UTS OPUS or Publisher's site

© 2016 TCCT.This work considers the scenario where three agents that can sense only bearings use two landmarks to control their formation shape. We define a method of relating the known distance separating the landmarks back to the edge lengths of the triangular formation. The result is used to define a formation control law that incorporates inter-agent distance constraints. We prove a strong exponential convergence result and show how one can extend the controller such that global stability from any initial position is possible.

Deghat, M., Lampiri, E. & Bishop, A.N. 2016, 'Sensor Fault Detection for the Roll Dynamic Model of a Generic Delta-Wing Aircraft',

View/Download from: UTS OPUS or Publisher's site

*Proceedings of the 2016 Australian Control Conference (AUCC)*, Australian Control Conference (AuCC), IEEE, Newcastle, Australia, pp. 317-322.View/Download from: UTS OPUS or Publisher's site

This paper proposes a fault detection algorithm for the roll dynamic model of a generic delta-wing aircraft. It is assumed that the system model has some noise/uncertainties and the measured roll angle and roll rate used by the control law are faulty/under attack. The proposed fault detection algorithm employs a fault detection estimator and adaptive thresholds to detect the occurrence of a fault in the sensor measurements. Simulation results are presented to show the performance of the proposed algorithm.

Deghat, M. & Bishop, A.N. 2015, 'Distributed shape control and collision avoidance for multi-agent systems with bearing-only constraints',

View/Download from: Publisher's site

*2015 European Control Conference, ECC 2015*, pp. 2342-2347.View/Download from: Publisher's site

© 2015 EUCA.This paper looks at the design of a distributed control law to solve the formation shape control problem using bearing-only constraints in two-dimensional space while inter-agent collision between the neighbor agents is avoided. We assume each agent can measure the relative position and is only given the desired bearing (and not the distance) to its neighbors in some local coordinate system attached to the agent. We use a relaxed control law that allows each agent to move on any direction on a half-plane to achieve the desired formation shape, and impose some conditions on the motion of the agents such that no collision occurs between the neighbor agents. Simulation results are given that show the performance of the algorithm.

Bishop, A.N. 2014, 'Information fusion via the wasserstein barycenter in the space of probability measures: Direct fusion of empirical measures and Gaussian fusion with unknown correlation',

*FUSION 2014 - 17th International Conference on Information Fusion*. © 2014 International Society of Information Fusion.In this work, a general information fusion problem is formulated as an optimisation protocol in the space of probability measures (i.e. the so-called Wasserstein metric space). The highlevel idea is to consider the data fusion result as the probability measure that is closest to a given collection of input measures in the sense that it will minimise the (weighted) Wasserstein distance between itself and the inputs. After formulating the general information fusion protocol, we consider the explicit computation of the fusion result for two special scenarios that occur frequently in practical applications. Firstly, we show how one can compute the general outcome explicitly with two Gaussian input measures (ignoring any correlation). We then examine the consistency of this result for the scenario in which the two Gaussian inputs have an unknown (but possibly non-zero) correlation. Secondly, we show how one can compute the general fusion result explicitly given two randomly sampled (discrete) empirical measures which typically have no common underlying support. Data fusion with empirical measures as input has wide applicability in applications involving Monte Carlo estimation etc.

Bishop, A.N. & IEEE 2014, 'GOSSIP-BASED DISTRIBUTED DATA FUSION OF EMPIRICAL PROBABILITY MEASURES',

*2014 IEEE WORKSHOP ON STATISTICAL SIGNAL PROCESSING (SSP)*, pp. 372-375. Lan, H., Bishop, A.N., Pan, Q. & IEEE 2014, 'Distributed Joint Estimation and Identification for Sensor Networks with Unknown Inputs',

*2014 IEEE NINTH INTERNATIONAL CONFERENCE ON INTELLIGENT SENSORS, SENSOR NETWORKS AND INFORMATION PROCESSING (IEEE ISSNIP 2014)*. Jiang, B., Bishop, A.N., Anderson, B.D.O. & Drake, S.P. 2014, 'Path planning for minimizing detection',

*IFAC Proceedings Volumes (IFAC-PapersOnline)*, pp. 10200-10206. © IFAC.For a flying military vehicle, avoiding detection can be a key objective. To achieve this, flying the least-probability-of-detection path from A to B through a field of detectors is a fundamental strategy. While most of the previous optimization models aim to minimize the cumulative radar exposure, this paper derives a model that can directly minimize the probability of being detected. Furthermore, a variational dynamic programming method is applied to this model which allows one finding a precise local optimal path with low computational complexity. In addition, a homotopy method is derived to adjust the optimal path with exceptionally low computational complexity when the detection rate function changes due to the removal of detectors, the addition of detectors or the changes of understanding of detectors.

Bishop, A.N., Summers, T.H., Anderson, B.D.O. & IEEE 2013, 'Stabilization of Stiff Formations with a Mix of Direction and Distance Constraints',

*2013 IEEE INTERNATIONAL CONFERENCE ON CONTROL APPLICATIONS (CCA)*, pp. 1194-1199. Nguyen, D.T., Krishnamurthy, V., Bishop, A.N. & IEEE 2013, 'A Distributed Control Scheme for Triangular Formations with Markovian Disturbances',

*2013 IEEE INTERNATIONAL CONFERENCE ON CONTROL APPLICATIONS (CCA)*, pp. 1183-1187. Amirsadri, A., Bishop, A.N., Kim, J., Trumpf, J. & Petersson, L. 2013, 'Consistency analysis for data fusion: Determining when the unknown correlation can be ignored',

View/Download from: Publisher's site

*2013 International Conference on Control, Automation and Information Sciences, ICCAIS 2013*, pp. 97-102.View/Download from: Publisher's site

In this paper we examine the conditions in which data fusion can be performed by neglecting the unmodeled correlation between two information sources without compromising the consistency of the system. More specifically, we explore those situations in which one can disregard the correlation information and achieve a consistent estimate by simply adding the respective estimates' information matrices. This estimate will deliver considerably better performance than the widely employed Covariance Intersection (CI) algorithm in terms of estimation uncertainty. © 2013 IEEE.

Bishop, A.N. 2013, 'Stabilization and station keeping for angular constrained triangular formations on the ocean surface',

*Chinese Control Conference, CCC*, pp. 6850-6855. This paper considers the problem of distributed triangular formation control for a group of three agents positioned on the surface of the ocean and experiencing a non-zero mean offset velocity referred to as Stoke's drift. We provide a result which states simply that the agents converge to the desired formation shape and that the mean centre of mass for the agents is held stationary on the ocean surface. © 2013 TCCT, CAA.

Bishop, A.N., Summers, T.H., Anderson, B.D.O. & IEEE 2012, 'Control of Triangle Formations with a Mix of Angle and Distance Constraints',

*2012 IEEE INTERNATIONAL CONFERENCE ON CONTROL APPLICATIONS (CCA)*, pp. 825-830. Amirsadri, A., Bishop, A.N., Kim, J., Trumpf, J. & Petersson, L. 2012, 'A computationally efficient low-bandwidth method for very-large-scale mapping of road signs with multiple vehicles',

*15th International Conference on Information Fusion, FUSION 2012*, pp. 1351-1358. This paper provides a flexible solution to the problem of building and maintaining a very-large-scale map using multiple vehicles. In particular, we consider producing a map of landmarks on the scale of thousands of kilometres in an outdoor environment. The algorithm is distributed across multiple vehicles each given the task of producing and updating a local map. The vehicles are equipped with a range of sensors and selectively communicate maps to and from a central station in a bandwidth-constraint environment. The potentially overlapping local maps are asynchronously transmitted back to a central fusion centre where a global map repository is maintained. The work addresses two of the most common issues of mapping in large-scale environments, namely, computational complexity and limited communication bandwidth. The proposed communication architecture is scalable and is capable of dealing with time-varying overlapping map sizes. A general data fusion framework based on covariance intersection is proposed to tackle the problem of redundant information propagation that is caused by communicating sub-maps of arbitrary size in the network. We also provide an analysis on the applicability of covariance intersection, as compared to the optimal approach when no cross-correlation is known between estimates from different vehicles. We further analyse the solution using a number of illustrative examples. © 2012 ISIF (Intl Society of Information Fusi).

Bishop, A.N. 2012, 'Stochastic model validation and estimation for linear discrete-time systems with partial prior information',

View/Download from: Publisher's site

*IFAC Proceedings Volumes (IFAC-PapersOnline)*, pp. 427-431.View/Download from: Publisher's site

The problem of recursive estimation and model validation for linear discrete-time systems with partial prior information is examined. More specifically, an underlying linear discrete-time system is considered where the statistics of the driving noise is assumed to be known only partially; i.e. a class of noise inputs is given from which the underlying actual noise is assumed to be chosen. A set-valued estimator is then derived and the conditional expectation is shown to belong to an ellipsoidal set consistent with the measurements and the underlying noise description. When the underlying noise is consistent with the underlying partial model and a sequence of realized measurements is given then the ellipsoidal, set-valued, estimate is computable using a Kalman filter-type algorithm. The estimator inherently solves a stochastic model validation problem whereby it is possible to estimate the consistency between the assumed model, knowledge on the partial prior noise statistics and the measured data. © 2012 IFAC.

Bishop, A.N. 2012, 'False-Data Attacks in Stochastic Estimation Problems with Only Partial Prior Model Information',

*2012 INTERNATIONAL CONFERENCE ON CONTROL, AUTOMATION AND INFORMATION SCIENCES (ICCAIS)*, pp. 1-6. Shames, I. & Bishop, A.N. 2011, 'Noisy network localization via optimal measurement refinement part 2: Distance-only network localization',

View/Download from: Publisher's site

*IFAC Proceedings Volumes (IFAC-PapersOnline)*, pp. 8848-8853.View/Download from: Publisher's site

In this paper we review some results on the problem of noisy localization and review the characteristics of networks labeled as easily localizable networks. We then present a more general result on such networks before moving to the main problem of interest in this paper. That is, proposing computationally efficient algorithms to refine noisy distance measurements in easily localizable networks. © 2011 IFAC.

Bishop, A.N. 2011, 'A very relaxed control law for bearing-only triangular formation control',

View/Download from: Publisher's site

*IFAC Proceedings Volumes (IFAC-PapersOnline)*, pp. 5991-5998.View/Download from: Publisher's site

The problem of bearing-only triangular formation control is considered. Each agent measures two inter-agent bearings in a local coordinate system and is tasked with establishing, and maintaining, a desired angular separation relative to its neighbours (and consequently an overall desired shape). A distributed control law is designed for each agent that is based only on the agent's locally measured bearings. A strong convergence result is established which guarantees global exponential convergence of the formation to the desired shape. Despite the convergence guarantee, the controller is also relaxed in the sense that each agent can independently choose their control inputs within a large region of values. The proposed controller is robust to a single agent motion failure or a common group motion command. © 2011 IFAC.

Bishop, A.N. 2011, 'Distributed bearing-only quadrilateral formation control',

View/Download from: Publisher's site

*IFAC Proceedings Volumes (IFAC-PapersOnline)*, pp. 4507-4512.View/Download from: Publisher's site

A distributed control law for quadrilateral (four-agent) formation control with bearing-only measurements and relative pair-wise inter-agent angle constraints is introduced. A strong convergence result is established with ensures the desired formation configuration is globally asymptotically stable. In addition, it is shown that the distributed control law is generally robust to a single agent motion failure. Illustrative examples are provided to demonstrate the claims. © 2011 IFAC.

Shames, I. & Bishop, A.N. 2011, 'Distributed relative clock synchronization for wireless sensor networks',

View/Download from: Publisher's site

*IFAC Proceedings Volumes (IFAC-PapersOnline)*, pp. 11265-11270.View/Download from: Publisher's site

This paper considers an important problem in sensor networks, i.e. clock synchronization in wireless sensor networks with a focus on those scenarios where the inter-node time-of-arrival measurements are noisy. Initially, a simple convex, constraint based, optimization protocol for the problem of relative clock synchronization in wireless (sensor) networks is presented. Later, we provide a distributed discrete-time solution to the same problem and show exponential convergence. Then we provide a similar algorithm for achieving the same solution in continuous-time. Both the discrete-time algorithm and the continuous-time algorithm are distributed in that each node in the network requires very little information from its neighbours in the network. In the end, we provide a modification of the continuous time algorithm that achieves a finite-time convergence to the desired solution under some additional requirements. © 2011 IFAC.

Bishop, A.N. & Shames, I. 2011, 'Noisy network localization via optimal measurement refinement part 1: Bearing-only orientation registration and localization',

View/Download from: Publisher's site

*IFAC Proceedings Volumes (IFAC-PapersOnline)*, pp. 8842-8847.View/Download from: Publisher's site

The problem of localizing or tracking a number of targets using a network of bearing-only sensors is considered. To solve such a high-level problem, each sensor report must be successfully recorded in a common spatial reference frame and the position of the sensors must be determined. In practice, however, the reports from individual sensors are characterized by both random (called noise) and systematic errors (called biases). Typical bias errors are axis misalignments (due to azimuth and elevation biases) and range offset errors. Conditions under which the systematic errors can be removed given noisy measurements are examined in this work. In addition, certain conditions are identified which lend themselves naturally to the design of algorithms for network registration, localization and subsequently target localization. These conditions are feasible from a computational complexity point of view. This work provides a comprehensive solution to the problem of sensor network-based target localization with bearing measurements as very little a prior information is assumed known and, if certain sensing conditions are met, efficient algorithms are provided. © 2011 IFAC.

Shames, I., Bishop, A.N., Smith, M. & Anderson, B.D.O. 2011, 'Analysis of target velocity and position estimation via doppler-shift measurements',

*Proceedings of the 2011 Australian Control Conference, AUCC 2011*, pp. 507-512. This paper outlines the problem of doppler-based target position and velocity estimation using a sensor network. The minimum number of doppler shift measurements at distinct generic sensor positions to have a finite number of solutions, and later, a unique solution for the unknown target position and velocity is stated analytically, for the case when no measurement noise is present. Furthermore, we study the same problem where not only doppler shift measurements are collected, but also other types of measurements are available, e.g. bearing or distance to the target from each of the sensors. Subsequently, allowing nonzero measurement noise, we present an optimization method to estimate the position and the velocity of the target. An illustrative example is presented to show the validity of the analysis and the performance of the estimation method proposed. Some concluding remarks and future work directions are presented in the end. © 2011 ENGINEERS AUSTRALIA & AUSTRALIAN OPTICAL.

Bishop, A.N., Shames, I. & Anderson, B.D.O. 2011, 'Stabilization of rigid formations with direction-only constraints',

View/Download from: Publisher's site

*Proceedings of the IEEE Conference on Decision and Control*, pp. 746-752.View/Download from: Publisher's site

Direction-based formation shape control for a collection of autonomous agents involves the design of distributed control laws that ensure the formation moves so that certain relative bearing constraints achieve, and maintain, some desired value. This paper looks at the design of a distributed control scheme to solve the direction-based formation shape control problem. A gradient control law is proposed based on the notion of bearing-only constrained graph rigidity and parallel drawings. This work provides an interesting and novel contrast to much of the existing work in formation control where distance-only constraints are typically maintained. A stability analysis is sketched and a number of illustrative examples are also given. © 2011 IEEE.

Bishop, A.N. & Savkin, A.V. 2011, 'On false-data attacks in robust multi-sensor-based estimation',

View/Download from: Publisher's site

*IEEE International Conference on Control and Automation, ICCA*, pp. 10-17.View/Download from: Publisher's site

State estimation in critical networked infrastructure such as the transportation and electricity (smart grid) networks is becoming increasingly important. Consequently, the security of state estimation algorithms has been identified as an important design factor in order to safeguard critical infrastructure. In this paper we study false-data attacks on robust state estimation in multi-sensor-based systems. Specifically, we suppose there is a group of attacking entities that want to compromise the integrity of the state estimator by hijacking certain sensors and distorting their outputs. We consider an underlying class of uncertain (discrete-time) systems and we outline a decentralized set-valued state estimation algorithm that recursively produces an ellipsoidal set of all those state estimates consistent with the measurements and modelling assumptions. We then show that in order for the attack to go undetected, the distorted measurements need to be carefully designed. In particular, we compute a set of those measurements which are consistent with the modelling assumptions. This set then forms the basis for a test to detect false-data attacks and provides a quantitative measure of the resilience of the system to false-data attacks. We also briefly discuss how an attacker can design their false-data attack in some optimal fashion while ensuring it goes undetected. © 2011 IEEE.

Bishop, A.N. 2011, 'Distributed bearing-only formation control with four agents and a weak control law',

View/Download from: Publisher's site

*IEEE International Conference on Control and Automation, ICCA*, pp. 30-35.View/Download from: Publisher's site

A distributed control law for quadrilateral (four-agent) formation control with bearing-only measurements and relative pair-wise inter-agent angle constraints is introduced. The control law is weak in the sense that each agent is free to choose their own heading within a relatively large region of values. Indeed, the agents can determine their heading independently at run-time given any criteria they desire as long as certain relaxed conditions are met. A strong convergence result is established with ensures the desired formation configuration is globally asymptotically stable. Illustrative examples are provided to demonstrate the claims. © 2011 IEEE.

Bishop, A.N. 2011, 'A robust reachability review for control system security',

*Proceedings of the 2011 Australian Control Conference, AUCC 2011*, pp. 381-385. Control systems underpin the core technology in numerous critical infrastructure systems; e.g. the electricity, transportation and many defence systems. Increasingly, such systems are becoming the target of a novel type of deliberate cyber-attack. The notion of control system security is a modern idea concerned with the analysis, design and application of tools that ensure the operational goals of a particular control systems are protected from deliberate, malicious, electronic attack. The aim of this field is to reduce the likelihood of success, and the severity of impact, of a cyber-attack against control systems operating within critical infrastructure. This contribution reexamines a classical notion of control reachability through set-theoretic arguments with an additional, modern, emphasis on control system security. In particular, the reachability idea is extended to a compromised control system architecture. Classical and novel results on reachability are defined within this setting from the point-of-view of an attacker and, conversely, a system designer wanting to secure the system. The idea of reachability studied in this setting for secure control is important in both the design of robust control systems with security features and in assessing the vulnerability of particular control systems. © 2011 ENGINEERS AUSTRALIA & AUSTRALIAN OPTICAL.

Bishop, A.N. & Ristic, B. 2011, 'Fusion of natural language propositions: Bayesian random set framework',

*Fusion 2011 - 14th International Conference on Information Fusion*. This work concerns an automatic information fusion scheme for state estimation where the inputs (or measurements) that are used to reduce the uncertainty in the state of a subject are in the form of natural language propositions. In particular, we consider spatially referring expressions concerning the spatial location (or state value) of certain subjects of interest with respect to known anchors in a given state space. The probabilistic framework of random-set-based estimation is used as the underlying mathematical formalism for this work. Each statement is used to generate a generalized likelihood function over the state space. A recursive Bayesian filter is outlined that takes, as input, a sequence of generalized likelihood functions generated by multiple statements. The idea is then to recursively build a map, e.g. a posterior density map, over the state space that can be used to infer the subject state. © 2011 IEEE.

Bishop, A.N. 2011, 'Transmitter power estimation for uncooperative emitters with the Cayley-Menger determinant',

View/Download from: Publisher's site

*2011 19th Mediterranean Conference on Control and Automation, MED 2011*, pp. 1166-1169.View/Download from: Publisher's site

The problem of estimating the transmission power levels of an uncooperative radio transmitter is examined in this short paper. The Cayley-Menger matrix is shown to provide an underlying geometrical constraint on the possible solutions and is subsequently used in a novel fashion as the basis for an estimator of the transmission power. © 2011 IEEE.

Pronobis, A., Sjöö, K., Aydemir, A., Bishop, A.N. & Jensfelt, P. 2010, 'Representing spatial knowledge in mobile cognitive systems',

View/Download from: Publisher's site

*Intelligent Autonomous Systems 11, IAS 2010*, pp. 133-142.View/Download from: Publisher's site

A cornerstone for cognitive mobile agents is to represent the vast body of knowledge about space in which they operate. In order to be robust and efficient, such representation must address requirements imposed on the integrated system as a whole, but also resulting from properties of its components. In this paper, we carefully analyze the problem and design a structure of a spatial knowledge representation for a cognitive mobile system. Our representation is layered and represents knowledge at different levels of abstraction. It deals with complex, crossmodal, spatial knowledge that is inherently uncertain and dynamic. Furthermore, it incorporates discrete symbols that facilitate communication with the user and components of a cognitive system. We present the structure of the representation and propose concrete instantiations. © 2010 IOS Press.

Bishop, A.N. 2010, 'Gaussian-sum-based probability hypothesis density filtering with delayed and out-of-sequence measurements',

View/Download from: Publisher's site

*18th Mediterranean Conference on Control and Automation, MED'10 - Conference Proceedings*, pp. 1423-1428.View/Download from: Publisher's site

The problem of multiple-sensor-based multipleobject tracking is studied for adverse environments involving clutter (false positives), missing measurements (false negatives) and random target births and deaths (a priori unknown target numbers). Various (potentially spatially separated) sensors are assumed to generate signals which are sent to the estimator via parallel channels which incur independent delays. These signals may arrive out of order, be corrupted or even lost. In addition, there may be periods when the estimator receives no information. A closed-form, recursive solution to the considered problem is detailed that generalizes the Gaussian-mixture probability hypothesis density (GM-PHD) filter previously detailed in the literature. This generalization allows the GM-PHD framework to be applied in more realistic network scenarios involving not only transmission delays but rather more general irregular measurement sequences where particular measurements from some sensors can arrive out of order with respect to the generating sensor and also with respect to the signals generated by the other sensors in the network. © 2010 IEEE.

Bishop, A.N., Basiri, M. & IEEE 2010, 'Bearing-Only Triangular Formation Control on the Plane and the Sphere',

View/Download from: Publisher's site

*18TH MEDITERRANEAN CONFERENCE ON CONTROL AND AUTOMATION*, pp. 790-795.View/Download from: Publisher's site

Bishop, A.N. & Shames, I. 2010, 'A model for optimal and robust control with time-varying computing constraints',

View/Download from: Publisher's site

*Proceedings of the 2010 6th International Conference on Intelligent Sensors, Sensor Networks and Information Processing, ISSNIP 2010*, pp. 217-222.View/Download from: Publisher's site

We introduce a discrete-time Markov switching system control model for a control algorithm that is executed on a device with time-varying computing resources. We outline the stability expressions for a number of linear control scenarios and we illustrate their dependence on the time-varying computing power transition probabilities. © 2010 IEEE.

Bishop, A.N. 2010, 'Probability hypothesis density filtering with sensor networks and irregular measurement sequences',

*13th Conference on Information Fusion, Fusion 2010*. The problem of multi-object tracking with sensor networks is studied using the probability hypothesis density filter. The sensors are assumed to generate signals which are sent to an estimator via parallel channels which incur independent delays. These signals may arrive out-of-order (out-of-sequence), be corrupted or even lost due to, e.g., noise in the communication medium and protocol malfunctions. In addition, there may be periods when the estimator receives no information. A closed-form, recursive solution to the considered problem is detailed that generalizes the Gaussian-mixture probability hypothesis density (GM-PHD) filter previously detailed in the literature.

Bishop, A.N. 2010, 'A tutorial on indoor wireless positioning with anonymous beacons using random-finite-set statistics',

View/Download from: Publisher's site

*IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC*, pp. 228-232.View/Download from: Publisher's site

The problem of global positioning using a rigorous Bayesian framework based on the theory of random finite sets and their corresponding density functions is covered in this condensed tutorial. The positioning scenario considered involves a number of anonymous beacons with known position relative to which the agent can measure its position. Since the beacons are anonymous, determining the agents position relative to a single (and even multiple in some cases) beacon is ambiguous. However, by exploiting the mobility of the agent through the environment, it is shown that it is possible to converge to an unambiguous position estimate. Random sets allow one to naturally develop a complete model of the underlying problem which accounts for the statistics of missed detections (due to signal weakness/blocking etc) and of spurious/erroneously detected beacons (due to potentially unmodeled beacons and/or reflected/multi-path signals). Following the derivation of a complete Bayesian solution, we outline a first-order statistical moment approximation, the so called probability hypothesis density filter. ©2010 IEEE.

Bishop, A.N. & IEEE 2010, 'A Tutorial on Constraints for Positioning on the Plane',

View/Download from: Publisher's site

*2010 IEEE 21ST INTERNATIONAL SYMPOSIUM ON PERSONAL INDOOR AND MOBILE RADIO COMMUNICATIONS (PIMRC)*, pp. 1689-1694.View/Download from: Publisher's site

Bishop, A.N. 2010, 'Random-Set-Based Estimation in Networked Environments and a Relationship to Kalman Filtering with Intermittent Observations',

View/Download from: Publisher's site

*IFAC Proceedings Volumes (IFAC-PapersOnline)*, pp. 97-102.View/Download from: Publisher's site

Firstly, an exposition of random-set-based estimation in general networked control systems is examined. This provides a background for the work introduced in this paper. This exposition is also aimed at highlighting the advantages of the random-set-based estimator formulation. Then, the case of state estimation across packet-dropping networks (but with instantaneous transmission times) is shown to be a special case of the standard random-set-based system/measurement model. A well-known result in the control literature concerning the convergence of the Kalman filter's covariance estimate is related to a simplified random-set-based algorithm for this packet-dropping scenario. Finally, a novel algorithm for random-set-based estimation across general networks with irregular measurement sequences (delayed and out-of-sequence measurements) is developed. This is the first attempt to extend random-set-based estimation to accommodate realistic, networked, scenarios. © 2010 IFAC.

Bishop, A.N. & Jensfelt, P. 2010, 'Global robot localization with random finite set statistics',

*13th Conference on Information Fusion, Fusion 2010*. We re-examine the problem of global localization of a robot using a rigorous Bayesian framework based on the idea of random finite sets. Random sets allow us to naturally develop a complete model of the underlying problem accounting for the statistics of missed detections and of spurious/erroneously detected (potentially unmodeled) features along with the statistical models of robot hypothesis disappearance and appearance. In addition, no explicit data association is required which alleviates one of the more difficult sub-problems. Following the derivation of the Bayesian solution, we outline its first-order statistical moment approximation, the so called probability hypothesis density filter. We present a statistical estimation algorithm for the number of potential robot hypotheses consistent with the accumulated evidence and we show how such an estimate can be used to aid in re-localization of kidnapped robots. We discuss the advantages of the random set approach and examine a number of illustrative simulations.

Aydemir, A., Bishop, A.N. & Jensfelt, P. 2010, 'Simultaneous object class and pose estimation for mobile robotic applications with minimalistic recognition',

View/Download from: Publisher's site

*Proceedings - IEEE International Conference on Robotics and Automation*, pp. 2020-2027.View/Download from: Publisher's site

In this paper we address the problem of simultaneous object class and pose estimation using nothing more than object class label measurements from a generic object classifier. We detail a method for designing a likelihood function over the robot configuration space. This function provides a likelihood measure of an object being of a certain class given that the robot (from some position) sees and recognizes an object as being of some (possibly different) class. Using this likelihood function in a recursive Bayesian framework allows us to achieve a kind of spatial averaging and determine the object pose (up to certain ambiguities to be made precise). We show how inter-class confusion from certain robot viewpoints can actually increase the ability to determine the object pose. Our approach is motivated by the idea of minimalistic sensing since we use only class label measurements albeit we attempt to estimate the object pose in addition to the class. ©2010 IEEE.

Bishop, A.N. & Smith, M. 2010, 'Remarks on the Cramer-Rao inequality for Doppler-based target parameter estimation',

View/Download from: Publisher's site

*Proceedings of the 2010 6th International Conference on Intelligent Sensors, Sensor Networks and Information Processing, ISSNIP 2010*, pp. 199-204.View/Download from: Publisher's site

This paper outlines the problem of multi-static Doppler-based target position and velocity estimation. The Fisher information matrix is derived given a separate target illuminator and then given a target-based isotropic signal emission. Some remarks concerning the Cramer-Rao inequality and its relationship to the estimation problem are given. Some results concerning the placement of the receivers are given and some open problems are discussed. © 2010 IEEE.

Basiri, M., Bishop, A.N. & Jensfelt, P. 2009, 'Distributed control of triangular sensor formations with angle-only constraints',

View/Download from: Publisher's site

*ISSNIP 2009 - Proceedings of 2009 5th International Conference on Intelligent Sensors, Sensor Networks and Information Processing*, pp. 121-126.View/Download from: Publisher's site

This paper considers the coupled formation control of three mobile agents moving in the plane. Each agent has only local inter-agent bearing knowledge and is required to maintain a specified angular separation relative to its neighbors. The problem considered in this paper differs from similar problems in the literature since no inter-agent distance measurements are employed and the desired formation is specified entirely by the internal triangle angles. Each agent's control law is distributed and based only on its locally measured bearings. A convergence result is established which guarantees global convergence of the formation to the desired formation shape. © 2009 IEEE.

Boberg, A., Bishop, A.N. & Jensfelt, P. 2009, 'Robocentric mapping and localization in modified spherical coordinates with bearing measurements',

View/Download from: Publisher's site

*ISSNIP 2009 - Proceedings of 2009 5th International Conference on Intelligent Sensors, Sensor Networks and Information Processing*, pp. 139-144.View/Download from: Publisher's site

In this paper, a new approach to robotic mapping is presented that uses modified spherical coordinates in a robot-centered reference frame and a bearing-only measurement model. The algorithm provided in this paper permits robust delay-free state initialization and is computationally more efficient than the current standard in bearing-only (delay-free initialized) simultaneous localization and mapping (SLAM). Importantly, we provide a detailed nonlinear observability analysis which shows the system is generally observable. We also analyze the error convergence of the filter using stochastic stability analysis. We provide an explicit bound on the asymptotic mean state estimation error. A comparison of the performance of this filter is also made against a standard world-centric SLAM algorithm in a simulated environment. © 2009 IEEE.

Pronobis, A., Sjöö, K., Aydemir, A., Bishop, A.N. & Jensfelt, P. 2009, 'A framework for robust cognitive spatial mapping',

*2009 International Conference on Advanced Robotics, ICAR 2009*. Spatial knowledge constitutes a fundamental component of the knowledge base of a cognitive, mobile agent. This paper introduces a rigorously defined framework for building a cognitive spatial map that permits high level reasoning about space along with robust navigation and localization. Our framework builds on the concepts of places and scenes expressed in terms of arbitrary, possibly complex features as well as local spatial relations. The resulting map is topological and discrete, robocentric and specific to the agent's perception. We analyze spatial mapping design mechanics in order to obtain rules for how to define the map components and attempt to prove that if certain design rules are obeyed then certain map properties are guaranteed to be realized. The idea of this paper is to take a step back from existing algorithms and literature and see how a rigorous formal treatment can lead the way towards a powerful spatial representation for localization and navigation. We illustrate the power of our analysis and motivate our cognitive mapping characteristics with some illustrative examples.

Bishop, A.N. & Jensfelt, P. 2009, 'An optimality analysis of sensor-target geometries for signal strength based localization',

View/Download from: Publisher's site

*ISSNIP 2009 - Proceedings of 2009 5th International Conference on Intelligent Sensors, Sensor Networks and Information Processing*, pp. 127-132.View/Download from: Publisher's site

In this paper we characterize the bounds on localization accuracy in signal strength based localization. In particular, we provide a novel and rigorous analysis of the relative receiver-transmitter geometry and the effect of this geometry on the potential localization performance. We show that uniformly spacing sensors around the target is not optimal if the sensor-target ranges are not identical and is not necessary in any case. Indeed, we show that in general the optimal sensor-target geometry for signal strength based localization is not unique. © 2009 IEEE.

Pathirana, P.N., Bishop, A.N., Savkin, A.V., Ekanayake, S.W. & Bauer, N.J. 2009, 'A robust set-valued state estimation approach to the problem of vision based SLAM for mobile robots',

*2009 European Control Conference, ECC 2009*, 2009 European on Control Conference (ECC), Institute of Electrical and Electronics Engineers Inc., Budapest, Hungary, pp. 2798-2803. The problem of visual simultaneous localization and mapping (SLAM) is examined in this paper using ideas and algorithms from robust control and estimation theory. Using a stereo-vision based sensor, a nonlinear measurement model is derived which leads to nonlinear measurements of the landmark coordinates along with optical flow based measurements of the relative robot-landmark velocity. Using a novel analytical measurement transformation, the nonlinear SLAM problem is converted into the linear domain and solved using a robust linear filter. The linear filter is guaranteed stable and the SLAM state estimation error is bounded within an ellipsoidal set. No similar results are available for the commonly employed extended Kalman filter which is known to exhibit divergence and inconsistency characteristics in practice.

Bishop, A.N., Savkin, A.V. & Pathirana, P.N. 2007, 'Vision based target tracking using robust linear filtering',

*2007 European Control Conference, ECC 2007*, 2007 European Control Conference (ECC), Institute of Electrical and Electronics Engineers Inc., Kos, pp. 1442-1447. The use of perspective projection in tracking a target from a video stream involves nonlinear observations. The target dynamics, however, are modeled in Cartesian coordinates and result in a linear system. In this paper we provide a robust version of a linear Kalman filter and perform a measurement conversion technique on the nonlinear optical measurements. We show that our linear robust filter significantly outperforms the Extended Kalman Filter. Moreover, we prove that the state estimation error is bounded in a probabilistic sense.

Pathirana, P.N., Bishop, A.N., Savkin, A.V., Ekanayake, S.W., Black, T.J. & IEEE 2008, 'A Method for Stereo-Vision based tracking for robotic applications',

*47TH IEEE CONFERENCE ON DECISION AND CONTROL, 2008 (CDC 2008)*, pp. 1298-1303. Bishop, A.N., Pathirana, P.N. & IEEE 2008, 'Optimal trajectory characterization for a pursuer navigation scheme',

View/Download from: Publisher's site

*PROCEEDINGS OF 2008 IEEE INTERNATIONAL CONFERENCE ON NETWORKING, SENSING AND CONTROL, VOLS 1 AND 2*, pp. 998-1003.View/Download from: Publisher's site

Pathirana, P.N., Bishop, A.N., Savkin, A.V. & IEEE 2008, 'Localization of Mobile Transmitters by Means of Linear State Estimation Using RSS Measurements',

View/Download from: Publisher's site

*2008 10TH INTERNATIONAL CONFERENCE ON CONTROL AUTOMATION ROBOTICS & VISION: ICARV 2008, VOLS 1-4*, pp. 210-213.View/Download from: Publisher's site

Bishop, A.N., Pathirana, P.N. & IEEE 2008, 'Trajectory Characterizations for a Discrete-Time Bearing-Only Navigation Strategy',

*2008 MEDITERRANEAN CONFERENCE ON CONTROL AUTOMATION, VOLS 1-4*, pp. 1134-1139. Bishop, A.N. & Pathirana, P.N. 2008, 'Trajectory characterizations for a discrete-time bearing-only navigation strategy',

View/Download from: Publisher's site

*2008 Mediterranean Conference on Control and Automation - Conference Proceedings, MED'08*, pp. 1186-1191.View/Download from: Publisher's site

In this paper we explore the geometry of a particular navigation scheme which guides a pursuer from a fixed initial position to a given fixed final position using a one-step look ahead strategy and using only bearing measurements. We explicitly characterize the optimal trajectories for the problem in terms of the Cramer-Rao bound such that the derived trajectories permit a minimization in the error of an unbiased estimate of the target position. © 2008 IEEE.

Bishop, A.N., Fidan, B., Anderson, B.D.O., Pathirana, P.N. & Dogancay, K. 2007, 'Optimality analysis of sensor-target geometries in passive localization: Part 2 - Time-of-arrival based localization',

View/Download from: Publisher's site

*PROCEEDINGS OF THE 2007 INTERNATIONAL CONFERENCE ON INTELLIGENT SENSORS, SENSOR NETWORKS AND INFORMATION PROCESSING*, pp. 13-18.View/Download from: Publisher's site

Bishop, A.N., Fidan, B., Anderson, B.D.O., Dogancay, K. & Pathirana, P.N. 2007, 'Optimality analysis of sensor-target geometries in passive localization: Part 1 - Bearing-only localization',

View/Download from: Publisher's site

*PROCEEDINGS OF THE 2007 INTERNATIONAL CONFERENCE ON INTELLIGENT SENSORS, SENSOR NETWORKS AND INFORMATION PROCESSING*, pp. 7-12.View/Download from: Publisher's site

Bishop, A.N., Pathirana, P.N. & Savkin, A.V. 2007, 'Target tracking with range and bearing measurements via robust linear filtering',

*PROCEEDINGS OF THE 2007 INTERNATIONAL CONFERENCE ON INTELLIGENT SENSORS, SENSOR NETWORKS AND INFORMATION PROCESSING*, pp. 131-135. Bishop, A.N., Pathirana, P.N., Fidan, B., Anderson, B.D.O., Ma, G. & IEEE 2007, 'Passive angle measurement based localization consistency via geometric constraints',

*2007 Information Decision and Control*, pp. 149-154. Pathirana, P.N., Bishop, A.N. & Savkin, A.V. 2007, 'Stereo-vision-based moving object tracking via robust linear filtering', *PROCEEDINGS OF THE 2007 INTERNATIONAL CONFERENCE ON INTELLIGENT SENSORS, SENSOR NETWORKS AND INFORMATION PROCESSING*, pp. 221-226.

View/Download from: Publisher's site

View/Download from: Publisher's site

Bishop, A.N., Pathirana, P.N. & IEEE 2006, 'Robust parallel filtering design of a swarm tracking system',

View/Download from: Publisher's site

*PROCEEDINGS OF THE 45TH IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-14*, pp. 6769-6775.View/Download from: Publisher's site

Bishop, A.N., Pathirana, P.N. & IEEE 2006, 'Robust parallel filtering for mobile agent tracking',

*2006 9th International Conference on Control, Automation, Robotics and Vision, Vols 1- 5*, pp. 1504-1510. Bishop, A.N. & Pathirana, P.N. 2006, 'A discussion on passive location discovery in emitter networks using angle-only measurements',

View/Download from: Publisher's site

*IWCMC 2006 - Proceedings of the 2006 International Wireless Communications and Mobile Computing Conference*, pp. 1337-1343.View/Download from: Publisher's site

In this paper we discuss the ghost node problem found when triangulation of 2 or more nodes is required. We present and discuss a simple algorithm, termed ABLE (Angle Based Location Estimation), that will position randomly placed emitters in a wireless sensor network using a mobile antenna array. The individual nodes in the network are relieved of the localization task by the mobile antenna system and require no modifications to account for location determination. Furthermore, no beacon nodes (i.e. nodes that know their own position) are required. We provide analysis that indicates a reasonably small number of measurements are required to guarantee the successful localization of the emitting nodes and demonstrate our results through simulation. Copyright 2006 ACM.

Bishop, A.N. & Doucet, A. 2014, 'Distributed Nonlinear Consensus in the Space of Probability Measures', The 19th IFAC World Congress, Cape Town, South Africa, pp. 8662-8668.

View/Download from: UTS OPUS or Publisher's site

View/Download from: UTS OPUS or Publisher's site

Manuel, I.L. & Bishop, A.N. 2014, 'Distributed Monte Carlo Information Fusion and Distributed Particle Filtering', The 19th IFAC World Congress, Cape Town, South Africa, pp. 8681-8688.

View/Download from: UTS OPUS or Publisher's site

View/Download from: UTS OPUS or Publisher's site

## Journal articles

Shao, J., Qin, J., Bishop, A.N., Huang, T.Z. & Zheng, W.X. 2016, 'A novel analysis on the efficiency of hierarchy among leader-following systems',

View/Download from: Publisher's site

*Automatica*, vol. 73, pp. 215-222.View/Download from: Publisher's site

© 2016 Elsevier LtdIn a recent NATURE paper, Nagy et al. find a well-defined hierarchy among the individuals of the pigeon flock, which may lead to a rapid decision making in the directional choice dynamics of the flock. Motivated by this interesting discovery, we present a novel analysis on the efficiency of the hierarchical topology among the leader-following systems in this paper. To this end, we first propose a measurement of the convergence rate of leader-following consensus, and then connect the convergence rates with the communication topologies of leader-following systems. It is proved that the hierarchical network organization can achieve the best performance in terms of convergence rates. It is also established that the connections between the leader and the followers have effective impacts on increasing the convergence rates. Extensive numerical results are provided to show the effectiveness of our conclusions.

Bishop, A.N., Deghat, M., Anderson, B.D.O. & Hong, Y. 2015, 'Distributed formation control with relaxed motion requirements',

View/Download from: Publisher's site

*International Journal of Robust and Nonlinear Control*, vol. 25, no. 17, pp. 3210-3230.View/Download from: Publisher's site

Heterogeneous formation shape control with interagent bearing and distance constraints involves the design of a distributed control law that ensures the formation moves such that these interagent constraints are achieved and maintained. This paper looks at the design of a distributed control scheme to solve different formation shape control problems in an ambient two-dimensional space with bearing, distance and mixed bearing and distance constraints. The proposed control law allows the agents in the formation to move in any direction on a half-plane and guarantees that despite this freedom, the proposed shape control algorithm ensures convergence to a formation shape meeting the prescribed constraints. This work provides an interesting and novel contrast to much of the existing work in formation control where distance-only constraints are typically maintained and where each agent's motion is typically restricted to follow a very particular path. A stability analysis is sketched, and a number of illustrative examples are also given

Jiang, B., Bishop, A.N., Anderson, B.D.O. & Drake, S.P. 2015, 'Optimal path planning and sensor placement for mobile target detection',

View/Download from: Publisher's site

*AUTOMATICA*, vol. 60, pp. 127-139.View/Download from: Publisher's site

Bertoli, F. & Bishop, A.N. 2015, 'Monte Carlo Methods for Controller Approximation and Stabilization in Nonlinear Stochastic Optimal Control',

View/Download from: Publisher's site

*IFAC-PapersOnLine*, vol. 48, no. 28, pp. 811-816.View/Download from: Publisher's site

© 2015An approximation method for receding horizon optimal control, in nonlinear stochastic systems, is considered in this work. This approximation method is based on Monte Carlo simulation and derived via the Feynman-Kac formula, which gives a stochastic interpretation for the solution of a Hamilton-Jacobi-Bellman equation associated with the true optimal controller. It is shown that this controller approximation method practically stabilises the system over an infinite horizon and thus the controller approximation errors do not accumulate or lead to instability over time.

Bishop, A.N. & Savkin, A.V. 2013, 'Set-Valued State Estimation and Attack Detection for Uncertain Descriptor Systems',

View/Download from: Publisher's site

*IEEE SIGNAL PROCESSING LETTERS*, vol. 20, no. 11, pp. 1102-1105.View/Download from: Publisher's site

Bishop, A.N. & Ristic, B. 2013, 'Fusion of Spatially Referring Natural Language Statements with Random Set Theoretic Likelihoods',

*IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS*, vol. 49, no. 2, pp. 932-944. Shames, I., Bishop, A.N., Smith, M. & Anderson, B.D.O. 2013, 'Doppler shift target localization',

View/Download from: Publisher's site

*IEEE Transactions on Aerospace and Electronic Systems*, vol. 49, no. 1, pp. 266-276.View/Download from: Publisher's site

The problem of Doppler-based target position and velocity estimation using a sensor network is outlined. The minimum number of Doppler-shift measurements at distinct generic sensor positions in order to have a finite number of solutions, and later, a unique solution for the unknown target position and velocity are stated analytically. Furthermore we study the same problem, where not only Doppler-shift measurements are collected, but also other types of measurements are available, e.g,. bearing or distance to the target from each of the sensors. Later we study the Cramer-Rao inequality associated with the Doppler-shift measurements to a target in a sensor network, and we use the Cramer-Rao bound to illustrate some results on optimal placements of the sensors when the goal is to estimate the velocity of the target. Some simulation results are presented at the end. © 1965-2011 IEEE.

Shames, I., Bishop, A.N. & Anderson, B.D.O. 2013, 'Analysis of Noisy Bearing-Only Network Localization',

View/Download from: Publisher's site

*IEEE TRANSACTIONS ON AUTOMATIC CONTROL*, vol. 58, no. 1, pp. 247-252.View/Download from: Publisher's site

Bishop, A.N. & Shames, I. 2011, 'Link operations for slowing the spread of disease in complex networks',

View/Download from: Publisher's site

*EPL*, vol. 95, no. 1.View/Download from: Publisher's site

Shames, I. & Bishop, A.N. 2010, 'Relative clock synchronization in wireless networks',

View/Download from: Publisher's site

*IEEE Communications Letters*, vol. 14, no. 4, pp. 348-350.View/Download from: Publisher's site

© 2010 IEEE.This letter introduces a simple convex, constraint based, optimization protocol for the problem of relative clock synchronization in wireless (sensor) networks.

Bishop, A.N., Fidan, B., Anderson, B.D.O., Dogancay, K. & Pathirana, P.N. 2010, 'Optimality analysis of sensor-target localization geometries',

View/Download from: Publisher's site

*AUTOMATICA*, vol. 46, no. 3, pp. 479-492.View/Download from: Publisher's site

Bishop, A.N., Savkin, A.V. & Pathirana, P.N. 2010, 'Vision-Based Target Tracking and Surveillance With Robust Set-Valued State Estimation',

View/Download from: Publisher's site

*IEEE SIGNAL PROCESSING LETTERS*, vol. 17, no. 3, pp. 289-292.View/Download from: Publisher's site

Basiri, M., Bishop, A.N. & Jensfelt, P. 2010, 'Distributed control of triangular formations with angle-only constraints',

View/Download from: Publisher's site

*Systems and Control Letters*, vol. 59, no. 2, pp. 147-154.View/Download from: Publisher's site

This paper considers the coupled, bearing-only formation control of three mobile agents moving in the plane. Each agent has only local inter-agent bearing knowledge and is required to maintain a specified angular separation relative to both neighbor agents. Assuming that the desired angular separation of each agent relative to the group is feasible, a triangle is generated. The control law is distributed and accordingly each agent can determine their own control law using only the locally measured bearings. A convergence result is established in this paper which guarantees global asymptotic convergence of the formation to the desired formation shape. © 2009 Elsevier B.V. All rights reserved.

Pathirana, P.N., Bishop, A.N., Savkin, A.V., Ekanayake, S.W. & Black, T.J. 2010, 'A method for stereo-vision-based tracking for robotic applications',

View/Download from: Publisher's site

*ROBOTICA*, vol. 28, pp. 517-524.View/Download from: Publisher's site

Bishop, A.N., Anderson, B., Fidan, B., Pathirana, P. & Mao, G. 2009, 'Bearing-Only Localization using Geometrically Constrained Optimization',

View/Download from: UTS OPUS or Publisher's site

*IEEE Transactions On Aerospace And Electronic Systems*, vol. 45, no. 1, pp. 308-320.View/Download from: UTS OPUS or Publisher's site

We examine the problem of optimal bearing-only localization of a single target using synchronous measurements from multiple sensors. We approach the problem by forming geometric relationships between the measured parameters and their corresponding errors in the relevant emitter localization scenarios. Specifically, we derive a geometric constraint equation on the measurement errors in such a scenario. Using this constraint, we formulate the localization task as a constrained optimization problem that can be performed on the measurements in order to provide the optimal values such that the solution is consistent with the underlying geometry. We illustrate and confirm the advantages of our approach through simulation, offering detailed comparison with traditional maximum likelihood (TML) estimation.

Bishop, A.N., Fidan, B., Dogancay, K., Anderson, B.D.O. & Pathirana, P.N. 2008, 'Exploiting geometry for improved hybrid AOA/TDOA-based localization',

View/Download from: Publisher's site

*SIGNAL PROCESSING*, vol. 88, no. 7, pp. 1775-1791.View/Download from: Publisher's site

Bishop, A.N., Fidan, B., Anderson, B.D.O., Dogancay, K. & Pathirana, P.N. 2008, 'Optimal Range-Difference-Based Localization Considering Geometrical Constraints',

View/Download from: Publisher's site

*IEEE JOURNAL OF OCEANIC ENGINEERING*, vol. 33, no. 3, pp. 289-301.View/Download from: Publisher's site

Bishop, A.N., Pathirana, P.N. & Savkin, A.V. 2007, 'Radar target tracking via robust linear filtering',

View/Download from: Publisher's site

*IEEE SIGNAL PROCESSING LETTERS*, vol. 14, no. 12, pp. 1028-1031.View/Download from: Publisher's site

Bishop, A.N. & Pathirana, P.N. 2007, 'Localization of emitters via the intersection of bearing lines: A ghost elimination approach',

View/Download from: Publisher's site

*IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY*, vol. 56, no. 5, pp. 3106-3110.View/Download from: Publisher's site

Bertoli, F. & Bishop, A.N., 'Nonlinear Stochastic Receding Horizon Control: Stability, Robustness and Monte Carlo Methods for Control Approximation'.

This work considers the stability of nonlinear stochastic receding horizon
control when the optimal controller is only computed approximately. A number of
general classes of controller approximation error are analysed including
deterministic and probabilistic errors and even controller sample and hold
errors. In each case, it is shown that the controller approximation errors do
not accumulate (even over an infinite time frame) and the process converges
exponentially fast to a small neighbourhood of the origin. In addition to this
analysis, an approximation method for receding horizon optimal control is
proposed based on Monte Carlo simulation. This method is derived via the
Feynman-Kac formula which gives a stochastic interpretation for the solution of
a Hamilton-Jacobi-Bellman equation associated with the true optimal controller.
It is shown, and it is a prime motivation for this study, that this particular
controller approximation method practically stabilises the underlying nonlinear
process.

Bishop, A.N. & Moral, P.D., 'On the stability of Kalman-Bucy diffusion processes'.

The Kalman-Bucy filter is the optimal state estimator for an
Ornstein-Ulhenbeck diffusion given that the system is partially observed via a
linear diffusion-type (noisy) sensor. Under Gaussian assumptions, it provides a
finite-dimensional exact implementation of the optimal Bayes filter. It is
generally the only such finite-dimensional exact instance of the Bayes filter
for continuous state-space models. Consequently, this filter has been studied
extensively in the literature since the seminal 1961 paper of R.E. Kalman and
R.S. Bucy. The purpose of this work is to review, re-prove and refine existing
results concerning the dynamical properties of the Kalman-Bucy filter so far as
they pertain to filter stability and convergence. The associated differential
matrix Riccati equation is a focal point of this study with a number of bounds,
convergence, and eigenvalue inequalities rigorously proven. New results are
also given in the form of concentration-type and comparison inequalities for
both the filter and the Riccati flow.

Bishop, A.N., Moral, P.D. & Pathiraja, S.D., 'Perturbations and Projections of Kalman-Bucy Semigroups Motivated by Methods in Data Assimilation'.

The purpose of this work is to analyse the effect of various perturbations
and projections of Kalman-Bucy semigroups and Riccati equations. The original
motivation was to understand the behaviour of various regulation methods used
in ensemble Kalman filtering (EnKF). For example, covariance inflation-type
methods (perturbations) and covariance localisation methods (projections) are
commonly used in the EnKF literature to ensure well-posedness of the sample
covariance (e.g. sufficient rank) and to `move' the sample covariance closer
(in some sense) to the Riccati flow of the true Kalman filter. In the limit, as
the number of samples tends to infinity, these methods drive the sample
covariance toward a solution of a perturbed, or projected, version of the
standard (Kalman-Bucy) differential Riccati equation. The behaviour of this
modified Riccati equation is investigated here. Results concerning continuity
(in terms of the perturbations), boundedness, and convergence of the Riccati
flow to a limit are given. In terms of the limiting filters, results
characterising the error between the perturbed/projected and nominal
conditional distributions are given. New projection-type models and ideas are
also discussed within the EnKF framework; e.g. projections onto so-called
Bose-Mesner algebras. This work is generally important in understanding the
limiting bias in both the EnKF empirical mean and covariance when applying
regularisation. Finally, we note the perturbation and projection models
considered herein are also of interest on their own, and in other applications
such as differential games, control of stochastic and jump processes, and
robust control theory, etc.

Houssineau, J. & Bishop, A.N., 'Smoothing and filtering with a class of outer measures'.

Filtering and smoothing with a generalised representation of uncertainty is
considered. Here, uncertainty is represented using a class of outer measures.
It is shown how this representation of uncertainty can be propagated using
outer-measure-type versions of Markov kernels and generalised Bayesian-like
update equations. This leads to a system of generalised smoothing and filtering
equations where integrals are replaced by supremums and probability density
functions are replaced by positive functions with supremum equal to one.
Interestingly, these equations retain most of the structure found in the
classical Bayesian filtering framework. It is additionally shown that the
Kalman filter recursion in terms of mean and variance can be recovered from
weaker assumptions on the available information on the corresponding hidden
Markov model.

## Reports

Bertoli, F. & Bishop, A.N.

*Reducing the Bias in Blocked Particle Filtering for High-Dimensional Systems*. Particle filtering is a powerful approximation method that applies to state
estimation in nonlinear and non-Gaussian dynamical state-space models.
Unfortunately, the approximation error depends exponentially on the system
dimension. This means that an incredibly large number of particles may be
needed to appropriately control the error in very large scale filtering
problems. The computational burden required is often prohibitive in practice.
Rebeschini and Van Handel (2013) analyse a new approach for particle filtering
in large-scale dynamic random fields. Through a suitable localisation operation
they reduce the dependence of the error to the size of local sets, each of
which may be considerably smaller than the dimension of the original system.
The drawback is that this localisation operation introduces a bias. In this
work, we propose a modified version of Rebeschini and Van Handel's blocked
particle filter. We introduce a new degree of freedom allowing us to reduce the
bias. We do this by enlarging the space during the update phase and thus
reducing the amount of dependent information thrown away due to localisation.
By designing an appropriate tradeoff between the various tuning parameters it
is possible to reduce the total error bound via allowing a temporary
enlargement of the update operator without really increasing the overall
computational burden.

Bertoli, F. & Bishop, A.N.

*Adaptively Blocked Particle Filtering with Spatial Smoothing in Large-Scale Dynamic Random Fields*. The typical particle filtering approximation error is exponentially dependent
on the dimension of the model. Therefore, to control this error, an enormous
number of particles are required, which means a heavy computational burden that
is often so great it is simply prohibitive. Rebeschini and van Handel (2013)
consider particle filtering in a large-scale dynamic random field. Through a
suitable localisation operation, they prove that a modified particle filtering
algorithm can achieve an approximation error that is mostly independent of the
problem dimension. To achieve this feat, they inadvertently introduce a
systematic bias that is spatially dependent (in that the bias at one site is
dependent on the location of that site). This bias consequently varies
throughout field. In this work, a simple extension to the algorithm of
Rebeschini and van Handel is introduced which acts to average this bias term
over each site in the field through a kind of spatial smoothing. It is shown
that for a certain class of random field it is possible to achieve a completely
spatially uniform bound on the bias and that in any general random field the
spatial inhomogeneity is significantly reduced when compared to the case in
which spatial smoothing is not considered. While the focus is on spatial
averaging in this work, the proposed algorithm seemingly exhibits other
advantageous properties such as improved robustness and accuracy in those cases
in which the underlying dynamic field is time varying.

Bishop, A.N. & Doucet, A.

*Consensus in the Wasserstein Metric Space of Probability Measures*. Distributed consensus in the Wasserstein metric space of probability measures
is introduced in this work. Convergence of each agent's measure to a common
measure value is proven under a weak network connectivity condition. The common
measure reached at each agent is one minimizing a weighted sum of its
Wasserstein distance to all initial agent measures. This measure is known as
the Wasserstein barycentre. Special cases involving Gaussian measures,
empirical measures, and time-invariant network topologies are considered, where
convergence rates and average-consensus results are given. This algorithm has
potential applicability in computer vision, machine learning and distributed
estimation, etc.