Zobrazeno 1 - 10
of 50
pro vyhledávání: '"Daniel, Harabor"'
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 15:145-152
The ability to quickly compute shortest paths in 3D grids is a technological enabler for several applications such as pipe routing and computer video games. The main challenge is how to deal with the many symmetric permutations of each shortest path.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dc36109c367da3d4246da6355af57792
https://doi.org/10.1609/socs.v15i1.21762
https://doi.org/10.1609/socs.v15i1.21762
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 15:218-222
Pathfinding is a central topic in AI for games, with many approaches having been suggested. But comparing different algorithms is tricky, because design choices stem from different practical considerations; e.g., some pathfinding systems are grid-bas
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::64f8bdbb608ad204658e35278ed80dbe
https://doi.org/10.1609/socs.v15i1.21770
https://doi.org/10.1609/socs.v15i1.21770
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 15:38-46
Multi-Train Path Finding (MTPF) is a coordination problem that asks us to plan collision-free paths for a team of moving agents, where each agent occupies a sequence of locations at any given time. MTPF is useful for planning a range of real-world ve
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::87d59a8b5f41b71dedc3f747ca09971d
https://doi.org/10.1609/socs.v15i1.21750
https://doi.org/10.1609/socs.v15i1.21750
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 15:2-10
Weight constrained path finding, known as a challenging variant of the classic shortest path problem, aims to plan cost optimum paths whose weight/resource usage is limited by a side constraint. Given the bi-criteria nature of the problem (i.e., the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::be32d0084961d17bacd45a5cd8fb9d35
https://doi.org/10.1609/socs.v15i1.21746
https://doi.org/10.1609/socs.v15i1.21746
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 36:9313-9322
Multi-Agent Path Finding (MAPF) is the problem of finding collision-free paths for multiple agents that minimize the sum of path costs. EECBS is a leading two-level algorithm that solves MAPF bounded-suboptimally, that is, within some factor w of the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a6a5dc24fddb13060524785a93f5c5ac
https://doi.org/10.1609/aaai.v36i9.21162
https://doi.org/10.1609/aaai.v36i9.21162
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 36:10256-10265
Multi-Agent Path Finding (MAPF) is the problem of planning collision-free paths for multiple agents in a shared environment. In this paper, we propose a novel algorithm MAPF-LNS2 based on large neighborhood search for solving MAPF efficiently. Starti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::312f1f893c1c9275e87ac31a7fe3ebb2
https://doi.org/10.1609/aaai.v36i9.21266
https://doi.org/10.1609/aaai.v36i9.21266
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 15:267-269
This paper presents a novel algorithm for solving the traffic assignment problem (TAP). Contrary to traditional algorithms, which use the one-to-all shortest path algorithm to solve the problem for all origin destinations (OD) pairs, this algorithm t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b64e05245045ed966969cb161e77fcb9
https://doi.org/10.1609/socs.v15i1.21781
https://doi.org/10.1609/socs.v15i1.21781
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 5:157-165
We introduce a novel preprocessing-based algorithm to solve the problem of determining the first arc of a shortest path in sparse graphs. Our algorithm achieves query running times on the 100 nanosecond scale, being significantly faster than state-of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::28f64bb80548578a0287216a1deb5d28
https://doi.org/10.1609/socs.v5i1.18311
https://doi.org/10.1609/socs.v5i1.18311
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 9:124-131
We consider the k-Nearest Neighbour problem in a two-dimensional Euclidean plane with obstacles (OkNN). Existing and state of the art algorithms for OkNN are based on incremental visibility graphs and as such suffer from a well known disadvantage: co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fd592f1bd02fd615357e1e59f067a033
https://doi.org/10.1609/socs.v9i1.18457
https://doi.org/10.1609/socs.v9i1.18457
Autor:
Nathan Sturtevant, Jason Traish, James Tulip, Tansel Uras, Sven Koenig, Ben Strasser, Adi Botea, Daniel Harabor, Steve Rabin
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 6:241-250
The Grid-Based Path Planning Competition has just completed its third iteration. The entriesused in the competition have improved significantly during this time, changing the view ofthe state of the art of grid-based pathfinding. Furthermore, the ent
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4cb5e749b9ffd392b537f275a43a62dd
https://doi.org/10.1609/socs.v6i1.18364
https://doi.org/10.1609/socs.v6i1.18364