MétaCan
Menu
Back to cohort
Record W2967153799 · doi:10.23919/ecc.2019.8795915

Multi-Vehicle Reference Tracking with Guaranteed Collision Avoidance

2019· article· en· W2967153799 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
KeywordsCollision avoidanceCollisionComputer scienceTracking (education)Set (abstract data type)ExploitVehicle dynamicsState (computer science)Control theory (sociology)Reference modelControl (management)Distributed computingReal-time computingControl engineeringEngineeringArtificial intelligenceAlgorithmComputer security

Abstract

fetched live from OpenAlex

In this paper, a computationally low-demanding control framework is presented to deal with the reference tracking and collision avoidance problems for a system of heterogeneous Unmanned Vehicles (UVs). The proposed solution is capable of guaranteeing absence of collisions in scenarios where the UVs are subject to disturbances, state and input constraints, and where reference trajectories might intersect. The proposed methodology exploits set-theoretic predictive arguments to coordinately design local tracking controllers and a centralized collision avoidance module. A simulation example, involving two UVs is performed to better explain the main features of the proposed framework.

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.556
Threshold uncertainty score0.392

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.010
GPT teacher head0.205
Teacher spread0.195 · 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