| Title: |
Research on navigation of bidirectional A* algorithm based on ant colony algorithm. |
| Authors: |
Chen, Yu-qiang1 (AUTHOR) chenyuqiang@126.com, Guo, Jian-lan1 (AUTHOR), Yang, Huaide1 (AUTHOR), Wang, Zheng-qin2 (AUTHOR), Liu, Hong-ling2 (AUTHOR) |
| Source: |
Journal of Supercomputing. 2021, Vol. 77 Issue 2, p1958-1975. 18p. |
| Subject Terms: |
*ANT algorithms, *SEARCH algorithms, *HEURISTIC algorithms, *ANTS, *ALGORITHMS |
| Abstract: |
To overcome the lengthy search time, massive space occupation, and overlong planned path of the traditional A* algorithm, this paper integrates the bidirectional search with the intelligent ant colony algorithm to obtain the heuristic function selection factor, and uses the factor to improve the evaluation function of the algorithm. The simulation results show that the improved algorithm achieved better dynamic navigation than the traditional A* algorithm both in search time and distance, featuring shorter path searching time and the algorithm running time. Therefore, the result of this research has effectively reduced the search time and enhanced the dynamic search. [ABSTRACT FROM AUTHOR] |
|
Copyright of Journal of Supercomputing is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Academic Search Complete |
|
Full text is not displayed to guests. |
Login for full access.
|
