MétaCan
Menu
Back to cohort

A NOVEL HYBRID NAVIGATION SCHEME FOR RECONFIGURABLE MULTI-AGENT TEAMS

2006· article· en· W2053870186 on OpenAlexaffvenue
Jing Ren, Kenneth McIsaac, Rajni V. Patel

Bibliographic record

VenueInternational Journal of Robotics and Automation · 2006
Typearticle
Languageen
FieldComputer Science
TopicRobotic Path Planning Algorithms
Canadian institutionsWestern University
Fundersnot available
KeywordsControl reconfigurationComputer scienceRobustness (evolution)Scheme (mathematics)Task (project management)Distributed computingImperfectHuman–computer interactionReal-time computingEmbedded systemEngineeringSystems engineering

Abstract

fetched live from OpenAlex

In this paper, we propose a hybrid navigation scheme for reconfigurable multi-agent teams. To accomplish a complex task such as search and rescue, agents need to frequently adjust their roles over time according to changes in the task space and in the environment. Furthermore, when exploring an unknown environment, the loss of a team member is likely and the addition of new team members to replace that loss is often necessary. Nevertheless, the loss and addition of members in the agent team should not affect the completion of the task. Our hybrid navigation scheme, consisting of a built-in reconfiguration mechanism and mode-switching navigation functions, reflects these needs by allowing an agent team to reconfigure itself to effectively complete a wide range of tasks. Our design has been implemented in C++ and has been tested by simulation in several typical tasks. We also investigate the effects of imperfect communication on the robustness of the navigation scheme.

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 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: Methods · Consensus signal: Methods
Teacher disagreement score0.222
Threshold uncertainty score0.348

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.001
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.020
GPT teacher head0.277
Teacher spread0.257 · 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 teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

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

Citations2
Published2006
Admission routes2
Has abstractyes

Explore more

Same venueInternational Journal of Robotics and AutomationSame topicRobotic Path Planning AlgorithmsFrench-language works237,207