MétaCan
Menu
Back to cohort
Record W2132568344 · doi:10.1109/acc.2009.5160657

Decentralized receding horizon control of multiple vehicles subject to communication failure

2009· article· en· W2132568344 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
KeywordsTrajectoryHorizonControl (management)Computer scienceSet (abstract data type)Control theory (sociology)Sample (material)Communications systemComputer networkMathematicsArtificial intelligence

Abstract

fetched live from OpenAlex

In this paper, the decentralized receding horizon control (DRHC) of multiple cooperative vehicles with the possibility of communication failure is investigated. The neighboring vehicles exchange their computed trajectories at each sample time to maintain cooperation objectives. It is assumed that the communication failure is partial in nature, which in turn leads to large communication delays. A new reconfigurable DRHC approach is developed that guarantees the safety of the entire fleet in the presence of inter-vehicle communication failures. The concept of tube RHC is introduced to guarantee the safety of the fleet against collisions during faulty conditions. In this approach, a tube shaped trajectory set is used instead of a trajectory for the neighboring vehicles experiencing the communication failure.

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.876
Threshold uncertainty score0.464

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.006
GPT teacher head0.216
Teacher spread0.210 · 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

Citations8
Published2009
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Control Systems OptimizationFrench-language works237,207