Zobrazeno 1 - 10
of 212
pro vyhledávání: '"Ariel Felner"'
Publikováno v:
Journal of Artificial Intelligence Research. 75:747-793
This paper solves the Watchman Route Problem (WRP) on a general discrete graph with Heuristic Search. Given a graph, a line-of-sight (LOS) function, and a start vertex, the task is to (offline) find a (shortest) path through the graph such that all v
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::63a299e69859563d0cfd00e96c0ea002
https://doi.org/10.1613/jair.1.13685
https://doi.org/10.1613/jair.1.13685
Autor:
Shawn Skyler, Dor Atzmon, Ariel Felner, Oren Salzman, Han Zhang, Sven Koenig, William Yeoh, Carlos Hernández Ulloa
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 15:239-243
There are many settings that extend the basic shortest path search problem. In Bounded-Cost Search, we are given a constant bound and the task is to find a solution within the bound. In Bi-Objective Search, each edge is associated with two costs (obj
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::338bd4b95c40f61950e1398c748725e2
https://doi.org/10.1609/socs.v15i1.21774
https://doi.org/10.1609/socs.v15i1.21774
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 15:229-233
Online MAPF extends the classical Multi-Agent Path Finding problem (MAPF) by considering a more realistic problem in which new agents may appear over time. As online solvers are not aware of which agents will join in the future, the notion of snapsho
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b19ce905c2866f35010f8cb5c4d2b9dc
https://doi.org/10.1609/socs.v15i1.21772
https://doi.org/10.1609/socs.v15i1.21772
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 15:56-64
The longest simple path and snake-in-a-box are combinatorial search problems of considerable research interest. We create a common framework of longest constrained path in a graph that contains these two problems, as well as other interesting maximum
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fb10e567c91eb0b43b60fa307000d9d2
https://doi.org/10.1609/socs.v15i1.21752
https://doi.org/10.1609/socs.v15i1.21752
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 15:109-117
Work in machine learning has grown tremendously in the past years, but has had little to no impact on optimal search approaches. This paper looks at challenges in using deep learning as a part of optimal search, including what is feasible using curre
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d922bdc2479c05c63d7d6a53db75bbd8
https://doi.org/10.1609/socs.v15i1.21758
https://doi.org/10.1609/socs.v15i1.21758
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 15:11-19
In Multi-Agent Pathfinding (MAPF), the task is to find non-colliding paths for a set of agents. This paper focuses on search-based MAPF algorithms from the Conflict-Based Framework, which is introduced here. A common technique in such algorithms is t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a28e39af9138187216d43e48c512ac8b
https://doi.org/10.1609/socs.v15i1.21747
https://doi.org/10.1609/socs.v15i1.21747
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 15:244-248
To transmit information or transfer an object, two agents may need to reach the same location and meet. Often, such two agents operate in two separate environments and they can only meet at border locations. For example, a ship, sailing in the sea, n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::441a8bee0d52aa89a788f3b53eba1420
https://doi.org/10.1609/socs.v15i1.21775
https://doi.org/10.1609/socs.v15i1.21775
Autor:
Han Zhang, Oren Salzman, T. K. Satish Kumar, Ariel Felner, Carlos Hernández Ulloa, Sven Koenig
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 15:199-207
The Pareto-optimal frontier for a bi-objective search problem instance consists of all solutions that are not worse than any other solution in both objectives. The size of the Pareto-optimal frontier can be exponential in the size of the input graph,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::11455aadb5a5f7d33e1cebff1a3dfc92
https://doi.org/10.1609/socs.v15i1.21768
https://doi.org/10.1609/socs.v15i1.21768
Autor:
Han Zhang, Oren Salzman, T. K. Satish Kumar, Ariel Felner, Carlos Hernández Ulloa, Sven Koenig
Publikováno v:
Proceedings of the International Conference on Automated Planning and Scheduling. 32:394-403
In multi-objective search, edges are annotated with cost vectors consisting of multiple cost components. A path dominates another path with the same start and goal vertices iff the component-wise sum of the cost vectors of the edges of the former pat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4c41c74ffeb6fe6c77653ab5f7763eaa
https://doi.org/10.1609/icaps.v32i1.19825
https://doi.org/10.1609/icaps.v32i1.19825
Publikováno v:
Journal of Artificial Intelligence Research. 73:553-618
In the multi-agent path finding problem (MAPF) we are given a set of agents each with respective start and goal positions. The task is to find paths for all agents while avoiding collisions, aiming to minimize a given objective function. Many MAPF so
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6e9d15e2cc69a78a608d1eaddda6ecb9
https://doi.org/10.1613/jair.1.13318
https://doi.org/10.1613/jair.1.13318