Evidence map›Paper›PMID 31905714›Full record

ArticleSensors (Basel, Switzerland)2019

Real-Time Dynamic Path Planning of Mobile Robots: A Novel Hybrid Heuristic Optimization Algorithm.

Qing Wu, Zeyu Chen, Lei Wang, Hao Lin, Zijing Jiang, Shuai Li, Dechao Chen

Abstract read
In one paragraph

Article in Sensors (Basel, Switzerland), 2019. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 4 papers.

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

4 citing papers in PubMed.

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

Qing WuSchool of Computer Science and Technology, Hangzhou Dianzi University, Hangzhou 310018, China.
Zeyu ChenSchool of Computer Science and Technology, Hangzhou Dianzi University, Hangzhou 310018, China.
Lei WangSchool of Computer Science and Technology, Hangzhou Dianzi University, Hangzhou 310018, China.
Hao LinSchool of Computer Science and Technology, Hangzhou Dianzi University, Hangzhou 310018, China.
Zijing JiangSchool of Computer Science and Technology, Hangzhou Dianzi University, Hangzhou 310018, China.
Shuai LiDepartment of Computing, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong 999077, China.ORCID 0000-0001-8316-5289
Dechao ChenSchool of Computer Science and Technology, Hangzhou Dianzi University, Hangzhou 310018, China.ORCID 0000-0002-5171-1414

Funding

Departmental General Research Fund of Hong Kong Polytechnic University G.61.37.UA7LHong Kong Research Grants Council Early Career Scheme 25214015National Natural Science Foundation of China 61401385National Natural Science Foundation of China 61702146National Natural Science Foundation of China 61906054PolyU Central Research Grant G-YBMU
6 · The paper itself

Abstract

Mobile robots are becoming more and more widely used in industry and life, so the navigation of robots in dynamic environments has become an urgent problem to be solved. Dynamic path planning has, therefore, received more attention. This paper proposes a real-time dynamic path planning method for mobile robots that can avoid both static and dynamic obstacles. The proposed intelligent optimization method can not only get a better path but also has outstanding advantages in planning time. The algorithm used in the proposed method is a hybrid algorithm based on the beetle antennae search (BAS) algorithm and the artificial potential field (APF) algorithm, termed the BAS-APF method. By establishing a potential field, the convergence speed is accelerated, and the defect that the APF is easily trapped in the local minimum value is also avoided. At the same time, by setting a security scope to make the path closer to the available path in the real environment, the effectiveness and superiority of the proposed method are verified through simulative results.

Indexed as

beetle antennae search algorithm (BAS)dynamic obstacle avoidancehybrid optimization algorithmmobile robotreal-time path planning

Identifiers

PMID31905714
PMCPMC6982900

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.