Trajectory Tracking and Stability Analysis for Mobile Manipulators Based on Decentralized Control
Bibliographic record
Abstract
Summary Trajectory tracking of a mobile manipulator in the Cartesian space based on decentralized control is considered in this paper. The dynamic model is first rearranged to take the form of two interconnected subsystems with constraint flow, namely, a nonholonomic mobile platform subsystem and a holonomic manipulator subsystem. Secondly, using the inverse kinematics, the workspace desired trajectory of the mobile manipulator is transformed to the manipulator joint space as well as the platform desired trajectory. The kinematic control is developed from the desired trajectory of the platform. Then, the desired velocity is derived using the kinematic controller of the mobile platform, after which the velocity is used to obtain the control law of the mobile platform subsystem. Thirdly, the control law of the manipulator subsystem is developed based on the desired and real values of the manipulator, as well as the desired velocity. According to the Lyapunov stability theory, the proposed decentralized control strategy guarantees the global stability of the closed-loop system, and the tracking errors are bounded. Experimental results obtained on a 3-DOF manipulator mounted on a mobile platform are given to demonstrate the feasibility and effectiveness of the proposed approach. This is confirmed by a comparison with the computed torque 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.
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.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.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".