MétaCan
Menu
Back to cohort
Record W2981053816 · doi:10.1109/etfa.2019.8869313

A Flexible Distributed Control Strategy for Teams of Vehicles Moving within Severe Obstacle Scenarios

2019· article· en· W2981053816 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.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvanced Control Systems Optimization
Canadian institutionsConcordia University
Fundersnot available
KeywordsObstaclePlatoonFlexibility (engineering)Computer scienceObstacle avoidanceScheme (mathematics)ExploitGridModel predictive controlPath (computing)Distributed computingControl (management)Motion planningVehicle dynamicsControl engineeringReal-time computingMobile robotAutomotive engineeringArtificial intelligenceEngineeringComputer networkRobot

Abstract

fetched live from OpenAlex

In this paper, a distributed model predictive control scheme is developed for addressing the obstacle avoidance problem for a group of unmanned ground vehicles moving in unknown and planar environments. The proposed strategy exploits a switching control architecture where the vehicle formation can be conveniently organized in two different typologies, namely grid and platoon, according to the detected obstacle scenario. The main advantage of this scheme consists in the flexibility of the formation which can be on-line rearranged whenever large obstacle occurrences almost completely occlude the formation path and only narrow corridors are available.

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.875
Threshold uncertainty score0.554

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.007
GPT teacher head0.213
Teacher spread0.206 · 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

Quick stats

Citations3
Published2019
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Control Systems OptimizationFrench-language works237,207