ArticleScientific reports2026
Decomposition-based interval multi-objective evolutionary algorithm for patrol robot path planning in chemical plants.
Article in Scientific reports, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
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.
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.
Who cites it
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
5 authors.
Funding
Abstract
Patrol robot path planning in chemical plants requires simultaneous consideration of path efficiency and operational safety under uncertain hazard conditions. Existing methods often model environmental risk in a deterministic manner, which may be insufficient for describing the uncertainty of hazard related risk in chemical plant environments. To overcome this limitation, this paper formulates the problem as an interval multi objective optimization model, where path length and safety risk are optimized simultaneously, and the safety risk is represented as an interval based on the robot's relative distance to hazardous sources. On this basis, a decomposition based interval multi objective evolutionary algorithm with dynamic neighborhood and adaptive weight adjustment, called IMOEA/D-DAW, is proposed. The algorithm introduces an interval sparsity function to evaluate the distribution of solutions on the Pareto front, and then uses this information to adaptively adjust weight vectors and neighborhood sizes according to subproblem sparsity and evolutionary progress. In this way, both convergence and diversity are improved during the search process. Experimental comparisons with representative algorithms demonstrate that the proposed method produces better path planning results in uncertain chemical plant environments, with advantages in both convergence and solution diversity.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
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.