Evidence map›Paper›PMID 35391941›Full record

ArticleFrontiers in robotics and AI2022

Deep Learning-Based Complete Coverage Path Planning With Re-Joint and Obstacle Fusion Paradigm.

Tingjun Lei, Chaomin Luo, Gene Eu Jan, Zhuming Bi

Abstract read
In one paragraph

Article in Frontiers in robotics and AI, 2022. 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

4 authors.

Tingjun LeiDepartment of Electrical and Computer Engineering, Mississippi State University, Mississippi State, MS, United States.
Chaomin LuoDepartment of Electrical and Computer Engineering, Mississippi State University, Mississippi State, MS, United States.
Gene Eu JanDepartment of Electrical Engineering, National Taipei University, and Tainan National University of the Arts, Taipei, Taiwan.
Zhuming BiDepartment of Civil and Mechanical Engineering, Purdue University Fort Wayne, Fort Wayne, IN, United States.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

With the introduction of autonomy into the precision agriculture process, environmental exploration, disaster response, and other fields, one of the global demands is to navigate autonomous vehicles to completely cover entire unknown environments. In the previous complete coverage path planning (CCPP) research, however, autonomous vehicles need to consider mapping, obstacle avoidance, and route planning simultaneously during operating in the workspace, which results in an extremely complicated and computationally expensive navigation system. In this study, a new framework is developed in light of a hierarchical manner with the obtained environmental information and gradually solving navigation problems layer by layer, consisting of environmental mapping, path generation, CCPP, and dynamic obstacle avoidance. The first layer based on satellite images utilizes a deep learning method to generate the CCPP trajectory through the position of the autonomous vehicle. In the second layer, an obstacle fusion paradigm in the map is developed based on the unmanned aerial vehicle (UAV) onboard sensors. A nature-inspired algorithm is adopted for obstacle avoidance and CCPP re-joint. Equipped with the onboard LIDAR equipment, autonomous vehicles, in the third layer, dynamically avoid moving obstacles. Simulated experiments validate the effectiveness and robustness of the proposed framework.

Indexed as

complete coverage path planningDeep learning-based path generationnature-inspired path planningobstacle approximation and fusionre-joint paradigmvelocity-based local navigator

Identifiers

PMID35391941
PMCPMC8980723

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.