MétaCan
Menu
Back to cohort
Record W2162046920 · doi:10.1109/acc.2008.4586490

Piecewise-affine parameter-varying control of wheeled mobile robots

2008· article· en· W2162046920 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
TopicControl and Dynamics of Mobile Robots
Canadian institutionsConcordia University
Fundersnot available
KeywordsParameterized complexityPiecewiseControl theory (sociology)Mobile robotController (irrigation)Piecewise linear functionComputer sciencePath (computing)ActuatorSet (abstract data type)RobotMathematicsControl (management)AlgorithmArtificial intelligence

Abstract

fetched live from OpenAlex

This paper defines a new class of systems and presents a novel controller synthesis method. This new methodology is motivated by and applied to the problem of path following of a wheeled mobile robot (WMR). The new class of systems proposed in this paper is called piecewise-afflne parameter- varying (PWAPV), which is a combination of piecewise-afflne (PWA) and linear parameter-varying (LPV) systems. The synthesis of PWAPV controllers for uncertain PWAPV systems can be cast as a parameterized set of matrix inequalities, which can be approximated by a finite set of LMIs and solved efficiently using available software. As an application, actuator input voltage laws are designed to guarantee that a WMR follows a desired path that is parameterized by a time-varying curvature. Simulation results show the effectiveness of the new control law.

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: Empirical
Teacher disagreement score0.307
Threshold uncertainty score0.739

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.007
GPT teacher head0.188
Teacher spread0.181 · 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

Citations15
Published2008
Admission routes1
Has abstractyes

Explore more

Same topicControl and Dynamics of Mobile RobotsFrench-language works237,207