Optimization and application of artificial intelligence routing algorithm

In order to optimize the artificial intelligence routing algorithm, combined with the calculation of the direction of the vector space model, three strategies are proposed to optimize the A* algorithm. The A* algorithm is widely used in the fields of GIS system and game path finding system. However, with the expansion of the scale of the search map, its performance consumption has increased exponentially. First of all, the first step of A* algorithm is to move towards the target direction by using directional factors, so that the intermediate route process will approach the shortest path as soon as possible. Secondly, the direction factor is used to ensure that the path finding of A* algorithm is the priority point in the direction of the target. Finally, the fault tolerance process is carried out. When the direction factor is guided to the “dead end”, it can be traced back, to ensure that the shortest path can be found at the end. The results show that the A * optimization algorithm is effective. The performance of A * optimization algorithm is about 20–50% higher than the traditional A * algorithm. The best case reached 88.6%. Therefore, the proposed optimization method improves the efficiency of the algorithm and reduces the performance consumption of the algorithm.

[1]  Erol Gelenbe,et al.  Managing Crowds in Hazards With Dynamic Grouping , 2015, IEEE Access.

[2]  Shadi Aljawarneh,et al.  BeesAnts: a new nature-inspired routing algorithm , 2013, Int. J. Commun. Networks Distributed Syst..

[3]  Prasanta K. Jana,et al.  Energy efficient clustering and routing algorithms for wireless sensor networks: Particle swarm optimization approach , 2014, Eng. Appl. Artif. Intell..

[4]  Gulay Tezel,et al.  Estimation of the Change in Lake Water Level by Artificial Intelligence Methods , 2014, Water Resources Management.

[5]  Dragan Simic,et al.  A Survey of Hybrid Artificial Intelligence Algorithms for Dynamic Vehicle Routing Problem , 2015, HAIS.

[6]  Kun-Hee Han,et al.  Tree-based routing algorithms on wireless sensor networks: survey , 2014, J. Syst. Inf. Technol..

[7]  Iakovos S. Venieris,et al.  An Efficient Hybrid Genetic Algorithm for Finding (Near-) Optimal Steiner Trees: an Approach to Routing of Multipoint Connections , 2000 .

[8]  K. Kumaravel and A. Marimuthu.  An Efficient Multi-path Routing Algorithm Based on Hybrid Firefly Algorithm for Wireless Mesh Networks , 2015 .

[9]  Vahid Majazi Dalfard,et al.  A new intelligence algorithm for determination of shortest path for dynamic guidance of vehicles based on service level criterion , 2014 .

[10]  Babak Emami Abarghouei,et al.  DNACK: False Data Detection Based on Negative Acknowledgment and Digital Signature on Mobile Ad-hoc Network , 2015, Wirel. Pers. Commun..

[11]  Hui Cheng,et al.  Multi-robot navigation based QoS routing in self-organizing networks , 2013, Eng. Appl. Artif. Intell..

[12]  Kok-Lim Alvin Yau,et al.  Application of reinforcement learning to routing in distributed wireless networks: a review , 2013, Artificial Intelligence Review.

[13]  Prasanta K. Jana,et al.  Energy efficient fault tolerant clustering and routing algorithms for wireless sensor networks , 2015, Comput. Electr. Eng..

[14]  Prasanta K. Jana,et al.  Energy Efficient Clustering and Routing Algorithms for Wireless Sensor Networks: GA Based Approach , 2015, Wireless Personal Communications.

[15]  Yang-Hsin Fan.  Line Probe Routing Algorithm Implementation for SOC , 2014, ICS.

[16]  Magdalene Marinaki,et al.  A hybrid clonal selection algorithm for the location routing problem with stochastic demands , 2014, Annals of Mathematics and Artificial Intelligence.