The Combination of Morphological and Evolutionary Algorithms for Graph-based Pathfinding on Maps with Complex Topologies-Reference-Cited by-同舟云学术

The Combination of Morphological and Evolutionary Algorithms for Graph-based Pathfinding on Maps with Complex Topologies

Published:2019-11-11 Issue: Volume: Page:
ISSN:
Container-title:GraphiCon'2019 Proceedings. Volume 2
language:
Short-container-title:

Author:

Савостин Игорь¹,Savostin Igor'²,Трубаков Андрей¹,Trubakov Andrey³

Affiliation:

1. Брянский государственный технический университет

2. Bryanskiy gosudarstvennyy tehnicheskiy universitet

3. Bryansk State Technical University

Abstract

One of the difficult problems to solve has always been and still remains the problem of finding a path either in a graphic chart or a graphic maze of large size. The main problem is that traditional algorithms require a lot of time due to combinatorial complexity. At the same time, both classical algorithms based on the search of variants (such as Dijkstra's algorithm, A*, ARA*, D* lite), and stochastic algorithms (ant algorithm, genetic), alongside with algorithms based on morphology (wave) are not always able to achieve the goal. The article proposes a new modification of the path-finding algorithm, which is a hybrid of the following: the morphological operations on graphic chart approach and genetic algorithm having a useful property of elasticity in time. The experiments (both synthetic and real data) have shown the feasibility of the proposed idea and its comparison with the most commonly used algorithms of contemporaneity.

Publisher

Bryansk State Technical University

Reference12 articles.

1. Alhanjouri M., Alfarra B. Ant Colony versus GeneticAlgorithm based on Travelling Salesman Problem //International Journal of Computer Technology andApplications. – Vol. 2, 2011. – pp. 570-578., Alhanjouri M., Alfarra B. Ant Colony versus GeneticAlgorithm based on Travelling Salesman Problem //International Journal of Computer Technology andApplications. – Vol. 2, 2011. – pp. 570-578.

2. Cormen T., Leiserson C., Rivest R., Stein C. Introductionto Algorithms. – 3rd edition. – The MIT Press, 2009. –1292 p., Cormen T., Leiserson C., Rivest R., Stein C. Introductionto Algorithms. – 3rd edition. – The MIT Press, 2009. –1292 p.

3. Delling, D.; Sanders, P.; Schultes, D.; Wagner, D.Engineering Route Planning Algorithms // Algorithmics ofLarge and Complex Networks: Design, Analysis, andSimulation. – Springer, 2009. – pp. 117-139., Delling, D.; Sanders, P.; Schultes, D.; Wagner, D.Engineering Route Planning Algorithms // Algorithmics ofLarge and Complex Networks: Design, Analysis, andSimulation. – Springer, 2009. – pp. 117-139.

4. Dorigo M., Maniezzo V. Colorni A.Ant System:Optimization by a Colony of Cooperating Agents // IEEETransactions on Systems, Man, and Cybernetics-Part B. –pp. 29-41., Dorigo M., Maniezzo V. Colorni A.Ant System:Optimization by a Colony of Cooperating Agents // IEEETransactions on Systems, Man, and Cybernetics-Part B. –pp. 29-41.

5. Gonzalez R.C., Woods R.E. Digital Image Processing. –4rd edition. – Prentice-Hall, 2018. – 976 p., Gonzalez R.C., Woods R.E. Digital Image Processing. –4rd edition. – Prentice-Hall, 2018. – 976 p.

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Research on Path Planning of Autonomous Vehicle Based on Improved Ant Colony Algorithm;2023 2nd International Conference on Artificial Intelligence, Human-Computer Interaction and Robotics (AIHCIR);2023-12-08

2. Method for Improving an Image Segment in a Video Stream Using Median Filtering and Blind Deconvolution Based on Evolutionary Algorithms;Proceedings of the 30th International Conference on Computer Graphics and Machine Vision (GraphiCon 2020). Part 2;2020-12-17