2012 Fifth International Joint Conference on Computational Sciences and Optimization 2012
DOI: 10.1109/cso.2012.174
|View full text |Cite
|
Sign up to set email alerts
|

A New Path Planning Method Based on Firefly Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
25
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
5
5

Relationship

0
10

Authors

Journals

citations
Cited by 49 publications
(27 citation statements)
references
References 2 publications
0
25
0
Order By: Relevance
“…This new method can be applied to a large number of real-time applications. Liu et al [11] proposed a path planning method based on firefly algorithm. After the detailed study of the algorithm some random parameters and absorption parameters were designed.…”
Section: Literature Reviewmentioning
confidence: 99%
“…This new method can be applied to a large number of real-time applications. Liu et al [11] proposed a path planning method based on firefly algorithm. After the detailed study of the algorithm some random parameters and absorption parameters were designed.…”
Section: Literature Reviewmentioning
confidence: 99%
“…The firefly search algorithm and its variants have been applied to trajectory optimization [56][57][58], control parameter optimization [59,60], and dynamics [ [61][62][63] in what can be considered as an introductory investigation by looking for initial successes in applying the FA toward these astronautical research areas.…”
Section: Firefly Search Algorithmmentioning
confidence: 99%
“…In short, 5 years since it is presented, FA has been successfully applied in many areas, such as vector quantization in image compression [41], traveling salesman problem [42], path planning [43,44], PID controller tuning [45], nonlinear optimization problem [46], job shop, Flowshop and project scheduling problems [47][48][49], data clustering [50] and so on. These research demonstrates the high efficiency of FA to solve the NP-hard and combinatorial optimization problem.…”
Section: Introductionmentioning
confidence: 99%