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

Tamir Yaffe; Shawn Skyler; Ariel Felner

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

Tamir Yaffe, Shawn Skyler, Ariel Felner

Ben-Gurion University of the Negev

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 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 language	English
Title of host publication	14th International Symposium on Combinatorial Search, SoCS 2021
Editors	Hang Ma, Ivan Serina
Publisher	Association for the Advancement of Artificial Intelligence
Pages	106-114
Number of pages	9
ISBN (Electronic)	9781713834557
State	Published - 2021
Externally published	Yes
Event	14th International Symposium on Combinatorial Search, SoCS 2021 - Guangzhou, Virtual, China Duration: 26 Jul 2021 → 30 Jul 2021

Publication series

Name	14th International Symposium on Combinatorial Search, SoCS 2021

Conference

Conference	14th International Symposium on Combinatorial Search, SoCS 2021
Country/Territory	China
City	Guangzhou, Virtual
Period	26/07/21 → 30/07/21

Bibliographical note

Publisher Copyright:
Copyright © 2021, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.

Funding

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.

Funders	Funder number
Rafael Advanced Defense Systems
Israel Science Foundation	844/17

Cite this

Yaffe, Tamir ; Skyler, Shawn ; Felner, Ariel. / Suboptimally Solving the Watchman Route Problem on a Grid with Heuristic Search. 14th International Symposium on Combinatorial Search, SoCS 2021. editor / Hang Ma ; Ivan Serina. Association for the Advancement of Artificial Intelligence, 2021. pp. 106-114 (14th International Symposium on Combinatorial Search, SoCS 2021).

@inproceedings{ddd2201647db4fde863ba1007bac6ec2,

title = "Suboptimally Solving the Watchman Route Problem on a Grid with Heuristic Search",

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.",

author = "Tamir Yaffe and Shawn Skyler and Ariel Felner",

note = "Publisher Copyright: Copyright {\textcopyright} 2021, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.; 14th International Symposium on Combinatorial Search, SoCS 2021 ; Conference date: 26-07-2021 Through 30-07-2021",

year = "2021",

language = "אנגלית",

series = "14th International Symposium on Combinatorial Search, SoCS 2021",

publisher = "Association for the Advancement of Artificial Intelligence",

pages = "106--114",

editor = "Hang Ma and Ivan Serina",

booktitle = "14th International Symposium on Combinatorial Search, SoCS 2021",

}

Yaffe, T, Skyler, S & Felner, A 2021, Suboptimally Solving the Watchman Route Problem on a Grid with Heuristic Search. in H Ma & I Serina (eds), 14th International Symposium on Combinatorial Search, SoCS 2021. 14th International Symposium on Combinatorial Search, SoCS 2021, Association for the Advancement of Artificial Intelligence, pp. 106-114, 14th International Symposium on Combinatorial Search, SoCS 2021, Guangzhou, Virtual, China, 26/07/21.

Suboptimally Solving the Watchman Route Problem on a Grid with Heuristic Search. / Yaffe, Tamir; Skyler, Shawn; Felner, Ariel.
14th International Symposium on Combinatorial Search, SoCS 2021. ed. / Hang Ma; Ivan Serina. Association for the Advancement of Artificial Intelligence, 2021. p. 106-114 (14th International Symposium on Combinatorial Search, SoCS 2021).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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

AU - Yaffe, Tamir

AU - Skyler, Shawn

AU - Felner, Ariel

PY - 2021

Y1 - 2021

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85124595962&partnerID=8YFLogxK

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85124595962

T3 - 14th International Symposium on Combinatorial Search, SoCS 2021

SP - 106

EP - 114

BT - 14th International Symposium on Combinatorial Search, SoCS 2021

A2 - Ma, Hang

A2 - Serina, Ivan

PB - Association for the Advancement of Artificial Intelligence

T2 - 14th International Symposium on Combinatorial Search, SoCS 2021

Y2 - 26 July 2021 through 30 July 2021

ER -

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

Abstract

Publication series

Conference

Bibliographical note

Funding

Other files and links

Fingerprint

Cite this