Tim Bailey
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Tim Bailey has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Eduardo Nebot
Australian Centre for Field Robotics (ACFR) at the University of Sydney (NSW, Australia)
2 shared publications Hugh Durrant-Whyte
Australian Centre for Field Robotics, University of Sydney, NSW, Australia
2 shared publicationsBen Upcroft
Australian Centre for Field Robotics, University of Sydney, NSW, Australia
1 shared publication- Jeffrey Uhlmann
University of Missouri
1 shared publication - Jose Guivant
University of New South Wales
1 shared publication Juan Nieto
Australian Centre for Field Robotics, University of Sydney, NSW, Australia
1 shared publication
Latest Publications
- Top Cited Papers
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21530858,p. 3562-3568
Consistency of the EKF-SLAM Algorithm
This paper presents an analysis of the extended Kalman filter formulation of simultaneous localisation and mapping (EKF-SLAM). We show that the algorithm produces very optimistic estimates once the "true" uncertainty in vehicle heading exceeds a limit. This failure is subtle and cannot, in general, be detected without ground-truth, although a very inconsistent filter may exhibit observable symptoms, such as disproportionately large jumps in the vehicle pose update. Conventional solutions - adding stabilising noise, using an iterated EKF or unscented filter, etc., - do not improve the situation. However, if "small" heading uncertainty is maintained, EKF-SLAM exhibits consistent behaviour over an extended time-period. Although the uncertainty estimate slowly becomes optimistic, inconsistency can be mitigated indefinitely by applying tactics such as batch updates or stabilising noise. The manageable degradation of small heading variance SLAM indicates the efficacy of submap methods for large-scale maps
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21530858,p. 3562-3568
Top Cited PapersConsistency of the EKF-SLAM Algorithm
This paper presents an analysis of the extended Kalman filter formulation of simultaneous localisation and mapping (EKF-SLAM). We show that the algorithm produces very optimistic estimates once the "true" uncertainty in vehicle heading exceeds a limit. This failure is subtle and cannot, in general, be detected without ground-truth, although a very inconsistent filter may exhibit observable symptoms, such as disproportionately large jumps in the vehicle pose update. Conventional solutions - adding stabilising noise, using an iterated EKF or unscented filter, etc., - do not improve the situation. However, if "small" heading uncertainty is maintained, EKF-SLAM exhibits consistent behaviour over an extended time-period. Although the uncertainty estimate slowly becomes optimistic, inconsistency can be mitigated indefinitely by applying tactics such as batch updates or stabilising noise. The manageable degradation of small heading variance SLAM indicates the efficacy of submap methods for large-scale maps
- 1 September 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 160-163
Using Exponential Mixture Models for Suboptimal Distributed Data Fusion
In this paper we investigate the use of Exponential Mixture Densities (EMDs) as suboptimal update rules for distributed data fusion. We show that EMDs have a pointwise bound "from below" on the minimum value of the probability distribution. However, the distributions are not bounded from above and thus can be interpreted as a fusion operation.
- 1 September 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 160-163
Using Exponential Mixture Models for Suboptimal Distributed Data Fusion
In this paper we investigate the use of Exponential Mixture Densities (EMDs) as suboptimal update rules for distributed data fusion. We show that EMDs have a pointwise bound "from below" on the minimum value of the probability distribution. However, the distributions are not bounded from above and thus can be interpreted as a fusion operation.
- 1 July 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Validation Gating for Non-Linear Non-Gaussian Target Tracking
This paper develops a general theory of validation gating for non-linear non-Gaussian models. Validation gates are used in target tracking to cull very unlikely measurement-to-track associations, before remaining association ambiguities are handled by a more comprehensive (and expensive) data association scheme. The essential property of a gate is to accept a high percentage of correct associations, thus maximising track accuracy, but provide a sufficiently tight bound to minimise the number of ambiguous associations. For linear Gaussian systems, the ellipsoidal validation gate is standard, and possesses the statistical property whereby a given threshold will accept a certain percentage of true associations. This property does not hold for non-linear non-Gaussian models. As a system departs from linear-Gaussian, the ellipsoid gate tends to reject a higher than expected proportion of correct associations and permit an excess of false ones. In this paper, the concept of the ellipsoidal gate is extended to permit correct statistics for the non-linear non-Gaussian case. The new gate is demonstrated by a bearing-only tracking example
- 1 July 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Validation Gating for Non-Linear Non-Gaussian Target Tracking
This paper develops a general theory of validation gating for non-linear non-Gaussian models. Validation gates are used in target tracking to cull very unlikely measurement-to-track associations, before remaining association ambiguities are handled by a more comprehensive (and expensive) data association scheme. The essential property of a gate is to accept a high percentage of correct associations, thus maximising track accuracy, but provide a sufficiently tight bound to minimise the number of ambiguous associations. For linear Gaussian systems, the ellipsoidal validation gate is standard, and possesses the statistical property whereby a given threshold will accept a certain percentage of true associations. This property does not hold for non-linear non-Gaussian models. As a system departs from linear-Gaussian, the ellipsoid gate tends to reject a higher than expected proportion of correct associations and permit an excess of false ones. In this paper, the concept of the ellipsoidal gate is extended to permit correct statistics for the non-linear non-Gaussian case. The new gate is demonstrated by a bearing-only tracking example
- 30 June 2003
- Published by Elsevier in Automatica
- Vol. 39 (6) , 1120-1121
Mobile robot localization and map building: a multisensor fusion approach: José A. Castellanos and Juan D. Tardós; Kluwer Academic Publishers, Dordrecht, ISBN: 0-7923-7789-3
- 30 June 2003
- Published by Elsevier in Automatica
- Vol. 39 (6) , 1120-1121
Mobile robot localization and map building: a multisensor fusion approach: José A. Castellanos and Juan D. Tardós; Kluwer Academic Publishers, Dordrecht, ISBN: 0-7923-7789-3
- 25 September 2001
- Published by Elsevier in Robotics and Autonomous Systems
- Vol. 37 (4) , 261-281
Localisation in large-scale environments
- 25 September 2001
- Published by Elsevier in Robotics and Autonomous Systems
- Vol. 37 (4) , 261-281
Localisation in large-scale environments