Zobrazeno 1 - 10
of 1 507
pro vyhledávání: '"Incremental heuristic search"'
Publikováno v:
Frontiers in Neurorobotics, Vol 16 (2022)
During task execution, the autonomous robots would likely pass through many narrow corridors along with mobile obstacles in dynamically complex environments. In this case, the off-line path planning algorithm is rather difficult to be directly implem
Externí odkaz:
https://doaj.org/article/9fe41efc3e7b4ebfadc81ff95bcebf4b
Publikováno v:
IEEE Access, Vol 8, Pp 116724-116732 (2020)
Incremental heuristic search algorithms are a class of heuristic search algorithms applicable to the problem of goal-directed navigation. D* and D*Lite are among the most well-known algorithms for this problem. Recently, two new algorithms have been
Externí odkaz:
https://doaj.org/article/96b16fc62a1e4d8483b8ef898191bfe6
Autor:
Przybylski Maciej, Putz Barbara
Publikováno v:
International Journal of Applied Mathematics and Computer Science, Vol 27, Iss 2, Pp 273-290 (2017)
Searching for the shortest-path in an unknown or changeable environment is a common problem in robotics and video games, in which agents need to update maps and to perform re-planning in order to complete their missions. D* Lite is a popular incremen
Externí odkaz:
https://doaj.org/article/d740997f60784747a2d47df3d22df8ae
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:
Barbara Putz, Maciej Przybylski
Publikováno v:
International Journal of Applied Mathematics and Computer Science, Vol 27, Iss 2, Pp 273-290 (2017)
Searching for the shortest-path in an unknown or changeable environment is a common problem in robotics and video games, in which agents need to update maps and to perform re-planning in order to complete their missions. D* Lite is a popular incremen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::05564e6101a2db51b94a4a9276d06367
https://doaj.org/article/d740997f60784747a2d47df3d22df8ae
https://doaj.org/article/d740997f60784747a2d47df3d22df8ae
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030586652
BPM
BPM
The execution of (business) processes generates valuable tra-ces of event data in the information systems employed within companies. Recently, approaches for monitoring the correctness of the execution of running processes have been developed in the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5ac35942173b0c76e4fda13caa4d5c47
https://doi.org/10.1007/978-3-030-58666-9_9
https://doi.org/10.1007/978-3-030-58666-9_9
Autor:
John G. Baylog, Thomas A. Wettergren
Publikováno v:
IEEE Journal of Oceanic Engineering. 43:843-855
This paper addresses the high-level search planning that is necessary to find hidden objects in difficult undersea environments where sensor performance varies geographically and the susceptibility to false alarms is high. We develop a game-theoretic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::148174bb0263ee3ca51a73fa932d5320
https://doi.org/10.1109/joe.2017.2752078
https://doi.org/10.1109/joe.2017.2752078
Publikováno v:
Journal of Computational and Applied Mathematics. 330:586-604
In this paper, an extended nonmonotone line search is proposed to improve the efficiency of the existing line searches. This line search is first proved to be an extension of the classical line search rules. On the one hand, under mild assumptions, g
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::91c03e93aed7c049f8e5815f964866a0
https://doi.org/10.1016/j.cam.2017.09.026
https://doi.org/10.1016/j.cam.2017.09.026
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.
Publikováno v:
Bulletin of Bryansk state technical university. 2017:122-127
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7d2b1b7356cbb0f5b4ae17cf216f63ec
https://doi.org/10.12737/article_5a02fa07c12da0.87522967
https://doi.org/10.12737/article_5a02fa07c12da0.87522967