@inproceedings{a931b7997a0841daa590f21b750246ff,
title = "Line Search for an Oblivious Moving Target",
abstract = "Consider search on an infinite line involving an autonomous robot starting at the origin of the line and an oblivious moving target at initial distance \$d \textbackslash{}geq 1\$ from it. The robot can change direction and move anywhere on the line with constant maximum speed \$1\$ while the target is also moving on the line with constant speed \$v>0\$ but is unable to change its speed or direction. The goal is for the robot to catch up to the target in as little time as possible. The classic case where \$v=0\$ and the target's initial distance \$d\$ is unknown to the robot is the well-studied ``cow-path problem''. Alpert and Gal gave an optimal algorithm for the case where a target with unknown initial distance \$d\$ is moving away from the robot with a known speed \$v",
keywords = "Infinite Line, Knowledge, Oblivious, Robot, Search, Search-Time, Speed, Target",
author = "Jared Coleman and Evangelos Kranakis and Danny Krizanc and Oscar Morales-Ponce",
note = "Publisher Copyright: {\textcopyright} Jared Coleman, Evangelos Kranakis, Danny Krizanc, and Oscar Morales-Ponce.; 26th International Conference on Principles of Distributed Systems, OPODIS 2022 ; Conference date: 13-12-2022 Through 15-12-2022",
year = "2023",
month = feb,
day = "1",
doi = "10.4230/LIPIcs.OPODIS.2022.12",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Eshcar Hillel and Roberto Palmieri and Etienne Riviere",
booktitle = "26th International Conference on Principles of Distributed Systems, OPODIS 2022",
}