MétaCan
Menu
Back to cohort
Record W4415625318 · doi:10.3390/robotics14110157

Concurrent Multi-Robot Search of Multiple Missing Persons in Urban Environments

2025· article· en· W4415625318 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueRobotics · 2025
Typearticle
Languageen
FieldEngineering
TopicRobotics and Sensor-Based Localization
Canadian institutionsUniversity of Toronto
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsTask (project management)EstimatorTrajectoryScheme (mathematics)Search and rescueWork (physics)Motion (physics)

Abstract

fetched live from OpenAlex

Coordinating robotic teams across multiple concurrent search tasks is a critical challenge in search and rescue operations. This work presents a new multi-agent framework designed to manage and optimize search efforts when several missing-person reports occur in parallel. The method extends iso-probability curve-based trajectory planning to the multi-target case and introduces a dynamic task allocation scheme that distributes search agents (e.g., UAVs) across tasks according to evolving probabilities of success. Overlapping search regions are explicitly resolved to eliminate duplicate coverage and to ensure balanced effort among tasks. The framework also extends the behavior-based motion prediction model for missing persons and the non-parametric estimator for iso-probability curves to capture more realistic search conditions. Extensive simulated experiments, with multiple concurrent tasks, demonstrate that the proposed method tangibly improves mean detection times compared with equal-allocation and individual static assignment strategies.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.963
Threshold uncertainty score0.555

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.025
GPT teacher head0.254
Teacher spread0.229 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it