2021
DOI: 10.1049/tje2.12009
|View full text |Cite
|
Sign up to set email alerts
|

A novel path planning algorithm for mobile robot in dynamic environments using modified bat swarm optimization

Abstract: This paper describes the path planning of an autonomous mobile robot using an advanced version of the swarm bat algorithm in a time-varying situation. The foremost objective of this present contribution is to acquire the shortest path between the initial and endpoint avoiding dynamic obstacles. In this work, an adaptation of the frequency parameter of the standard bat algorithm to develop an improved version known as the modified frequency bat (MFB) algorithm is proposed. The modified frequency bat algorithm w… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
10
0
1

Year Published

2022
2022
2025
2025

Publication Types

Select...
8

Relationship

1
7

Authors

Journals

citations
Cited by 21 publications
(11 citation statements)
references
References 31 publications
0
10
0
1
Order By: Relevance
“…where the parameter β i is a random number that increases through time for every individual bat and producing low-frequency pulses at the beginning periods of the searching task. These frequency pulses increase through time to enhance the global hunting convergence, 46 r is a random number (0,1), t is iteration index, ρ = 0.01 (in our work), z * is the current best position solution, obtained by comparing all m competing solutions. For exploitation phase, when a point is nominated among the present best points, a new point is produced for every individual bat locally using a random walk…”
Section: Resultsmentioning
confidence: 99%
“…where the parameter β i is a random number that increases through time for every individual bat and producing low-frequency pulses at the beginning periods of the searching task. These frequency pulses increase through time to enhance the global hunting convergence, 46 r is a random number (0,1), t is iteration index, ρ = 0.01 (in our work), z * is the current best position solution, obtained by comparing all m competing solutions. For exploitation phase, when a point is nominated among the present best points, a new point is produced for every individual bat locally using a random walk…”
Section: Resultsmentioning
confidence: 99%
“…Однією з основних переваг алгоритму кажана є швидкість його виконання, завдяки чому він знайшов широке використання для планування шляху АМР [44][45][46].…”
Section: алгоритм кажанаunclassified
“…In particular, neural network based methods are proposed in [20][21][22] and adaptive fuzzy control methods are studied in [23][24][25]. The combination of neural network and adaptive fuzzy control methods are also designed in [26], [27] and swarm optimization based method is proposed in [28]. In order to obtain the robustness in the intelligent control methods, neural network-based SMC methods are developed in [29][30][31].…”
mentioning
confidence: 99%
“…In addition, because precise values of the inertial parameters of the links constituting the manipulator cannot be readily obtained, the resulting overall robot manipulator dynamics are complicated and difficult to obtain. Several studies ( [20][21][22][23][24][25][26][27][28][29]) have considered a few of these issues and are based on model-based control methods in which nominal manipulator dynamics are still required. Although the adaptive decentralized manipulator control methods proposed in [33], [34] do not require the manipulator dynamics for control, and the resulting residual dynamics are considered as uncertainties, the effects of the uncertainties are significant in this case; thus, the uncertainties cannot be sufficiently compensated by SMC and DOBs, as will be verified in the experimental results of this study.…”
mentioning
confidence: 99%
See 1 more Smart Citation