Online exploration outside a convex obstacle

Shai Gul; Eitan Tiktinsky; Slava Shamshanov; Reuven Cohen

doi:10.1016/j.tcs.2022.06.037

Online exploration outside a convex obstacle

Shai Gul, Eitan Tiktinsky, Slava Shamshanov, Reuven Cohen

Department of Mathematics

Bar-Ilan University

Research output: Contribution to journal › Article › peer-review

Abstract

A watchman path is a path such that a direct line of sight exists between each point in some region and some point along the path. Here, we study the online watchman path problem outside a convex polygon, i.e., in R²∖Ω, where Ω is a convex polygon that is not known in advance. We present an algorithm for the exploration of the region outside the polygon. We prove that the presented algorithm guarantees a ≈50.2072 competitive ratio compared to the optimal offline watchman path.

Original language	English
Pages (from-to)	157-163
Number of pages	7
Journal	Theoretical Computer Science
Volume	929
DOIs	https://doi.org/10.1016/j.tcs.2022.06.037
State	Published - 11 Sep 2022

Keywords

Convexity
Online algorithms
Spiral search

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

10.1016/j.tcs.2022.06.037

Cite this

@article{dc10d4de28f448d4a3d9a49f41401385,

title = "Online exploration outside a convex obstacle",

abstract = "A watchman path is a path such that a direct line of sight exists between each point in some region and some point along the path. Here, we study the online watchman path problem outside a convex polygon, i.e., in R2∖Ω, where Ω is a convex polygon that is not known in advance. We present an algorithm for the exploration of the region outside the polygon. We prove that the presented algorithm guarantees a ≈50.2072 competitive ratio compared to the optimal offline watchman path.",

keywords = "Convexity, Online algorithms, Spiral search",

author = "Shai Gul and Eitan Tiktinsky and Slava Shamshanov and Reuven Cohen",

note = "Publisher Copyright: {\textcopyright} 2022 Elsevier B.V.",

year = "2022",

month = sep,

day = "11",

doi = "10.1016/j.tcs.2022.06.037",

language = "الإنجليزيّة",

volume = "929",

pages = "157--163",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - Online exploration outside a convex obstacle

AU - Gul, Shai

AU - Tiktinsky, Eitan

AU - Shamshanov, Slava

AU - Cohen, Reuven

PY - 2022/9/11

Y1 - 2022/9/11

N2 - A watchman path is a path such that a direct line of sight exists between each point in some region and some point along the path. Here, we study the online watchman path problem outside a convex polygon, i.e., in R2∖Ω, where Ω is a convex polygon that is not known in advance. We present an algorithm for the exploration of the region outside the polygon. We prove that the presented algorithm guarantees a ≈50.2072 competitive ratio compared to the optimal offline watchman path.

AB - A watchman path is a path such that a direct line of sight exists between each point in some region and some point along the path. Here, we study the online watchman path problem outside a convex polygon, i.e., in R2∖Ω, where Ω is a convex polygon that is not known in advance. We present an algorithm for the exploration of the region outside the polygon. We prove that the presented algorithm guarantees a ≈50.2072 competitive ratio compared to the optimal offline watchman path.

KW - Convexity

KW - Online algorithms

KW - Spiral search

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

U2 - 10.1016/j.tcs.2022.06.037

DO - 10.1016/j.tcs.2022.06.037

M3 - مقالة

SN - 0304-3975

VL - 929

SP - 157

EP - 163

JO - Theoretical Computer Science

JF - Theoretical Computer Science

ER -

Online exploration outside a convex obstacle

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this