Online navigation in a room

Eldad Bar-Eli, Piotr Berman, Amos Fiat, Peiyuan Yan

    Research output: Contribution to journalArticle

    38 Citations (Scopus)

    Abstract

    We consider the problem of navigating through an unknown environment in which the obstacles are disjoint oriented rectangles enclosed in an n × n square room. The task of a navigating algorithm is to reach the center of the room starting from one of the corners. While there always exists a path of length n, the best previously known navigating algorithm finds paths of length n2O(√logn). We give an efficient deterministic algorithm which finds a path of length O(n log n); this algorithm uses tactile information only. Moreover, we prove that any deterministic algorithm can be forced to traverse a distance of Ω(n log n), even if it uses visual information.

    Original languageEnglish (US)
    Pages (from-to)319-341
    Number of pages23
    JournalJournal of Algorithms
    Volume17
    Issue number3
    DOIs
    StatePublished - Jan 1 1994

    Fingerprint

    Navigation
    Deterministic Algorithm
    Path
    Rectangle
    Disjoint
    Efficient Algorithms
    Unknown
    Vision

    All Science Journal Classification (ASJC) codes

    • Control and Optimization
    • Computational Mathematics
    • Computational Theory and Mathematics

    Cite this

    Bar-Eli, E., Berman, P., Fiat, A., & Yan, P. (1994). Online navigation in a room. Journal of Algorithms, 17(3), 319-341. https://doi.org/10.1006/jagm.1994.1039
    Bar-Eli, Eldad ; Berman, Piotr ; Fiat, Amos ; Yan, Peiyuan. / Online navigation in a room. In: Journal of Algorithms. 1994 ; Vol. 17, No. 3. pp. 319-341.
    @article{e4b5e257cb2c443296ae597a92fd5b38,
    title = "Online navigation in a room",
    abstract = "We consider the problem of navigating through an unknown environment in which the obstacles are disjoint oriented rectangles enclosed in an n × n square room. The task of a navigating algorithm is to reach the center of the room starting from one of the corners. While there always exists a path of length n, the best previously known navigating algorithm finds paths of length n2O(√logn). We give an efficient deterministic algorithm which finds a path of length O(n log n); this algorithm uses tactile information only. Moreover, we prove that any deterministic algorithm can be forced to traverse a distance of Ω(n log n), even if it uses visual information.",
    author = "Eldad Bar-Eli and Piotr Berman and Amos Fiat and Peiyuan Yan",
    year = "1994",
    month = "1",
    day = "1",
    doi = "10.1006/jagm.1994.1039",
    language = "English (US)",
    volume = "17",
    pages = "319--341",
    journal = "Journal of Algorithms",
    issn = "0196-6774",
    publisher = "Academic Press Inc.",
    number = "3",

    }

    Bar-Eli, E, Berman, P, Fiat, A & Yan, P 1994, 'Online navigation in a room', Journal of Algorithms, vol. 17, no. 3, pp. 319-341. https://doi.org/10.1006/jagm.1994.1039

    Online navigation in a room. / Bar-Eli, Eldad; Berman, Piotr; Fiat, Amos; Yan, Peiyuan.

    In: Journal of Algorithms, Vol. 17, No. 3, 01.01.1994, p. 319-341.

    Research output: Contribution to journalArticle

    TY - JOUR

    T1 - Online navigation in a room

    AU - Bar-Eli, Eldad

    AU - Berman, Piotr

    AU - Fiat, Amos

    AU - Yan, Peiyuan

    PY - 1994/1/1

    Y1 - 1994/1/1

    N2 - We consider the problem of navigating through an unknown environment in which the obstacles are disjoint oriented rectangles enclosed in an n × n square room. The task of a navigating algorithm is to reach the center of the room starting from one of the corners. While there always exists a path of length n, the best previously known navigating algorithm finds paths of length n2O(√logn). We give an efficient deterministic algorithm which finds a path of length O(n log n); this algorithm uses tactile information only. Moreover, we prove that any deterministic algorithm can be forced to traverse a distance of Ω(n log n), even if it uses visual information.

    AB - We consider the problem of navigating through an unknown environment in which the obstacles are disjoint oriented rectangles enclosed in an n × n square room. The task of a navigating algorithm is to reach the center of the room starting from one of the corners. While there always exists a path of length n, the best previously known navigating algorithm finds paths of length n2O(√logn). We give an efficient deterministic algorithm which finds a path of length O(n log n); this algorithm uses tactile information only. Moreover, we prove that any deterministic algorithm can be forced to traverse a distance of Ω(n log n), even if it uses visual information.

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

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

    U2 - 10.1006/jagm.1994.1039

    DO - 10.1006/jagm.1994.1039

    M3 - Article

    VL - 17

    SP - 319

    EP - 341

    JO - Journal of Algorithms

    JF - Journal of Algorithms

    SN - 0196-6774

    IS - 3

    ER -

    Bar-Eli E, Berman P, Fiat A, Yan P. Online navigation in a room. Journal of Algorithms. 1994 Jan 1;17(3):319-341. https://doi.org/10.1006/jagm.1994.1039