2020
DOI: 10.30684/etj.v38i3a.389
|View full text |Cite
|
Sign up to set email alerts
|

Development of Path Planning Algorithm Using Probabilistic Roadmap Based on Ant Colony Optimization

Abstract: n this paper, a unique combination among probabilistic roadmap, ant colony optimization, and third order B-spline curve has been proposed to solve path-planning problem in complex and very complex environments. This proposed method can be divided into three stages. First stage is to construct a random map depending on the environment complexity using probabilistic roadmap algorithm. This could be done by sampling N nodes randomly in complex and very complex static environments, then connecting these nodes toge… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
16
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 13 publications
(18 citation statements)
references
References 12 publications
0
16
0
Order By: Relevance
“…dRO and dRG are used to calculate the space between the robot and the obstacle, and the space between the robot and the target point, respectively using the Euclidean distance formula (4) and (5). Moreover, θ in the corner of the difference is required by the robot to detect the next iteration location in the environment.…”
Section: Objective Function (Cost Function)mentioning
confidence: 99%
See 1 more Smart Citation
“…dRO and dRG are used to calculate the space between the robot and the obstacle, and the space between the robot and the target point, respectively using the Euclidean distance formula (4) and (5). Moreover, θ in the corner of the difference is required by the robot to detect the next iteration location in the environment.…”
Section: Objective Function (Cost Function)mentioning
confidence: 99%
“…Generally, planning the movement of a mobile robot in an unfamiliar environment has been divided into three categories. The first one is based on information about the obstacles that might be known or unknown [5]. The second category is according to time, including online and offline planning [6].…”
Section: Introductionmentioning
confidence: 99%
“…α3 represents parameter of path smoothing for avoiding the sharp turning [15]. dRO and dRG are utilized for the calculation of space between robot and obstacle, and space between robot and its point of destination, respectively with the use of distance formulas (4) and (5). Moreover, θ in the corner of the variation is wanted by robot for the detection of the next iteration location in an environment.…”
Section: Objective Function (Cost Function)mentioning
confidence: 99%
“…Planning the mobile robot's locomotion in an uncommon environment is typically divided into three categories. The first depends on information regarding potential obstacles, which may or may not be known [5]. The second is a reference to time [6], [7], which includes both offline and online planning.…”
Section: Introductionmentioning
confidence: 99%
“…The researchers considered that trajectory planning is very substantial to the process of the robotic arm and the prominent target of trajectory planning is the generation of a path planning from the beginning to the target review for the fully or partially automated process [3], [5]. Discussion and analysis of motion techniques are investigated to find the path joint space and path planning selection approaches such as kinematics techniques.…”
Section: Introductionmentioning
confidence: 99%