TY - GEN
T1 - Optimally Solving the Multiple Watchman Route Problem with Heuristic Search (Extended Abstract).
AU - Livne, Yaakov
AU - Atzmon, Dor
AU - Skyler, Shawn
AU - Boyarski, Eli
AU - Shapiro, Amir
AU - Felner, Ariel
N1 - DBLP License: DBLP's bibliographic metadata records provided through http://dblp.org/ are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.
PY - 2022/7/17
Y1 - 2022/7/17
N2 - 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 solved on a grid map using heuristic search. In this paper, we extend this work to the case of multiple agents. We call this problem the Multiple Watchman Route Problem (MWRP). In MWRP, the task is to find a path for each watchman such that each location on the map will be seen by at least one watchman. We optimally solve MWRP with heuristic search for two different objective functions with a number of A*-based variants, including an enhanced branching mechanism. We then provide an experimental study on these methods and on other attributes of this problem.
AB - 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 solved on a grid map using heuristic search. In this paper, we extend this work to the case of multiple agents. We call this problem the Multiple Watchman Route Problem (MWRP). In MWRP, the task is to find a path for each watchman such that each location on the map will be seen by at least one watchman. We optimally solve MWRP with heuristic search for two different objective functions with a number of A*-based variants, including an enhanced branching mechanism. We then provide an experimental study on these methods and on other attributes of this problem.
KW - Problem Solving Using Search
KW - Real-life Applications
KW - Combinatorial Optimization
U2 - 10.1609/socs.v15i1.21793
DO - 10.1609/socs.v15i1.21793
M3 - Conference contribution
SP - 302
EP - 304
BT - Fifteenth International Symposium on Combinatorial Search - SOCS
ER -