Optimal Target Capture and Station Keeping Control of Mobile Agents without Global Position Information
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
The target capture problem, i.e., the problem of reaching a target zone, by a mobile robotic agent that cannot sense its own global position requires reactive motion control algorithms based on onboard sensor data. Although the existing solutions to the target capture problem provide robust convergence guarantees, they do not address the mobile agent’s path and motion optimality. We address the agent path and motion optimality in target capture control and its extension to station keeping, i.e., steering the agent to a location that is pre-defined with respect to a set of beacons, in global positioning system (GPS)-denied environments. We formulate optimal control problems aiming to minimize the agent-target distance for target capture, and the difference of desired and actual agent-station distances for station keeping. We design and analyze a linear quadratic optimal control scheme involving a Luenberger observer based state estimator, for each of the target capture and station keeping problems. The proposed schemes outperform the previous approaches in numerical simulations in terms of agent path length and smoothness.
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