Application of multi-objective firefly algorithm based on archive learning in robot path planning
by Tanghuai Fan; Jiayuan Wang; Mirong Feng; Xi Zhang; Jiajia Wang; Runxiu Wu
International Journal of Intelligent Information and Database Systems (IJIIDS), Vol. 12, No. 3, 2019

Abstract: Addressing the defects of slow convergence and low solution precision with multi-objective firefly algorithm, we propose a multi-objective firefly algorithm based on archive learning. The algorithm saves the elite particles obtained from each generation in an external archive and then randomly selects a particle from the external file as the learning object of the firefly to participate in the population evolution. The algorithm was verified by four test functions ZDT1, ZDT2, ZDT3 and ZDT6 and evaluated by IGD comprehensive evaluation index. Experiments have shown that the modified firefly algorithm does not only have a higher ability to escape from local optima, but also displays a significant improvement in convergence speed and solution precision. Our algorithm is more suitable for multi-objective optimisation problems that have a higher complexity. When applied to robot path planning, our modified algorithm can yield shorter length and higher smoothness of the path.

Online publication date: Fri, 11-Oct-2019

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Intelligent Information and Database Systems (IJIIDS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com