MétaCan
Menu
Back to cohort
Record W1987855954 · doi:10.1109/sysose.2007.4304217

A Two-Stage Formation Flying Strategy to Reduce the Mission Time

2007· article· en· W1987855954 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
TopicRobotic Path Planning Algorithms
Canadian institutionsConcordia University
Fundersnot available
KeywordsControl reconfigurationComputer scienceTask (project management)Set (abstract data type)Real-time computingPhase (matter)InteroperabilityProcess (computing)EngineeringEmbedded systemSystems engineeringOperating system

Abstract

fetched live from OpenAlex

Unmanned aerial vehicles (UAV) interoperability in a system of systems (SoS) is a relatively new line of research which is being investigated for future combat systems. This paper is concerned with formation flying of UAVs with minimum time mission requirement. It is assumed that a known finite set of different configurations exists, which characterizes the mission. This means that the desired configuration at each point in time belongs to this set. A reconfiguration strategy is then introduced which is carried out in two phases. The first phase starts upon the completion of the latest reconfiguration task. In this phase, each UAV moves to a pre-determined location which is obtained to be as close as possible to all potential next destinations given by the known set. All UAVs stay in this location during the idle time, i.e., while no new mission command is issued. The second phase begins once a new command is issued to reconfigure the formation. In this phase, all UAVs will move to the location specified by the new command. This two-stage strategy minimizes the reconfiguration time, which is quite desirable in many real-world applications. Simulation results demonstrate that the proposed strategy results in a significant reduction in the reconfiguration time.

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.001
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: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.892
Threshold uncertainty score0.673

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.001

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.045
GPT teacher head0.321
Teacher spread0.276 · 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

Citations4
Published2007
Admission routes1
Has abstractyes

Explore more

Same topicRobotic Path Planning AlgorithmsFrench-language works237,207