Evidence map›Paper›PMID 41957094›Full record

ArticleScientific reports2026

SPHTRLM: secure and privacy-preserving hyperparameter-tuned reinforcement learning method for robot path finding in dynamic environments.

Revati Raman Dewangan, Deepali Thombre, Vivek Parganiha, Monika Verma, Amit Pimpalkar, Bhupesh Kumar Dewangan, Nilesh Shelke

Abstract read
In one paragraph

Article in Scientific reports, 2026. 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

7 authors.

Revati Raman DewanganDepartment of Computer Science and Engineering, Bhilai Institute of Technology, Durg, 491001, India.
Deepali ThombreNational Institute of Technology, Raipur, 492010, India.
Vivek ParganihaDepartment of Computer Science and Engineering, Bhilai Institute of Technology, Durg, 491001, India.
Monika VermaDepartment of Computer Science and Engineering, Bhilai Institute of Technology, Durg, 491001, India.
Amit PimpalkarSchool of Computer Science and Engineering, Ramdeobaba University, Nagpur, India.
Bhupesh Kumar DewanganSymbiosis Institute of Technology Nagpur Campus, Symbiosis International (Deemed University), Pune, India. bhupesh.dewangan@gmail.com.
Nilesh ShelkeSymbiosis Institute of Technology Nagpur Campus, Symbiosis International (Deemed University), Pune, India. nilesh.shelke@sitnagpur.siu.edu.in.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Autonomous robot navigation within a dynamic environment is a complicated issue since environmental factors keep on changing, safety remains a factor, and issues of data privacy concern are also on the increase. The existing reinforcement learning (RL) navigation systems mainly focus on path performance and avoidance of collisions but do not focus on privacy protection, adaptation learning stability, and real deployment. This research aims to overcome these constraints by suggesting a novel framework Secure and Privacy-Preserving Hyperparameter-Tuned RL Model (SPHTRLM) to the efficient generation of path plans in grid ecosystems with dynamic environments. The framework incorporates adjusted Q-learning with federated learning (FL) based distributed updates, refined differentiated privacy, minimal encrypted parameter exchange, adaptive reward shaping and automatic hyperparameter optimization. In a further attempt to enhance practicability, the proposed architecture also embraces mobility conscious aggregation and heterogeneous model support of resource-limited robotic platforms. The suggested SPHTRLM has a success rate of (95% ± 2%), and it is better than the comparable one Q-learning (87% ± 4%) and Deep RL (DRL) baselines (88%) when these methods were evaluated under the same condition. The framework minimizes distances to the average path with a reduction of 20–25% and convergence is speeded up by around 35% compared to normal Q-learning. When the obstacles are very thick then the collision rate becomes and the obstacle reduces to 0.08, and the safety of the navigation process improves. Although there are additional privatization mechanisms, the computational costs are minimal (8–12%), and the average decision time is 110–125 ms, which meets the real-time operational capabilities. Privacy analysis with formally stated membership inference and reconstruction attacks provide status of attack rate less than 5% attack success with both white and black box adversary. These findings underscore that SPHTRLM is a feasible way of achieving the goals of ensuring navigation, learning consistency, safety as well as privacy protection to give credible acceptance to using autonomous robotic systems in dynamic and data-sensitive environment.

Indexed as

Dynamic environmentsFully homomorphic encryptionHyperparameter tuningMulti-agent systemsPrivacy and securityPrivacy-preserving reinforcement learningRobot path planning

Identifiers

PMID41957094
PMCPMC13199393

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC-ND
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.