Zobrazeno 1 - 10
of 193
pro vyhledávání: '"Fringe search"'
Publikováno v:
IEEE Access, Vol 8, Pp 161805-161815 (2020)
Over the past few years, mobile robots are widely used in various industries because they can navigate in dynamic environments and carry out everyday tasks efficiently. Path planning undoubtedly plays an important role in mobile robot navigation, thu
Externí odkaz:
https://doaj.org/article/8bb42f88cd94434a854a1fd637a72fe4
Publikováno v:
IEEE Access, Vol 8, Pp 161805-161815 (2020)
Over the past few years, mobile robots are widely used in various industries because they can navigate in dynamic environments and carry out everyday tasks efficiently. Path planning undoubtedly plays an important role in mobile robot navigation, thu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ce887ebbf8842b713f4fa886d983f9b2
https://ieeexplore.ieee.org/document/9186019/
https://ieeexplore.ieee.org/document/9186019/
Publikováno v:
Engineering the Future
In a number of applications, the problem of determining the optimum path occurs. This applications range from finding the fastest path in a network, to determining the safest path for mobile vehicle, wandering on the surface of Mars. In this context,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::432d05af34845b7ba292b4b1097c039f
http://www.intechopen.com/articles/show/title/graph-search-techniques-for-mobile-robot-path-planning
http://www.intechopen.com/articles/show/title/graph-search-techniques-for-mobile-robot-path-planning
Publikováno v:
SCIENTIA SINICA Physica, Mechanica & Astronomica. 51:119505
The dynamic dual-target very long baseline interferometry (VLBI) processing technology applied to the CVNScorr software processor is introduced. Chang’e 5 (CE-5) has achieved China’s first sample return mission from an extraterrestrial body. The
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9c9e3feb1cd3da2d86895863d0edea81
https://doi.org/10.1360/sspma-2021-0077
https://doi.org/10.1360/sspma-2021-0077
Publikováno v:
Artificial Intelligence. 252:232-266
Bidirectional search algorithms interleave two separate searches, a normal search forward from the start state, and a search backward from the goal. It is well known that adding a heuristic to unidirectional search dramatically reduces the search eff
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::19450b4ec138ffbe1b53e9d1050c74f7
https://doi.org/10.1016/j.artint.2017.05.004
https://doi.org/10.1016/j.artint.2017.05.004
Publikováno v:
The Journal of Supercomputing. 76:7777-7804
In many complex networks, there exist diverse network topologies as well as node attributes. However, the state-of-the-art community search methods which aim to find out communities containing the query nodes only consider the network topology, but i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e0acb93418bd464e9db3cc88179d1c53
https://doi.org/10.1007/s11227-017-1976-z
https://doi.org/10.1007/s11227-017-1976-z
Publikováno v:
Optik. 131:207-214
Newton iterative search positioning algorithm and Taylor series expansion search algorithm are the common positioning methods, the performance of the algorithms is sensitive to the selection of the initial coordinates, and the speed of multidimension
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ad9ed196a9331a5f1b24cda2c62478fd
https://doi.org/10.1016/j.ijleo.2016.11.094
https://doi.org/10.1016/j.ijleo.2016.11.094
Autor:
Wang Minhui, Gao Xia
Publikováno v:
Multimedia Tools and Applications. 76:17231-17253
A* algorithm is widely used in the game for diameter, is currently one of the more popular heuristic search algorithm, but the algorithm has the problem of searching time and path. In this paper, a bidirectional search A* algorithm is proposed to imp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d0b130fcb46942e8b060e50adb595180
https://doi.org/10.1007/s11042-016-3982-1
https://doi.org/10.1007/s11042-016-3982-1
Publikováno v:
Reliability Engineering & System Safety. 150:1-10
Minimal paths (MPs) play an important role in network reliability evaluation. In this paper, we report an efficient recursive algorithm for finding all MPs in two-terminal networks, which consist of a source node and a sink node. A linked path struct
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aae80593b4410b25d9cdb78ccff60843
https://doi.org/10.1016/j.ress.2016.01.011
https://doi.org/10.1016/j.ress.2016.01.011
Publikováno v:
COMPUTER COMMUNICATIONS. 73:118-131
Searching content in mobile opportunistic networks is a difficult problem due to the dynamically changing topology and intermittent connections. Moreover, due to the lack of global view of the network, it is arduous to determine whether the best resp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b74ce7811af1591b411670c084a054d0
http://juuli.fi/Record/0274555816
http://juuli.fi/Record/0274555816