Evidence map›Paper›PMID 36848362›Full record

ArticlePloS one2023

Three-dimensional continuous picking path planning based on ant colony optimization algorithm.

Chuang Zhang, He Wang, Li-Hua Fu, Yue-Han Pei, Chun-Yang Lan, Hong-Yu Hou, Hua Song

Open access · goldAbstract read
In one paragraph

Article in PloS one, 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 3 papers.

0numbers the graph read from it
0cells of the map it votes in
3citing papers in PubMed
1.8field-weighted citation impact, top 13% of its field
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

3 citing papers in PubMed, 15 citations in OpenAlex.

  1. Article
  2. Article
  3. 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 at 1 institution in 1 country.

Chuang ZhangSchool of Mechanical Engineering and Automation, University of Science and Technology Liaoning, Anshan, China.
He WangSchool of Mechanical Engineering and Automation, University of Science and Technology Liaoning, Anshan, China.
Li-Hua FuSchool of Mechanical Engineering and Automation, University of Science and Technology Liaoning, Anshan, China.
Yue-Han PeiSchool of Mechanical Engineering and Automation, University of Science and Technology Liaoning, Anshan, China.
Chun-Yang LanSchool of Mechanical Engineering and Automation, University of Science and Technology Liaoning, Anshan, China.
Hong-Yu HouSchool of Mechanical Engineering and Automation, University of Science and Technology Liaoning, Anshan, China.
Hua SongSchool of Mechanical Engineering and Automation, University of Science and Technology Liaoning, Anshan, China.ORCID 0000-0002-5856-4787
University of Science and Technology Liaoning · CN

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Fruit-picking robots are one of the important means to promote agricultural modernization and improve agricultural efficiency. With the development of artificial intelligence technology, people are demanding higher picking efficiency from fruit-picking robots. And a good fruit-picking path determines the efficiency of fruit-picking. Currently, most picking path planning is a point-to-point approach, which means that the path needs to be re-planned after each completed path planning. If the picking path planning method of the fruit-picking robot is changed from a point-to-point approach to a continuous picking method, it will significantly improve its picking efficiency. The optimal sequential ant colony optimization algorithm(OSACO) is proposed for the path planning problem of continuous fruit-picking. The algorithm adopts a new pheromone update method. It introduces a reward and punishment mechanism and a pheromone volatility factor adaptive adjustment mechanism to ensure the global search capability of the algorithm, while solving the premature and local convergence problems in the solution process. And the multi-variable bit adaptive genetic algorithm is used to optimize its initial parameters so that the parameter selection does not depend on empirical and the combination of parameters can be intelligently adjusted according to different scales, thus bringing out the best performance of the ant colony algorithm. The results show that OSACO algorithms have better global search capability, higher quality of convergence to the optimal solution, shorter generated path lengths, and greater robustness than other variants of the ant colony algorithm.

Indexed as

AlgorithmsArtificial IntelligenceAgricultureFruitHumansPheromonesPheromones

Identifiers

PMID36848362
PMCPMC9970085
OpenAlexW4322491259

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.