2023
DOI: 10.3390/s23104647
|View full text |Cite
|
Sign up to set email alerts
|

Biologically Inspired Complete Coverage Path Planning Algorithm Based on Q-Learning

Abstract: Complete coverage path planning requires that the mobile robot traverse all reachable positions in the environmental map. Aiming at the problems of local optimal path and high path coverage ratio in the complete coverage path planning of the traditional biologically inspired neural network algorithm, a complete coverage path planning algorithm based on Q-learning is proposed. The global environment information is introduced by the reinforcement learning method in the proposed algorithm. In addition, the Q-lear… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
3
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 9 publications
(4 citation statements)
references
References 24 publications
0
3
0
Order By: Relevance
“…In order to mitigate these challenges, several papers have proposed modified QL techniques that are designed to reduce the computational burden by disregarding obstructed areas (Buono, Priandana, Wahjuni, et al, 2023). An alternative avenue involves the integration of neural networks, which leads to the attainment of comprehensive coverage path planning, as it optimizes the path planning strategy in the vicinity of obstacles (Tan, Han, Gong, & Wu, 2023). Moreover, in the realm of wheeled vehicles, such as Ackermann robots, can be combined with Bezier curves to generate smooth trajectories (Zhang, 2023).…”
Section: Background and Related Workmentioning
confidence: 99%
“…In order to mitigate these challenges, several papers have proposed modified QL techniques that are designed to reduce the computational burden by disregarding obstructed areas (Buono, Priandana, Wahjuni, et al, 2023). An alternative avenue involves the integration of neural networks, which leads to the attainment of comprehensive coverage path planning, as it optimizes the path planning strategy in the vicinity of obstacles (Tan, Han, Gong, & Wu, 2023). Moreover, in the realm of wheeled vehicles, such as Ackermann robots, can be combined with Bezier curves to generate smooth trajectories (Zhang, 2023).…”
Section: Background and Related Workmentioning
confidence: 99%
“…Besides, they work with several dynamic search sub‐teams that collaborate to optimize the solution and obtain the next movement path of each robot. Somehow similar, in (Tan et al, 2023) The global environment information is introduced by Q‐learning reinforcement learning method in a complete coverage path planning biologically inspired neural network algorithm. Besides, the Q‐learning method is used for path planning at the positions where the accessible way points are changed, which optimizes the path planning strategy near these obstacles.…”
Section: Related Workmentioning
confidence: 99%
“…Li [26] proposed a heuristic approximate credit-based Dubins multi-robot coverage path planning (CDM) algorithm, which utilizes the credit model to balance tasks among robots and a tree partition strategy to reduce complexity. Tan [27] proposed a complete coverage path planning algorithm based on Q-learning to solve the problems of local optimal path and high path coverage ratio in the complete coverage path planning of the traditional biologically inspired neural network algorithm. Lu [28] proposed Turn-minimizing Multirobot Spanning Tree Coverage Star (TMSTC*), an improved multirobot coverage path planning (mCPP) algorithm based on MSTC*.…”
Section: Introductionmentioning
confidence: 99%