Optimally Solving the Multiple Watchman Route Problem with Heuristic Search (Extended Abstract).

Yaakov Livne; Dor Atzmon; Shawn Skyler; Eli Boyarski; Amir Shapiro; Ariel Felner

doi:https://doi.org/10.1609/socs.v15i1.21793

Optimally Solving the Multiple Watchman Route Problem with Heuristic Search (Extended Abstract).

Yaakov Livne, Dor Atzmon, Shawn Skyler, Eli Boyarski, Amir Shapiro, Ariel Felner

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

Abstract

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.

Original language	English
Title of host publication	Fifteenth International Symposium on Combinatorial Search - SOCS
Pages	302-304
Number of pages	3
DOIs	https://doi.org/10.1609/socs.v15i1.21793
State	Published - 17 Jul 2022

Keywords

Problem Solving Using Search
Real-life Applications
Combinatorial Optimization

Access to Document

https://doi.org/10.1609/socs.v15i1.21793

Cite this

@inproceedings{d1d54c48c2d44351944dccce3e6edc55,

title = "Optimally Solving the Multiple Watchman Route Problem with Heuristic Search (Extended Abstract).",

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

keywords = "Problem Solving Using Search, Real-life Applications, Combinatorial Optimization",

author = "Yaakov Livne and Dor Atzmon and Shawn Skyler and Eli Boyarski and Amir Shapiro and Ariel Felner",

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

year = "2022",

month = jul,

day = "17",

doi = "https://doi.org/10.1609/socs.v15i1.21793",

language = "English",

pages = "302--304",

booktitle = "Fifteenth International Symposium on Combinatorial Search - SOCS",

}

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 - https://doi.org/10.1609/socs.v15i1.21793

DO - https://doi.org/10.1609/socs.v15i1.21793

M3 - Conference contribution

SP - 302

EP - 304

BT - Fifteenth International Symposium on Combinatorial Search - SOCS

ER -