Decentralized control of a large platoon of vehicles using non-identical controllers
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
This paper studies the decentralized control of a platoon of identical vehicles when each control agent is assumed to only have knowledge of the distance between itself and its immediate forward neighbor. In particular, it is desired to solve the decentralized robust servomechanism problem (RSP), so that the vehicles' separation distances are regulated to specified set points, independent of the lead vehicle's velocity and such that the system is string stable. It is shown that for a large class of identical decentralized controllers, namely those decentralized controllers which solve the RSP and which have stable stabilizing compensators, e.g. a 3-term controller, that it is impossible to solve the above problem. This gives motivation to consider nonidentical decentralized controllers for the platoon vehicle problem, and it is shown in this case that it is possible to solve the above problem. A number of examples are included, including examples which have a large number of vehicles in a platoon, i.e. N=2000.
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.000 |
| 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