Solving the watchman route problem on a grid with heuristic search

Shawn Seiref; Tamir Jaffey; Margarita Lopatin; Ariel Felner

Solving the watchman route problem on a grid with heuristic search

Shawn Seiref, Tamir Jaffey, Margarita Lopatin, Ariel Felner

Department of Software and Information Systems Engineering

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

Original language	English
Title of host publication	Proceedings of the 13th International Symposium on Combinatorial Search, SoCS 2020
Editors	Daniel Harabor, Mauro Vallati
Publisher	The AAAI Press
Pages	139-140
Number of pages	2
ISBN (Electronic)	9781577358220
State	Published - 1 Jan 2020
Event	13th International Symposium on Combinatorial Search, SoCS 2020 - Virtual, Online Duration: 26 May 2020 → 28 May 2020

Publication series

Name	Proceedings of the 13th International Symposium on Combinatorial Search, SoCS 2020

Conference

Conference	13th International Symposium on Combinatorial Search, SoCS 2020
City	Virtual, Online
Period	26/05/20 → 28/05/20

ASJC Scopus subject areas

Computer Networks and Communications

Cite this

Seiref, Shawn ; Jaffey, Tamir ; Lopatin, Margarita et al. / Solving the watchman route problem on a grid with heuristic search. Proceedings of the 13th International Symposium on Combinatorial Search, SoCS 2020. editor / Daniel Harabor ; Mauro Vallati. The AAAI Press, 2020. pp. 139-140 (Proceedings of the 13th International Symposium on Combinatorial Search, SoCS 2020).

@inproceedings{9dc4710cdb5045a7a7dc9e7b345cf962,

title = "Solving the watchman route problem on a grid with heuristic search",

author = "Shawn Seiref and Tamir Jaffey and Margarita Lopatin and Ariel Felner",

year = "2020",

month = jan,

day = "1",

language = "English",

series = "Proceedings of the 13th International Symposium on Combinatorial Search, SoCS 2020",

publisher = "The AAAI Press",

pages = "139--140",

editor = "Daniel Harabor and Mauro Vallati",

booktitle = "Proceedings of the 13th International Symposium on Combinatorial Search, SoCS 2020",

note = "13th International Symposium on Combinatorial Search, SoCS 2020 ; Conference date: 26-05-2020 Through 28-05-2020",

}

Seiref, S, Jaffey, T, Lopatin, M & Felner, A 2020, Solving the watchman route problem on a grid with heuristic search. in D Harabor & M Vallati (eds), Proceedings of the 13th International Symposium on Combinatorial Search, SoCS 2020. Proceedings of the 13th International Symposium on Combinatorial Search, SoCS 2020, The AAAI Press, pp. 139-140, 13th International Symposium on Combinatorial Search, SoCS 2020, Virtual, Online, 26/05/20.

Solving the watchman route problem on a grid with heuristic search. / Seiref, Shawn; Jaffey, Tamir; Lopatin, Margarita et al.
Proceedings of the 13th International Symposium on Combinatorial Search, SoCS 2020. ed. / Daniel Harabor; Mauro Vallati. The AAAI Press, 2020. p. 139-140 (Proceedings of the 13th International Symposium on Combinatorial Search, SoCS 2020).

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

TY - GEN

T1 - Solving the watchman route problem on a grid with heuristic search

AU - Seiref, Shawn

AU - Jaffey, Tamir

AU - Lopatin, Margarita

AU - Felner, Ariel

PY - 2020/1/1

Y1 - 2020/1/1

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

M3 - Conference contribution

AN - SCOPUS:85102187763

T3 - Proceedings of the 13th International Symposium on Combinatorial Search, SoCS 2020

SP - 139

EP - 140

BT - Proceedings of the 13th International Symposium on Combinatorial Search, SoCS 2020

A2 - Harabor, Daniel

A2 - Vallati, Mauro

PB - The AAAI Press

T2 - 13th International Symposium on Combinatorial Search, SoCS 2020

Y2 - 26 May 2020 through 28 May 2020

ER -

Solving the watchman route problem on a grid with heuristic search

Publication series

Conference

ASJC Scopus subject areas

Other files and links

Cite this