Evidence map›Paper›PMID 36996142›Full record

ArticlePloS one2023

A search and rescue robot search method based on flower pollination algorithm and Q-learning fusion algorithm.

Bing Hao, Jianshuo Zhao, He Du, Qi Wang, Qi Yuan, Shuo Zhao

Abstract 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 2 papers.

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

2 citing papers in PubMed.

  1. Article
  2. 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

6 authors.

Bing HaoCollege of Computer and Control Engineering, Qiqihar University, Qiqihar, China.ORCID 0000-0003-0754-5073
Jianshuo ZhaoCollege of Computer and Control Engineering, Qiqihar University, Qiqihar, China.ORCID 0000-0002-5207-3805
He DuCollege of Computer and Control Engineering, Qiqihar University, Qiqihar, China.
Qi WangCollege of Computer and Control Engineering, Qiqihar University, Qiqihar, China.
Qi YuanCollege of Telecommunication and Electronic Engineering, Qiqihar University, Qiqihar, China.
Shuo ZhaoCollege of Telecommunication and Electronic Engineering, Qiqihar University, Qiqihar, China.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Search algorithm plays an important role in the motion planning of the robot, it determines whether the mobile robot complete the task. To solve the search task in complex environments, a fusion algorithm based on the Flower Pollination algorithm and Q-learning is proposed. To improve the accuracy, an improved grid map is used in the section of environment modeling to change the original static grid to a combination of static and dynamic grids. Secondly, a combination of Q-learning and Flower Pollination algorithm is used to complete the initialization of the Q-table and accelerate the efficiency of the search and rescue robot path search. A combination of static and dynamic reward function is proposed for the different situations encountered by the search and rescue robot during the search process, as a way to allow the search and rescue robot to get better different feedback results in each specific situation. The experiments are divided into two parts: typical and improved grid map path planning. Experiments show that the improved grid map can increase the success rate and the FIQL can be used by the search and rescue robot to accomplish the task in a complex environment. Compared with other algorithms, FIQL can reduce the number of iterations, improve the adaptability of the search and rescue robot to complex environments, and have the advantages of short convergence time and small computational effort.

Indexed as

RoboticsAlgorithmsFlowersPollinationRescue Work

Identifiers

PMID36996142
PMCPMC10062604

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.