Zobrazeno 1 - 10
of 29
pro vyhledávání: '"Sandip Aine"'
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 6:78-86
Recently, several researchers have brought forth the benefits of searching with multiple (and possibly inadmissible) heuristics, arguing how different heuristics could be independently useful in different parts of the state space. However, algorithms
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5ac59486c3e07d3798bc5e105334ab68
https://doi.org/10.1609/socs.v6i1.18350
https://doi.org/10.1609/socs.v6i1.18350
Autor:
Sandip Aine, Maxim Likhachev
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 4:2-10
Incremental heuristic searches reuse their previous search efforts to speed up the current search. Anytime search algorithms iteratively tune the solutions based on available search time. Anytime D* (AD*) is an incremental anytime search algorithm th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::39bee2801e9e435c9c55c262e678882d
https://doi.org/10.1609/socs.v4i1.18295
https://doi.org/10.1609/socs.v4i1.18295
Parallel search algorithms harness the multithreading capability of modern processors to achieve faster planning. One such algorithm is PA*SE (Parallel A* for Slow Expansions), which parallelizes state expansions to achieve faster planning in domains
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::34b0d2b72410afaded4af9924e2f8d0a
http://arxiv.org/abs/2203.01369
http://arxiv.org/abs/2203.01369
Publikováno v:
2021 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::29d00b73732cbbe951e6438b18fa0314
https://doi.org/10.1109/iros51168.2021.9636274
https://doi.org/10.1109/iros51168.2021.9636274
Paths planned over grids can often be suboptimal in an Euclidean space and contain a large number of unnecessary turns. Consequently, researchers have looked into post-processing techniques to improve the paths after they are planned. In this paper,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b7902789fc9ba35ccb7ae4392dc28ef7
http://arxiv.org/abs/2105.03833
http://arxiv.org/abs/2105.03833
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 5:207-208
We present a novel heuristic search framework, called Multi-Heuristic A* (MHA*), that simultaneously uses multiple, arbitrarily inadmissible heuristic functions and one consistent heuristic to search for complete and bounded suboptimal solutions. Thi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e479b5f0ff560e4a8bf7aa672c2cd848
https://doi.org/10.1609/socs.v5i1.18306
https://doi.org/10.1609/socs.v5i1.18306
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 10:192-193
Designing good heuristic functions for graph search requires adequate domain knowledge. It is often easy to design heuristics that perform well and correlate with the underlying true cost-to-go values in certain parts of the search space but these ma
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cb6859391b71af5cbdf1fd0c40354568
https://doi.org/10.1609/socs.v10i1.18486
https://doi.org/10.1609/socs.v10i1.18486
Autor:
Maxim Likhachev, Sandip Aine
Publikováno v:
Artificial Intelligence. 234:49-77
Incremental heuristic search algorithms reuse their previous search efforts whenever these are available. As a result, they can often solve a sequence of similar planning problems faster than planning from scratch. State-of-the-art incremental heuris
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e80d259d8ad59dad42c5698cfb354c33
https://doi.org/10.1016/j.artint.2016.01.009
https://doi.org/10.1016/j.artint.2016.01.009
Autor:
Sandip Aine, P. B. Sujit
Publikováno v:
Proceedings of the International Conference on Automated Planning and Scheduling. 26:441-449
Path planning for nonholonomic robots in real-life environments is a challenging problem, as the planner needs to consider the presence of obstacles, the kinematic constraints, and also the environmental disturbances (like wind and currents). In this
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7f15d2ba3ade932b653ac5a711ca4aae
https://doi.org/10.1609/icaps.v26i1.13797
https://doi.org/10.1609/icaps.v26i1.13797
Autor:
Sandip Aine, Maxim Likhachev
Publikováno v:
Proceedings of the International Conference on Automated Planning and Scheduling. 26:11-19
Over the years, a number of search algorithms have been proposed in AI literature, ranging from best-first to depth-first searches, from incomplete to optimal searches, from linear memory to unbounded memory searches; each having their strengths and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b2e6f5e77b671bd0dc0a9fc277e81bc9
https://doi.org/10.1609/icaps.v26i1.13760
https://doi.org/10.1609/icaps.v26i1.13760