Matthew Coombes

dblp:141/7383 · also Matthew J. Coombes · DBLP profile ↗
← Back
2ranked-venue papers in the field
0as first author
2since 2021 · last 2025
0000-0002-4421-9464ORCID · verified

Domains — venue-derived; a paper can count in several

Other / Interdisciplinary · 2
YearPublicationVenuePosition
2025 Multiagent Information Coverage Inspired Target Searching and Tracking in Stone Soup
abstract
Searching and tracking for mobile targets with multiple mobile sensing platforms is a relevant capability for many real-world scenarios such as search and rescue and surveillance. This paper presents an approach to performing searching and tracking for a single target of interest using multiple mobile sensor systems in urban environments. Formulating the searching and tracking problem as a partially observable Markov decision process, a coverage control objective inspired reward function is designed, to create a single objective function for both searching and tracking behaviours. Furthermore, the approach alleviates differentiability requirements in typical coverage control approaches. Visibility informed Bernoulli filter provides a suitable tracking algorithm estimating both probability that a target exists and its state. Road network information is used to inform the information coverage objective for scenario tailored search behaviour. Monte Carlo tree search is adopted to implement the algorithm non-myopically and balance exploitation of immediate rewards with exploration of potential future gains. Contribution to the open source Stone Soup framework creates several new components for the toolkit, where the flexibility of the approach can be leveraged with the established wealth of tracking and filtering algorithms. Simulated Urban Mobility software package is integrated with Stone Soup to create a realistic urban simulation scenario with two sensing agents. Through Monte Carlo simulations, the algorithm demonstrates efficient search behaviour, good target tracking performance and effective coverage of the target once found.
Timothy J. Glover, James Knowles, Henry Pritchett, Matthew Coombes
FUSION4
2024 A Monte Carlo Tree Search Framework for Autonomous Source Term Estimation in Stone Soup
abstract
Source term estimation of a hazardous release remains a topic of significant interest in the robotics and state estimation communities, with application to many safety critical scenarios including gas or nuclear release, locating suspicious smells or response to emergency incidents. Limited sensing resources and time constraints mean that deciding on how to act in order to improve efficiency of estimation is also of significant interest. This paper has two main focuses: a sequential Monte Carlo technique for performing source term estimation from gas concentration measurements taken on a mobile sensor platform and a Monte Carlo tree search (MCTS) framework to perform sensor motion planning to maximise Kullback-Leibler divergence (KLD). Both algorithms are implemented in the open source tracking and estimation framework: Stone Soup, creating several key contributions to this Python based toolkit. The presented algorithm demonstrates superior performance when compared to a greedy myopic alternative when considering source position estimation error, release rate error and successful rate performance measures.
Timothy J. Glover, Rohit V. Nanavati, Matthew Coombes, Cunjia Liu, Wen-Hua Chen 0001, Nicola Perree, Steven Hiscocks
FUSION3