Evidence map›Paper›PMID 42008608›Full record

ArticlePloS one2026

Path planning for volumetric flask grasping based on visual guidance and multi-constraint optimization.

Zhaopeng Yuan, Meng Li, Chengyun Wang

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

3 authors.

Zhaopeng YuanSchool of Electrical Engineering, University of Jinan, Jinan, China.ORCID https://orcid.org/0009-0008-8781-7895
Meng LiSchool of Electrical Engineering, University of Jinan, Jinan, China.ORCID https://orcid.org/0000-0001-7680-1451
Chengyun WangSchool of Electrical Engineering, University of Jinan, Jinan, China.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

In the automated operation of the chemical laboratory, using a robotic arm to pick up volumetric flasks is a core step of the operation process. By implementing reasonable path planning, the grasping operation of the robotic arm can be made efficient and precise. In this scenario, the traditional Rapidly-exploring Random Tree Star (RRT*) algorithm suffers from low sampling efficiency and numerous sharp path turns. To address these problems, this paper proposes the Vision-guided Multi-constraint RRT* (VM-RRT*) algorithm, which integrates visual guidance sampling and multi-constraint paths. Firstly, the algorithm determines the spatial coordinates of the volumetric flask through target detection, reducing ineffective exploration and accelerating path convergence. Subsequently, it uses cubic B-splines to fit the path and improves the density of data points through spline interpolation methods. Combined with low-pass filtering, it further reduces noise and eliminates sudden changes in the end-effector speed and acceleration of the robotic arm, realizing multi-constraint trajectory optimization. Experimental simulation results show that the average planning time of the VM-RRT* algorithm is 3.27 seconds, which is approximately 20% shorter than that of the traditional RRT* algorithm (4.07 seconds), effectively improving the experimental efficiency. At the same time, the end motion parameters of the robotic arm are effectively controlled, providing support for laboratory automation.

Indexed as

AlgorithmsRoboticsComputer Simulation

Identifiers

PMID42008608
PMCPMC13095110

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.