2020
DOI: 10.1080/0952813x.2020.1764631
|View full text |Cite
|
Sign up to set email alerts
|

Online path planning of mobile robot using grasshopper algorithm in a dynamic and unknown environment

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
12
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6
1
1

Relationship

1
7

Authors

Journals

citations
Cited by 16 publications
(12 citation statements)
references
References 23 publications
0
12
0
Order By: Relevance
“…The predicted potential field, as well as quadratic terms of tracking, inputs, changes in inputs, and slack variables, are all included in the objective function, with weighting matrices Q , R, S, and P, respectively. The predicted states are obtained by (8). The tracking output is calculated by (9).…”
Section: Mpc Frameworkmentioning
confidence: 99%
See 1 more Smart Citation
“…The predicted potential field, as well as quadratic terms of tracking, inputs, changes in inputs, and slack variables, are all included in the objective function, with weighting matrices Q , R, S, and P, respectively. The predicted states are obtained by (8). The tracking output is calculated by (9).…”
Section: Mpc Frameworkmentioning
confidence: 99%
“…Heuristic approaches are presented to overcome the limitations of conventional methods. Probabilistic Roadmap [4], Simulated Annealing [5], Ant Colony Optimization [6], Particle Swarm Optimization [7], and Grasshopper optimization [8] are a few examples of heuristic methods. However, these algorithms have problems in static and dynamic environments.…”
Section: Introductionmentioning
confidence: 99%
“…Compared with the PSO, grasshopper optimization displays distinct advantages with time and smoothness. On the other hand, the same authors [3] presented safe and smooth pathfinding for a mobile robot that can traverse from a starting point to a destination point without colliding obstacles. Four circles (different radii on the range sensor) estimate obstacle direction.…”
Section: Figure 1 Optimization Algorithms Typesmentioning
confidence: 99%
“…Some of these problems are increasingly complex, which becomes difficult to solve and optimize using conventional mathematical methods. Path planning is one of the NP-Hard problems, which requires a high computational cost to be solved using classical methods [1]- [3]. Metaheuristic methods have been proposed to overcome the complexity of classical methods.…”
Section: Introductionmentioning
confidence: 99%
“…Emli and Efe 47 have presented online route outlining of robot using grasshopper algorithm. A collision-free path is obtained through implementation of the algorithm in unknown workspaces.…”
Section: Introductionmentioning
confidence: 99%