MétaCan
Menu
Back to cohort
Record W2117893626 · doi:10.1109/ssrr.2010.5981564

Canine Assisted Robot Deployment for Urban Search and Rescue

2010· article· en· W2117893626 on OpenAlexaff
Jimmy Tran, Alexander Ferworn, Martin Gerdzhev, Devin Ostrom

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicRobotic Path Planning Algorithms
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsUrban search and rescueRescue robotRobotSearch and rescueSoftware deploymentRubbleComputer scienceExploitMobile robotPlan (archaeology)Human–computer interactionSimulationArtificial intelligenceEngineeringComputer securityGeographySoftware engineering

Abstract

fetched live from OpenAlex

In Urban Search and Rescue (USAR) operations the search for survivors must occur before rescue operations can proceed. Two methods that can be used to search in rubble are trained search dogs and specialized response robots (sometimes called rescue robots). Rescue robots are used to collect information about trapped people within a disaster like a collapsed building. Information from them can help first responders plan and execute a rescue effort. The main challenge for these robots is the restrictions placed on their mobility by challenging rubble surfaces. While current research in this area attacks this challenge through mechanical design, good solutions remain elusive. This paper presents a new method for dispersing response robots called Canine Assisted Robot Deployment (CARD). CARD's approach utilizes USAR dogs to deliver robots close to a trapped human detected by the dog. This method exploits the canine ability to find survivors using their olfactory sensors and agility. Once a dog carrying a small robot has found a casualty, the robot can be dropped and begin exploring. Initial experiments and results are described in this paper.

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.002
Threshold uncertainty score0.005

Distilled classifier scores by category (both heads)

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.001
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0020.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.032
GPT teacher head0.287
Teacher spread0.255 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designBench or experimental
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations21
Published2010
Admission routes1
Has abstractyes

Explore more

Same topicRobotic Path Planning AlgorithmsFrench-language works237,207