Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Tamir Yaffe"'
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
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