A Novel SMMS Teleoperation Control Framework for Multiple Mobile Agents With Obstacles Avoidance by Leader Selection
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
Teleoperation of multiple agents has the unique advantage to complete tasks with wide range and is an effective solution to help agents avoid obstacles with human intelligence, especially when encounters the local-minima problem. In this article, a novel nonlinear single-master–multislave (SMMS) teleoperation control framework is proposed for multiple mobile agents to achieve obstacles avoidance under delays, nonlinearities, various uncertainties, and nonholonomic constraints. Namely, the slave trajectory planner is designed to cope with the nonholonomic constraints caused by underactuated characteristics of slave agents, while the slave obstacle avoidance planner is designed to cope with obstacles in the environment, which can avoid the obstacles by artificial potential function (APF)-based obstacle avoidance algorithm. Particularly, considering that the APF usually encounters the local-minima problem, a leader selection algorithm is designed for the slave obstacle avoidance planner and a virtual force feedback is designed for the master subsystem, where the slave agents can get rid of local-minima points while teleoperated by human operator with confident force feedback. The global stability of the overall system can be guaranteed under the proposed radial basis function neural network (RBFNN)-based adaptive sliding mode master controller and slave formation controller under delays, nonlinearities and various uncertainties. The comparative experiment is implemented, and the results show the effectiveness of proposed control framework in the achievement of good performance including position tracking, force feedback, and formation and obstacles avoidance while the stability is guaranteed.
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.001 | 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