Zobrazeno 1 - 10
of 521
pro vyhledávání: '"Heuristic function"'
Publikováno v:
Mathematical Biosciences and Engineering, Vol 21, Iss 2, Pp 2302-2322 (2024)
For the autonomous surface vehicle (ASV) planning problem, an enhanced A* method incorporating encrypted memory database for ASV efficient local path planning is proposed. Considering the current various path planning problems mostly use methods with
Externí odkaz:
https://doaj.org/article/cb2c6d0da113437680569466f36fbd0a
Publikováno v:
Applied Sciences, Vol 14, Iss 13, p 5622 (2024)
Aiming to address the A* algorithm’s issues of traversing a large number of nodes, long search times, and large turning angles in path planning, a strategy for multiple improvements to the A* algorithm is proposed. Firstly, the calculation of the h
Externí odkaz:
https://doaj.org/article/e1506d29fd30490299246e6b8631068a
Autor:
Zhou Ximin
Publikováno v:
Applied Mathematics and Nonlinear Sciences, Vol 9, Iss 1 (2024)
The limited nature of logistics and distribution vehicles and the variability of customer acceptance service time limit the service efficiency and quality of logistics and distribution. To optimize a logistics distribution path under capacity and tim
Externí odkaz:
https://doaj.org/article/49ade310794f4140ad3ad6b4407be372
Application study of ant colony algorithm for network data transmission path scheduling optimization
Autor:
Xiao Peng
Publikováno v:
Journal of Intelligent Systems, Vol 32, Iss 1, Pp 71-82 (2023)
With the rapid development of the information age, the traditional data center network management can no longer meet the rapid expansion of network data traffic needs. Therefore, the research uses the biological ant colony foraging behavior to find t
Externí odkaz:
https://doaj.org/article/1bf6e18037984d008fb4c06779a8e157
Publikováno v:
Information, Vol 15, Iss 5, p 283 (2024)
Opportunistic Networks (OppNets) are characterized by intermittently connected nodes with fluctuating performance. Their dynamic topology, caused by node movement, activation, and deactivation, often relies on controlled flooding for routing, leading
Externí odkaz:
https://doaj.org/article/1a3f42e756f049939e596dada5e67615
Publikováno v:
IEEE Access, Vol 11, Pp 121306-121313 (2023)
Processing the system’s dependency matrix is a core procedure for system diagnosis. However, the present algorithms for this job always try to maximize its fault isolation capability, which is thus not only unnecessary for the system that cannot be
Externí odkaz:
https://doaj.org/article/ba79f7d601674bc7a635f36666eabb6a
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Haoxin Liu, Yonghui Zhang
Publikováno v:
IEEE Access, Vol 10, Pp 99498-99515 (2022)
The traditional A-star algorithm has many search nodes, and the obtained path has polylines and cannot avoid local unknown obstacles. In response to these problems, this paper proposes a new improved A-star algorithm suitable for indoor cleaning robo
Externí odkaz:
https://doaj.org/article/daa508c7820c47c693a9dbf6539714be
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.