Path planning of hovercraft using an adaptive ant colony with an artificial potential field algorithm
by Zain Anwar Ali; Zhangang Han
International Journal of Modelling, Identification and Control (IJMIC), Vol. 39, No. 4, 2021

Abstract: This study designs a novel strategy by combining the adaptive ant colony optimisation (ACO) method with the artificial potential field (APF) algorithm. The classic ACO algorithm has multiple limitations like falling into local optimum, slow convergence rate, etc. This hybrid strategy aims to counter the aforementioned problems. This study discusses the previous and current works in the concerned research area to better understand the solutions available and then try to improve them further. Then, this paper presents the mathematical model of the hovercraft. Afterward, this study designs the novel hybrid method by using the adaptive ACO in conjunction with the APF method. We use two different scenarios in simulation to test the validity of the designed strategy. First, we test the hybrid method in an environment with predetermined obstacles. Secondly, we use a dynamic mission area with shifting obstacles to further prove the efficiency of the designed method. The simulation results prove that the designed strategy is more effective and robust than traditional ACO. It converges quicker and finds the optimal path.

Online publication date: Mon, 04-Jul-2022

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 Modelling, Identification and Control (IJMIC):
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