DIDmitry Ivanov
Dmitry Ivanov
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Dmitry Ivanov has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Danny Krizanc
Wesleyan University
3 shared publications - Evangelos Kranakis
Carleton University, Ottawa, Ontario, Canada
3 shared publications - Jared Coleman
Loyola Marymount University
3 shared publications - Oscar Morales-Ponce
California State University Long Beach USA
3 shared publications
Latest Publications
- 22 June 2024
- Published by Springer Nature
- p. 396-407
Linear Search for an Escaping Target with Unknown Speed
- 22 June 2024
- Published by Springer Nature
- p. 396-407
Linear Search for an Escaping Target with Unknown Speed
- Open Access
Linear Search for an Escaping Target with Unknown Speed
We consider linear search for an escaping target whose speed and initial position are unknown to the searcher. A searcher (an autonomous mobile agent) is initially placed at the origin of the real line and can move with maximum speed $1$ in either direction along the line. An oblivious mobile target that is moving away from the origin with an unknown constant speed $v<1$ is initially placed by an adversary on the infinite line at distance $d$ from the origin in an unknown direction. We consider two cases, depending on whether $d$ is known or unknown. The main contribution of this paper is to prove a new lower bound and give algorithms leading to new upper bounds for search in these settings. This results in an optimal (up to lower order terms in the exponent) competitive ratio in the case where $d$ is known and improved upper and lower bounds for the case where $d$ is unknown. Our results solve an open problem proposed in [Coleman et al., Proc. OPODIS 2022].Open AccessLinear Search for an Escaping Target with Unknown Speed
We consider linear search for an escaping target whose speed and initial position are unknown to the searcher. A searcher (an autonomous mobile agent) is initially placed at the origin of the real line and can move with maximum speed $1$ in either direction along the line. An oblivious mobile target that is moving away from the origin with an unknown constant speed $v<1$ is initially placed by an adversary on the infinite line at distance $d$ from the origin in an unknown direction. We consider two cases, depending on whether $d$ is known or unknown. The main contribution of this paper is to prove a new lower bound and give algorithms leading to new upper bounds for search in these settings. This results in an optimal (up to lower order terms in the exponent) competitive ratio in the case where $d$ is known and improved upper and lower bounds for the case where $d$ is unknown. Our results solve an open problem proposed in [Coleman et al., Proc. OPODIS 2022].