HomePage >> Journals >> Transactions on Computer Science and Technology

Transactions on Computer Science and Technology

Transactions on Computer Science and Technology is an international comprehensive professional academic journal of Ivy Publisher, concerning the development of computer science theory and technology application on the combination of computer science and modern industrial technology. The main focus of the journal is the academic papers and comments of latest power electronics theoretical and technical research improvement in the fields of nature s... [More] Transactions on Computer Science and Technology is an international comprehensive professional academic journal of Ivy Publisher, concerning the development of computer science theory and technology application on the combination of computer science and modern industrial technology. The main focus of the journal is the academic papers and comments of latest power electronics theoretical and technical research improvement in the fields of nature science, engineering technology, economy and science, report of latest research result, aiming at providing a good communication platform to transfer, share and discuss the theoretical and technical development of computer science theory and technology development for professionals, scholars and researchers in this field, reflecting the academic front level, promote academic change and foster the rapid expansion of computer science theory and application technology.

The journal receives manuscripts written in Chinese or English. As for Chinese papers, the following items in English are indispensible parts of the paper: paper title, author(s), author(s)'affiliation(s), abstract and keywords. If this is the first time you contribute an article to the journal, please format your manuscript as per the sample paper and then submit it into the online submission system. Accepted papers will immediately appear online followed by printed hard copies by Ivy Publisher globally. Therefore, the contributions should not be related to secret. The author takes sole responsibility for his views.

ISSN Print:2327-090X

ISSN Online:2327-0918

Email:cst@ivypub.org

Website: http://www.ivypub.org/cst/

  0
  0

Paper Infomation

Study on the Hierarchical Route Planning Under the Emergent Threats

Full Text(PDF, 1958KB)

Author: Caikun Zhang, Zhongfu Xu, Ying Cheng, Danhui Sun

Abstract: Hierarchical route planning method under the emergent threats is put forward for the emergent threats in the route planning problem. First, the basic ideas and framework of hierarchical planning are put forward on the basis of constraints of route planning. Then, the primary flight corridor planning of the bacterial foraging algorithm based on Gaussian distribution estimation algorithm and secondary optimal route planning based on heuristic A * algorithm are put forward in this paper. The primary planning effectively reduces planning domain, and the secondary planning is based on the primary planning. Real-time route planning can be carried out quickly and efficiently and the emergent threats can be effective to deal with. Finally, the simulation results prove that this method is not only scientific and reasonable, it also can effectively narrow the domain range and plan the route in real-time to avoid emergent threats.

Keywords: Route Planning, Bacterial Foraging Algorithm, Gaussian Distribution Estimation Algorithm, Heuristic A* Algorithm

References:

[1] Suresh M, Ghose D. Role of information and communication in redefining unmanned aerial vehicle autonomous control levels [J]. Journal of Aerospace Engineering, 224(2): 171-197, 2010.

[2] Zheng C W, Yan P, Ding M Y. research status and trend of route planning for flying vehicles [J]. Journal of Astronautics, 28(6): 1441-1446, 2007.

[3] Tuncer A, Yildirim M. Dynamic path planning of mobile robots with improved genetic algorithm [J]. Computers & Electrical Engineering, 38(6): 1564-1572, 2012.

[4] Duan H B, Yu Y A, Zhang X Y, er al. Three-dimension path planning for UCAV using hybrid meta-heuristic ACO-DE algorithm [J]. Simulation Modeling Practice and Theory, 18(8): 1104-1115, 2010.

[5] ZHAN W W, WANG W, CHEN N C, er al. Path Planning Strategies for UAV Based on Improved A* Algorithm [J]. Geomatics and Information Science of Wuhan University, 40(3): 315-320, 2015.

[6] Lin C L, Li Y H, Aouf N. Potential field based evolutionary route planner for the control of multiple unmanned aerial vehicles [J]. Journal of Aerospace Engineering, 224(11): 1229-1242, 2010.

[7] Alidanee B, Wang H B, Landram F. A note on integer programming formulations of the real-time optimal scheduling and fight path selection of UAVs [J]. IEEE Trans. On Control Systems Technology, 17(4): 839-843, 2009.

[8] Fu X W, Li J L, Gao X G. Defense penetration path planning for UCAV based on threat neting [J]. Acta Aeronautica et Astronautica Sinica, 35(4): 1042-1052, 2014.

[9] LI M, WANG D B, SHENG S Z, et al. Multiple route planning based on particle swarm optimization and weighted k-means clustering [J]. Systems Engineering and Electronics, 34(3):512-516, 2012.

[10] Zhang X J, Guan X M, Hwang I, et al. A hybrid distributed-centralized conflict resolution approach for multi-air-craft based on cooperative co-evolutionary [J]. Science China Information Sciences, 56(12): 1-16, 2013.

[11] Yu H, Yu Z, Li W H. Multiple routes for air vehicles based on niche particle swarm optimization [J]. Journal of Northwestern Polytechnical University, 28(3): 415-420, 2010.

[12] Xu X Q, Zhu Q B. Multi-artificial fish-swarm algorithm and a rule library based dynamic collision avoidance algorithm for robot path planning in a dynamic environment [J]. Acta Electronica Sinica, 40(8): 1694-1700, 2012.

[13] LIU X L, LI R J, YANG P. Bacterial foraging optimization algorithm based on estimation of distribution [J]. Control and Decision, 26(8): 1233-1238, 2011.

[14] JIANG J G, ZHOU J W, ZHENG Y C, et al. Adaptive bacterial foraging optimization algorithm [J]. JOURNAL OF XIDIAN UNIVERSITY, 42(1): 75-81, 2015.

[15] XI Z H, LI H B, LIU H P, et al. Multiple object tracking using A* algorithm optimization [J]. J Tsinghua Univ (Sci &. Technol), 54(12): 1549-1554, 2014.

[16] XIN Y, LIANG H W, DU M B, et al. An Improved A* Algorithm for Searching Infinite Neighbourhoods [J]. ROBOT, 36(5): 627-633, 2014.

Privacy Policy | Copyright © 2011-2024 Ivy Publisher. All Rights Reserved.

Contact: customer@ivypub.org