JFJason J. Ford

Jason J. Ford

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Jason J. Ford has a total of 89 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Addressing COLREG Rule 2b: COLREG and Risk Aware Manoeuvre-Based Predictive Planning

    by Jordan Gleeson, Matthew Dunbabin, Jason J. Ford

    This letter presents a novel collision avoidance method for Autonomous Surface Vessels (ASVs) that considers nuanced risk and COLREG profiles to determine an optimal safe manoeuvre. The COLREGs are a set of collision regulations defined by the International Maritime Organisation by which all compliant vessels should manoeuvre safely. However, COLREG Rule 2(b), in summary, states that a vessel may, if needed, make “a departure from these rules necessary to avoid immediate danger.” Our proposed COLREG and Risk Aware Manoeuvre-based Predictive Planner (CRAMPP) collates risk and COLREG compliance, along with other metrics, into a single cost function. The cost function features a novel dynamic weighting system that facilitates COLREG Rule 2(b). A motion model is used to simulate the ASV dynamics at varying speed and course setpoints as inputs to the cost function, which is optimised to find a manoeuvre with minimum risk and COLREG compliance cost. Field and simulated experiments were conducted to evaluate and demonstrate the efficacy of CRAMPP in one-on-one and complex multi-ship scenarios.


  • Improving Visual Place Recognition Based Robot Navigation by Verifying Localization Estimates

    by Owen Claxton, Connor Malone, Helen Carson, Jason J. Ford, Gabe Bolton, Iman Shames, Michael Milford

    Visual Place Recognition (VPR) systems often have imperfect performance, affecting the ‘integrity’ of position estimates and subsequent robot navigation decisions. Previously, SVM classifiers have been used to monitor VPR integrity. This research introduces a novel Multi-Layer Perceptron (MLP) integrity monitor which demonstrates improved performance and generalizability, removing per-environment training and reducing manual tuning requirements. We test our proposed system in extensive real-world experiments, presenting two real-time integrity-based VPR verification methods: a single-query rejection method for robot navigation to a goal zone (Experiment 1); and a history-of-queries method that takes a best, verified, match from its recent trajectory and uses an odometer to extrapolate a current position estimate (Experiment 2). Noteworthy results for Experiment 1 include a decrease in aggregate mean along-track goal error from $ \approx \!9.8\;{\text{m}}$ to $ \approx \!3.1\;{\text{m}}$ , and an increase in the aggregate rate of successful mission completion from $\approx \!41\%$ to $\approx \!55\%$ . Experiment 2 showed a decrease in aggregate mean along-track localization error from $ \approx \!2.0\;{\text{m}}$ to $ \approx \!0.5\;{\text{m}}$ , and an increase in the aggregate localization precision from $\approx \!97\%$ to $\approx \!99\%$ . Overall, our results demonstrate the practical usefulness of a VPR integrity monitor in real-world robotics to improve VPR localization and consequent navigation performance.


  • Scalable Input-to-State Stability of Nonlinear Interconnected Systems

    by Guilherme Fróes Silva, Alejandro Donaire, Richard Middleton, Aaron McFadyen, Jason Ford

    This paper investigates the scalable input-to-state stability (sISS) property of networks of interconnected systems using the local Lyapunov functions of the individual systems or agents that compose the network. Ensuring sISS of the network prevents the amplification of disturbances through the network, provides uniform transient performance with respect to the number of interconnected systems, and enables network scalability. Our first contribution is to provide sufficient conditions for sISS of networks using sISS vector Lyapunov functions. These sufficient conditions are given in terms of the Lyapunov functions of the agents. We use vector Lyapunov functions, the comparison lemma, and contraction analysis to prove the result. Our second contribution provides conditions for scalable input-to-state stability of weakly coupled interconnected systems. This result allows us to study the scalable input-to-state stability of exponentially stable systems interconnected by weak coupling links. We illustrate the application of the results in four examples.


  • A Framework for Bayesian Quickest Change Detection in General Dependent Stochastic Processes

    by Jasmin James, Jason J. Ford, Timothy L. Molloy

    In this paper we present a novel framework for quickly detecting a change in a general dependent stochastic process. We propose that any general dependent Bayesian quickest change detection (QCD) problem can be converted into a hidden Markov model (HMM) QCD problem, provided that a suitable state process can be constructed. The optimal rule for HMM QCD is then a simple threshold test on the posterior probability of a change. We investigate case studies that can be considered structured generalisations of Bayesian HMM QCD problems including: quickly detecting changes in statistically periodic processes and quickest detection of a moving target in a sensor network. Using our framework we pose and establish the optimal rules for these case studies. We also illustrate the performance of our optimal rule on real air traffic data to verify its simplicity and effectiveness in detecting changes.


  • Innovation-Based Remote State Estimation Secrecy With No Acknowledgments

    by Justin M. Kennedy, Jason J. Ford, Daniel E. Quevedo, Falko Dressler

    Secrecy encoding for remote state estimation in the presence of adversarial eavesdroppers is a well studied problem. Typical existing secrecy encoding schemes rely on the transmitter's knowledge of the remote estimator's current performance. This performance measure is often shared via packet receipt acknowledgments. However, in practical situations the acknowledgment channel may be susceptible to interference from an active adversary, resulting in the secrecy encoding scheme failing. Aiming to achieve a reliable state estimate for a legitimate estimator while ensuring secrecy, we propose a secrecy encoding scheme without the need for packet receipt acknowledgments. Our encoding scheme uses a prearranged scheduling sequence established at the transmitter and legitimate receiver. We transmit a packet containing either the state measurement or encoded information for the sestimate legitimate user. The encoding makes the packet appear to be the state but is designed to damage an eavesdropper's estimate. The prearranged scheduling sequence and encoding is chosen psuedorandom. We analyze the performance of our encoding scheme against a class of eavesdropper, and show conditions to force the eavesdropper to have an unbounded estimation performance. Further, we provide a numerical illustration and apply our encoding scheme to an application in power systems.


  • Open Access

    Exactly optimal Bayesian quickest change detection for hidden Markov models

    by Jason J. Ford, Jasmin James, Timothy L. Molloy


  • Open Access

    Unsupervised Quality Prediction for Improved Single-Frame and Weighted Sequential Visual Place Recognition

    by Helen Carson, Jason J. Ford, Michael Milford

    While substantial progress has been made in the absolute performance of localization and Visual Place Recognition (VPR) techniques, it is becoming increasingly clear from translating these systems into applications that other capabilities like integrity and predictability are just as important, especially for safety- or operationally-critical autonomous systems. In this research we present a new, training-free approach to predicting the likely quality of localization estimates, and a novel method for using these predictions to bias a sequence-matching process to produce additional performance gains beyond that of a naive sequence matching approach. Our combined system is lightweight, runs in real-time and is agnostic to the underlying VPR technique. On extensive experiments across four datasets and three VPR techniques, we demonstrate our system improves precision performance, especially at the high-precision/low-recall operating point. We also present ablation and analysis identifying the performance contributions of the prediction and weighted sequence matching components in isolation, and the relationship between the quality of the prediction system and the benefits of the weighted sequential matcher.

  • Exactly Optimal Quickest Change Detection of Markov Chains

    by Jason J. Ford, Justin M. Kennedy, Caitlin Tompkins, Jasmin James, Aaron McFadyen

    This paper establishes that an exactly optimal rule for Bayesian Quickest Change Detection (QCD) of Markov chains is an optimal stopping rule in the form of a threshold test on the no change posterior. We also provide a computationally efficient scalar filter for the no change posterior whose effort is independent of the dimension of the chains. We establish that an (undesirable) weak practical super-martingale phenomenon can be exhibited by the no change posterior when the before and after chains are too close in a relative entropy rate sense. The proposed detector is examined in simulation studies.


  • Open Access

    Exactly Optimal Quickest Change Detection of Markov Chains

    by Jason J. Ford, Justin M. Kennedy, Caitlin Tompkins, Jasmin James, Aaron McFadyen

    This paper establishes that an exactly optimal rule for Bayesian Quickest Change Detection (QCD) of Markov chains is a threshold test on the no change posterior. We also provide a computationally efficient scalar filter for the no change posterior whose effort is independent of the dimension of the chains. We establish that an (undesirable) weak practical super-martingale phenomenon can be exhibited by the no change posterior when the before and after chains are too close in a relative entropy rate sense. The proposed detector is examined in simulation studies.