TY - JOUR
T1 - Solving the watchman route problem on a grid with heuristic search
AU - Seiref, Shawn
AU - Jaffey, Tamir
AU - Lopatin, Margarita
AU - Felner, Ariel
N1 - Funding Information:
The research was supported by Rafael Advanced Defense Systems, by Israel Science Foundation (ISF) grant #844/17 to Ariel Felner and by the Cyber grant by from the Prime Minister office. We deeply thank Shahaf Shperberg for his comments and his help.
Publisher Copyright:
Copyright © 2020, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.
PY - 2020/5/29
Y1 - 2020/5/29
N2 - In this paper we optimally solve the Watchman Route Problem (WRP) on a grid. 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. We formalize WRP as a heuristic search problem and solve it with an A*-based algorithm. We develop a series of admissible heuristics with increasing difficulty and accuracy. In particular, our heuristics abstract the problem into line-of-sight clusters graph. Then, solutions for the minimum spanning tree (MST) and the traveling salesman problem (TSP) on this graph are used as admissible heuristics for WRP. We theoretically and experimentally study these heuristics and show that we can optimally and suboptimally solve problems of increasing difficulties.
AB - In this paper we optimally solve the Watchman Route Problem (WRP) on a grid. 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. We formalize WRP as a heuristic search problem and solve it with an A*-based algorithm. We develop a series of admissible heuristics with increasing difficulty and accuracy. In particular, our heuristics abstract the problem into line-of-sight clusters graph. Then, solutions for the minimum spanning tree (MST) and the traveling salesman problem (TSP) on this graph are used as admissible heuristics for WRP. We theoretically and experimentally study these heuristics and show that we can optimally and suboptimally solve problems of increasing difficulties.
UR - http://www.scopus.com/inward/record.url?scp=85088505994&partnerID=8YFLogxK
M3 - Conference article
AN - SCOPUS:85088505994
SN - 2334-0835
VL - 30
SP - 249
EP - 257
JO - Proceedings International Conference on Automated Planning and Scheduling, ICAPS
JF - Proceedings International Conference on Automated Planning and Scheduling, ICAPS
T2 - 30th International Conference on Automated Planning and Scheduling, ICAPS 2020
Y2 - 26 October 2020 through 30 October 2020
ER -