MétaCan
Menu
Back to cohort
Record W2441361126 · doi:10.1109/syscon.2016.7490605

Formation reconfiguration of cooperative UAVs via Learning Based Model Predictive Control in an obstacle-loaded environment

2016· article· en· W2441361126 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
FieldComputer Science
TopicDistributed Control Multi-Agent Systems
Canadian institutionsRoyal Military College of CanadaQueen's University
Fundersnot available
KeywordsControl reconfigurationFlocking (texture)ObstacleRobustness (evolution)Model predictive controlComputer scienceObstacle avoidanceReinforcement learningConvergence (economics)Control (management)Control theory (sociology)Control engineeringEngineeringArtificial intelligenceMobile robotRobot

Abstract

fetched live from OpenAlex

Learning Based Model Predictive Control (LBMPC) is a new control policy that combines statistical learning along with control engineering while providing levels of guarantees on safety, robustness and convergence. The designed control policy respects the general rules of flocking such that when static obstacles appear, the UAVs are required to steer around them and also avoid collisions between each other. Also, each UAV in the team match the other team members velocity and stay close to its flockmates during flight. Our main contribution in this paper lays in solving the formation reconfiguration problem for a group of N cooperative UAVs forming a desired formation using LBMPC in the presence of uncertainties and obstacles in simulation.

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.977
Threshold uncertainty score0.453

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.002
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.017
GPT teacher head0.217
Teacher spread0.200 · 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

Citations16
Published2016
Admission routes1
Has abstractyes

Explore more

Same topicDistributed Control Multi-Agent SystemsFrench-language works237,207