Development of aircraft path planning scheme through automatic dependent surveillance broadcast
by Yang Li; Jianhua Zhang; Xueli Wu; Jianan Huo; Zhuo Xu
International Journal of Computer Applications in Technology (IJCAT), Vol. 58, No. 1, 2018

Abstract: The intelligent flight task algorithm for aircraft is investigated to effectively determine and search the best flight routes under complicated conditions, where the conditions include the complicated topography and threats from other flights in the route airspace. The threat is detected by automatic dependent surveillance broadcast (ADS-B), which provides continual broadcast of aircraft position, identity, velocity and other information through unencrypted data links to generate a precise air picture for air traffic management. The proposed method comprises safety distance and path planning by pulse coupled neural networks. The safety distance is regarded as a pre-processing procedure for searching safety path. And the pulse coupled neural network is adopted to provide a smooth flight route for aircraft. The global optimal flight route is acquired through wave propagation by pulse coupled neural networks. The result of simulation demonstrated that the proposed method has the ability to provide the best flight routes efficiently for aircraft.

Online publication date: Fri, 03-Aug-2018

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 Computer Applications in Technology (IJCAT):
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