Universal dynamic tracking control law for mobile robot trajectory tracking
Bibliographic record
Abstract
This manuscript presents a universal control law for a class of complex dynamic systems, such as mobile robots. The trajectory tracking problem is among the major problems in the field of robotics. The proposed universal control law solves the trajectory tracking problem of mobile robots. Despite a large body of research on developing robot's control laws conducted in the literature, the dynamic effects of robots are often not taken into consideration while deriving control laws that define their trajectories. In most cases, the robot's trajectory tracking and/or stabilization problems are addressed based on its kinematic model due to simplicity. Therefore, the need for a universal control law based on the robot's dynamic and/or kinematic model is significant. Even though the feedback control theory is well-established in the field of robotics, the control laws for dynamic systems are typically more complex than system models themselves. Furthermore, control laws are required to be adapted depending on models of different mobile robot systems. Here, the development of universal control law is underscored, i.e., the paper is aimed at developing universal dynamic tracking control law that solves the trajectory tracking problem of a class of mobile robots. The controller is tested through a set of computer simulations using a differential drive mobile robot operating in an indoor planar environment.
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.000 | 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.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".