Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Shawn Skyler"'
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
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
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 15:302-304
In the Watchman Route Problem (WRP), the task is to find a path for a watchman agent such that all locations in the given map will be visually seen by the watchman at least once during the path traversal. Recently, the problem has been optimally solv
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 12:106-114
In the Watchman Route Problem (WRP) we are given a grid map with obstacles and the task is to (offline) find a (shortest) path through the grid such that all cells in the map can be visually seen by at least one cell on the path. WRP was recently for