Adaptive Source Localization Based Station Keeping of Autonomous Vehicles
Bibliographic record
Abstract
We study the problem of driving a mobile sensory agent to a target whose location is specified only in terms of the distances to a set of sensor stations or beacons. The beacon positions are unknown, but the agent can continuously measure its distances to them as well as its own position. This problem has two particular applications: (1) capturing a target signal source whose distances to the beacons are measured by these beacons and broadcasted to a surveillance agent, (2) merging a single agent to an autonomous multi-agent system so that the new agent is positioned at desired distances from the existing agents. The problem is solved using an adaptive control framework integrating a parameter estimator producing beacon location estimates, and an adaptive motion control law fed by these estimates to steer the agent toward the target. For location estimation, a least-squares adaptive law is used. The motion control law aims to minimize a convex cost function with unique minimizer at the target location, and is further augmented for persistence of excitation. Stability and convergence analysis is provided, as well as simulation results demonstrating performance and transient behavior.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".