DISCRETE-TIME OPTIMAL CONTROL OF NONHOLONOMIC MOBILE ROBOT FORMATIONS USING LINEARLY PARAMETERIZED NEURAL NETWORKS
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.
Bibliographic record
Abstract
In this paper, the infinite horizon optimal tracking control problem is solved online and forward-in-time for leader follower based formation control of nonholonomic mobile robots. Using the back-stepping approach and the kinematic controller developed in our previous work, the dynamical controller inputs for the robots are approximated from nonlinear optimal control techniques to track the designed control velocities. The proposed adaptive dynamic programming approach uses neural networks (NNs) to solve the optimal formation control problem in discrete-time in the presence of unknown internal dynamics and a known control coefficient matrix. All NNs are tuned online using novel weight update laws, and the stability of the entire formation is demonstrated using Lyapunov methods. Numerical simulations are also provided to demonstrate the effectiveness of the proposed approach.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it