Evidence map›Paper›PMID 40263429›Full record

ArticleScientific reports2025

Predictive control for the navigation of spherical robots in obstacle-rich environments.

Ali Keymasi-Khalaji, Parsa Mokhtari, Fatemeh Bathaei

Abstract read
In one paragraph

Article in Scientific reports, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

1 citing paper in PubMed.

  1. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Ali Keymasi-KhalajiDepartment of Mechanical Engineering, Faculty of Engineering, Kharazmi University, P.O. Box 15719-14911, Tehran, Iran. keymasi@khu.ac.ir.
Parsa MokhtariDepartment of Mechanical Engineering, Faculty of Engineering, Kharazmi University, P.O. Box 15719-14911, Tehran, Iran.
Fatemeh BathaeiDepartment of Mechanical Engineering, Faculty of Engineering, Kharazmi University, P.O. Box 15719-14911, Tehran, Iran.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

This paper introduces an advanced predictive control algorithm tailored for spherical robots operating within obstacle-dense environments. The proposed strategy employs a sophisticated system model to forecast the robot's behavior over a defined future time horizon, capitalizing on the strengths of predictive control, which include accelerated convergence time, particularly beneficial in dynamic scenarios. We conduct a comprehensive comparative analysis between the predictive control approach and feedback linearization control, focusing on the robot's navigation through obstacles. Our findings indicate that the predictive control framework considerably improves the robot's overall motion performance, leading to shorter response times, enhanced convergence capabilities, and greater resilience when navigating obstacle-dense environments. Furthermore, this approach effectively minimizes control errors, achieving rapid convergence to zero. This research highlights the effectiveness of predictive control in optimizing the agility and accuracy of spherical robots in challenging operational settings. The proposed method represents the first algorithm capable of effectively addressing a comprehensive range of motion tasks for spherical robots. This includes trajectory tracking and both static and dynamic obstacle avoidance with global stability and optimal performance, which are essential for their development.

Indexed as

Nonholonomic system, trajectory tracking, robot navigationObstacle avoidancePredictive controlSpherical robot

Identifiers

PMID40263429
PMCPMC12015292

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.