MétaCan
Menu
Back to cohort

Hierarchical Geometric Path-Following Control for UAV Slung Load Transport

2024· article· en· W4392982452 on OpenAlexaff
Mohamed Al Lawati, Alan F. Lynch

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicRobotic Path Planning Algorithms
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsPath (computing)Computer scienceControl (management)Control theory (sociology)Artificial intelligenceComputer network

Abstract

fetched live from OpenAlex

This paper addresses the motion control problem of a slung load system (SLS), which consists of an unmanned aerial vehicle (UAV) carrying a pendulum. The pendulum is pivoted at the UAV's center of mass through a 2-degree-of-freedom rotational joint. The other end of the pendulum carries a payload to be transported by the SLS. The control design is based on a geometric SLS model, where UAV and pendulum rotations evolve in SO(3) and S2, respectively. Hence, the control design is geometric in nature and does not adhere to the parameterization of SO(3) and S2. The objective is to control payload position and UAV heading without using timed reference trajectories. Instead, the control design stabilizes the so-called path set to control payload motion using a hierarchical control structure. Utilizing the Reduction Theorem, the paper proves that the path set is almost globally asymptotically stable. The Reduction Theorem simplifies the stability proof as no Lyapunov function is needed and allows for modularity in individual control-loop designs. Numerical simulations are presented to validate the result and show its almost global asymptotic nature.

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.

How this classification was reachedexpand

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: none
Teacher disagreement score0.971
Threshold uncertainty score0.633

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.001
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.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.016
GPT teacher head0.263
Teacher spread0.247 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations2
Published2024
Admission routes1
Has abstractyes

Explore more

Same topicRobotic Path Planning AlgorithmsFrench-language works237,207