Evidence map›Paper›PMID 38894362›Full record

ReviewSensors (Basel, Switzerland)2024

Obstacle Avoidance and Path Planning Methods for Autonomous Navigation of Mobile Robot.

Kornél Katona, Husam A Neamah, Péter Korondi

Abstract readReview
In one paragraph

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

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

14 citing papers in PubMed.

  1. Review
  2. Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. Article
  8. Article
  9. Article
  10. Article
  11. Article
  12. Article
  13. Article
  14. 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

3 authors.

Kornél KatonaDepartment of Electrical Engineering and Mechatronics, Faculty of Engineering, University of Debrecen, 4028 Debrecen, Hungary.ORCID 0009-0008-4162-2312
Husam A NeamahDepartment of Electrical Engineering and Mechatronics, Faculty of Engineering, University of Debrecen, 4028 Debrecen, Hungary.ORCID 0000-0003-0430-8400
Péter KorondiDepartment of Electrical Engineering and Mechatronics, Faculty of Engineering, University of Debrecen, 4028 Debrecen, Hungary.ORCID 0000-0002-0016-0384

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Path planning creates the shortest path from the source to the destination based on sensory information obtained from the environment. Within path planning, obstacle avoidance is a crucial task in robotics, as the autonomous operation of robots needs to reach their destination without collisions. Obstacle avoidance algorithms play a key role in robotics and autonomous vehicles. These algorithms enable robots to navigate their environment efficiently, minimizing the risk of collisions and safely avoiding obstacles. This article provides an overview of key obstacle avoidance algorithms, including classic techniques such as the Bug algorithm and Dijkstra's algorithm, and newer developments like genetic algorithms and approaches based on neural networks. It analyzes in detail the advantages, limitations, and application areas of these algorithms and highlights current research directions in obstacle avoidance robotics. This article aims to provide comprehensive insight into the current state and prospects of obstacle avoidance algorithms in robotics applications. It also mentions the use of predictive methods and deep learning strategies.

Indexed as

autonomous vehiclesglobal path planninglocal path planningnavigation algorithmsobstacle avoidance

Identifiers

PMID38894362
PMCPMC11175283

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.