2015
DOI: 10.1016/j.compeleceng.2015.01.009
|View full text |Cite
|
Sign up to set email alerts
|

A review of metaheuristics in robotics

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
11
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
5
4

Relationship

1
8

Authors

Journals

citations
Cited by 49 publications
(11 citation statements)
references
References 53 publications
0
11
0
Order By: Relevance
“…For instance, the simulation runs were aborted after the 98 th iteration during our experiment when one of the robots got stuck next to the wall obstacle. For the purpose of completing the exploration, the initial position of robot 2 or r 2 (from Table 1) was changed from (7,9) to (6,5). From these results, we can conclude that the exploration by the deterministic CME algorithm requires fine-tuning the map parameters for successful map coverage.…”
Section: Comparisonmentioning
confidence: 99%
“…For instance, the simulation runs were aborted after the 98 th iteration during our experiment when one of the robots got stuck next to the wall obstacle. For the purpose of completing the exploration, the initial position of robot 2 or r 2 (from Table 1) was changed from (7,9) to (6,5). From these results, we can conclude that the exploration by the deterministic CME algorithm requires fine-tuning the map parameters for successful map coverage.…”
Section: Comparisonmentioning
confidence: 99%
“…The algorithm converges much faster than any of the previous methods. The fifth paper focuses on applications of meta-heuristics in robotics [5]. Meta-heuristics are high-level nature-inspired strategies for collaborative robots to achieve common goals, which are not easily achievable with independent robots.…”
Section: Scanning the Issuementioning
confidence: 99%
“…The study [9] stated the drawback of this technique that refers to a lot of memory consumption, which results in a slow search of frontiers in unfavorable environments for forming a tree. To improve the process, an optimization mechanism [14], named a Random Frontier Points Optimization algorithm, was proposed to evaluate all frontier points iteratively according to exploration information, navigation cost, and accuracy of robot position.…”
Section: Related Workmentioning
confidence: 99%
“…The hunting begins with the searching for prey operator ( | ⃗ | > 1 ), in which a whale swarm follows a randomly selected whale ⃗ at iteration . In (14), the vector ⃗ ⃗⃗ computes the distance of the current whale ⃗ to the random whale position. Here, the stochastic parameter ⃗ gives some additional deviations for ⃗ ⃗⃗ that allows finding the ⃗ ( + 1) position around the ⃗ solution (15).…”
Section: ) Mathematical Modelmentioning
confidence: 99%