Abstract
Consider the following classical search problem: a target is located on the line at distance D from the origin. Starting at the origin, a searcher must find the target with minimum competitive cost. The classical competitive cost studied in the literature is the ratio between the distance travelled by the searcher and D. Note that when no lower bound on D is given, no competitive search strategy exists for this problem. Therefore, all competitive search strategies require some form of lower bound on D.
We develop a general framework that optimally solves several variants of this search problem. Our framework allows us to match optimal competitive search costs for previously studied variants such as: (1) where the target is fixed and the searcher’s cost at each step is a constant times the distance travelled, (2) where the target is fixed and the searcher’s cost at each step is the distance travelled plus a fixed constant (often referred to as the turn cost), (3) where the target is moving and the searcher’s cost at each step is the distance travelled.
Our main contribution is that the framework allows us to derive optimal competitive search strategies for variants of this problem that do not have a solution in the literature such as: (1) where the target is fixed and the searcher’s cost at each step is \(\alpha _1 x+\beta _1\) for moving distance x away from the origin and \(\alpha _2 x + \beta _2\) for moving back with constants \(\alpha _1, \alpha _2, \beta _1, \beta _2\), (2) where the target is moving and the searcher’s cost at each step is a constant times the distance travelled plus a fixed constant turn cost. Notice that the latter variant can have several interpretations depending on what the turn cost represents. For example, if the turn cost represents the amount of time for the searcher to turn, then this has an impact on the position of the moving target. On the other hand, the turn cost can represent the amount of fuel needed to make an instantaneous turn, thereby not affecting the target’s position. Our framework addresses all of these variations.
This work was supported by FQRNT and NSERC.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
Even though \(\nu _0 - 1 = 0\), we do not simplify the expressions for \(\tau \), \(\mu \) and \(\nu \) since later in the paper, we re-use them with different values for \(\tau _0\), \(\mu _0\), \(\nu _0\) and \(\kappa _0\).
References
Alpern, S., Fokkink, R., Gasieniec, L., Lindelauf, R., Subrahmanian, V.S.: Search Theory: A Game Theoretic Perspective. Springer, New York (2013)
Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous. International Series in Operations Research and Management Science, vol. 55. Springer, New York (2003)
Baeza-Yates, R.A., Culberson, J.C., Rawlins, G.J.E.: Searching in the plane. Inf. Comp. 106(2), 234–252 (1993)
Bose, P., Morin, P.: Online routing in triangulations. SIAM J. Comput. 33(4), 937–951 (2004)
Bose, P., Morin, P., Stojmenović, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. Wireless Netw. 7(6), 609–616 (2001)
Chrobak, M., Kenyon-Mathieu, C.: Sigact news online algorithms column 10: competitiveness via doubling. SIGACT News 37(4), 115–126 (2006)
Demaine, E.D., Fekete, S.P., Gal, S.: Online searching with turn cost. Theor. Comput. Sci. 361(2–3), 342–355 (2006)
Dudek, G., Jenkin, M.: Computational principles of mobile robotics. Cambridge University Press, Cambridge (2010)
Gal, S.: A general search game. Israel J. Math. 12(1), 32–45 (1972)
Gal, S.: Search Games. Mathematics in Science and Engineering, vol. 149. Academic Press, New York (1980)
LaValle, S.M.: Planning algorithms. Cambridge University Press, Cambridge (2006)
O’Kane, J.M., LaValle, S.M.: Comparing the power of robots. Int. J. Robot. Res. 27(1), 5–23 (2008)
Pruhs, K., Sgall, J., Torng, E.: Handbook of Scheduling: Algorithms, Models, and Performance Analysis. Chapter Online Scheduling. CRC Press, Boca Raton (2004)
Zilberstein, S., Charpillet, F., Chassaing, P.: Optimal sequencing of contract algorithms. Annals Math. Artif. Intell. 39(1–2), 1–18 (2003)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Bose, P., De Carufel, JL. (2016). A General Framework for Searching on a Line. In: Kaykobad, M., Petreschi, R. (eds) WALCOM: Algorithms and Computation. WALCOM 2016. Lecture Notes in Computer Science(), vol 9627. Springer, Cham. https://doi.org/10.1007/978-3-319-30139-6_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-30139-6_12
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-30138-9
Online ISBN: 978-3-319-30139-6
eBook Packages: Computer ScienceComputer Science (R0)