Suboptimally Solving the Watchman Route Problem on a Grid with Heuristic Search

Tamir Yaffe, Shawn Skyler, Ariel Felner

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

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 formalized and optimally solved with heuristic search. In this paper we show how the previous optimal methods can be modified (by intelligently pruning away large subtrees) to obtain suboptimal solvers that are much faster than the optimal solver without sacrificing too much the quality of the solution. In particular, we derive bounded suboptimal solvers, suboptimal solvers without bounds and anytime variants. All these algorithms are backed up with experimental evidence that show their benefits compared to existing approaches.

Original languageEnglish
Title of host publication14th International Symposium on Combinatorial Search, SoCS 2021
EditorsHang Ma, Ivan Serina
PublisherAssociation for the Advancement of Artificial Intelligence
Pages106-114
Number of pages9
ISBN (Electronic)9781713834557
StatePublished - 1 Jan 2021
Event14th International Symposium on Combinatorial Search, SoCS 2021 - Guangzhou, Virtual, China
Duration: 26 Jul 202130 Jul 2021

Publication series

Name14th International Symposium on Combinatorial Search, SoCS 2021

Conference

Conference14th International Symposium on Combinatorial Search, SoCS 2021
Country/TerritoryChina
CityGuangzhou, Virtual
Period26/07/2130/07/21

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this