A strong secure path planning/following system based on type-3 fuzzy control, multi-switching chaotic systems, and random switching topology
Bibliographic record
Abstract
Abstract This paper studies the synchronization and control of chaotic systems while proposing a novel chaotic-based path-tracking application for mobile robots (MRs) to ensure their safety and security. In security-based applications that use MRs, such as patrol MRs, the path of the MRs must be complex enough to prevent easy prediction. Multiple chaotic systems with a chaotic switching mechanism are introduced for secure path planning. The main challenges are that the dynamics of MRs are entirely unknown. The modeled dynamics of the MRs are unreliable in practice due to a broad range of uncertainties related to the parameters, operating conditions, environmental impacts, time delays, unmodeled frictions, noisy sensors, and faulty actuators. Also, the chaotic switching of reference signals between chaotic signals imposes a high dynamic perturbation. The main novelties are as follows: (1) a strong secure path is introduced for MRs. (2) A powerful fractional-order predictive controller using type-3 (T3) fuzzy-logic systems (FLSs) is developed. (3) The estimation and prediction errors of T3-FLSs are compensated by a designed parallel compensator. (4) T3-FLSs are tuned online, such that stability is ensured, and prediction accuracy is guaranteed. (5) The suggested scheme is implemented on a real-world MR, and the results demonstrate the feasibility and accuracy of the proposed method. Also, in several simulations, the efficacy of the introduced controller is examined.
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.000 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.000 | 0.000 |
| 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".