Evidence map›Paper›PMID 42647466›Full record

ArticlePloS one2026

AGV navigation in complex environments: A cooperative trajectory optimization strategy based on SMF-MPC.

Zonghe Ding, Ling Chen, Jintao Wang, Qi Qu, Liming Chang, Yajing Cheng

Abstract read
In one paragraph

Article in PloS one, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing 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

0 citing papers in PubMed.

No citing paper in PubMed yet.

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

6 authors.

Zonghe DingSchool of Electrical and Information Engineering, Wanjiang University of Technology, Ma'anshan, China.ORCID https://orcid.org/0009-0009-0494-3851
Ling ChenSchool of Electrical and Information Engineering, Wanjiang University of Technology, Ma'anshan, China.
Jintao WangCollege of Artifcial Intelligence and Automation, Hohai University, Changzhou, China.
Qi QuSchool of Electrical and Information Engineering, Wanjiang University of Technology, Ma'anshan, China.
Liming ChangSchool of Electrical and Information Engineering, Wanjiang University of Technology, Ma'anshan, China.
Yajing ChengSchool of Electrical and Information Engineering, Wanjiang University of Technology, Ma'anshan, China.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

This paper addresses the navigation problem of automated guided vehicles (AGVs) in complex environments by proposing a collaborative trajectory optimization strategy based on the Set Membership Filter (SMF) and Model Predictive Control (MPC). In contrast, the traditional probability distribution-based navigation method, UKF-MPC, often fails to provide a strict safety margin when dealing with UBB noise, thereby increasing the risk of navigation failure. Therefore, this paper proposes a set-membership filter algorithm that constructs a minimum enclosing ellipsoid to enclose the system's true state in real time and incorporates the geometric characteristics of this ellipsoid as a time-varying penalty term into the MPC optimization objective, thereby achieving dynamic risk avoidance. Finally, comparative experiments under three different types of environmental noise were conducted using MATLAB. The MATLAB simulation results indicate that, under complex environmental disturbances, the SMF-MPC control strategy exhibits a higher navigation success rate and greater robustness than both the traditional UKF-MPC control strategy and the Robust MPC control strategy.

Indexed as

AlgorithmsModels, TheoreticalComputer SimulationEnvironment

Identifiers

PMID42647466
PMCPMC13513984

What OpenQuestion holds

Textmetadata
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.