Linear Search by a Pair of Distinct-Speed Robots
Two mobile robots are initially placed at the same point on an infinite line. Each robot may move on the line in either direction not exceeding its maximal speed. The robots need to find a stationary target placed at an unknown location on the line. The search is completed when both robots arrive at...
Main Authors: | Bampas, Evangelos, Czyzowicz, Jurek, Gąsieniec, Leszek, Ilcinkas, David, Klasing, Ralf, Kociumaka, Tomasz, Pajak, Dominik S |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | English |
Published: |
Springer US
2018
|
Online Access: | http://hdl.handle.net/1721.1/116160 |
Similar Items
-
Pure pairs. I. Trees and linear anticomplete pairs
by: Chudnovsky, M, et al.
Published: (2020) -
On linear complementary pairs of codes
by: Solé, Patrick, et al.
Published: (2019) -
Speed and direction of locally-paired dot patterns.
by: Curran, W, et al.
Published: (2000) -
Brief announcement: On simple back-off in unreliable radio networks
by: Gilbert, Seth, et al.
Published: (2021) -
Distinct mechanisms mediate speed-accuracy adjustments in cortico-subthalamic networks.
by: Herz, D, et al.
Published: (2017)