C. Hipke, C. Icking, R. Klein, and E. Langetepe. How to find a point on a line within a fixed distance. Technical Report 220, Department of Computer Science, FernUniversit at Hagen, Germany, 1997. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Searching a goal on m rays within a fixed distance.. - Icking, Klein, Langetepe (Correct)
....partially supported by the Deutsche Forschungsgemeinschaft, grant Kl 655 8 3. 1 The same problem has simultaneously and independently been studied and solved by Schuierer [5] but with a di#erent approach considering recurrences. 2 Maximal reach on m rays In anology to the case m = 2 examined in [4] we consider the reverse problem. For a C competitive strategy S let max(S, i) be the maximal distance from the origin to a point visited on ray i.Thenr(C) min max(S, i) i =1, m is called the reach of S.For every C C opt we compute the finite C competitive strategy S(C) that achieves ....
C. Hipke, C. Icking, R. Klein, and E. Langetepe. How to find a point on a line within a fixed distance. Technical Report 220, Department of Computer Science, FernUniversitat Hagen, Germany, 1997. To appear in Discrete and Applied Mathematics.
Searching on m Bounded Rays Optimally - Schuierer (Correct)
.... in a number of classes of simple polygons, such as star shaped polygons [LOS97] generalized streets [DI94, LOS96] HV streets [DHS95] and streets [DHS95, Hip94] Hipke et al. consider the maximal reach of a strategy to search on the line if the competitive ratio of the strategy is given [HIKL97]. The reach of a strategy X with competitive ratio C is the maximum distance D such that a target placed at a distance D to the origin is still detected by a robot using X. Since C is given, a recurrence equation for the optimal reach can be derived. Using this recurrence equation Hipke et al. ....
....strictly monotone in C. This in turn implies that C D 2 is strictly monotone in D and assumes all values in the interval [3; 9] In this paper we present an algorithm to compute the maximal reach for a given competitive ratio C and arbitrary m thus, generalizing the results by Hipke et al. [HIKL97]. The paper is organized as follows. In the next section we give the basic definitions concerning searching on m rays. In Section 2 we show that an optimal strategy to search on m bounded rays visits the rays in a fixed cyclic order. We also derive a recurrence equation that is satisfied by an ....
[Article contains additional citation context not shown here]
Ch. Hipke, Ch. Icking, R. Klein, and E. Langetepe. How to find a point on a line within a fixed distance. Informatik-Bericht 220, Fernuni Hagen, November 1997.
On Optimizing Multi-Sequence Functionals for Competitive.. - Tom Kamphans Elmar Self-citation (Langetepe) (Correct)
No context found.
C. Hipke, C. Icking, R. Klein, and E. Langetepe. How to find a point on a line within a fixed distance. Technical Report 220, Department of Computer Science, FernUniversit at Hagen, Germany, 1997.
Competitive Online Searching for a Ray in the Plane - Andrea Eubeler Rudolf Self-citation (Klein Langetepe) (Correct)
No context found.
C. Hipke, C. Icking, R. Klein, and E. Langetepe. How to find a point on a line within a fixed distance. Discrete Appl. Math., 93:67--73, 1999.
Optimal Competitive Online Ray Search with an Error-Prone Robot - Tom Kamphans And (2005) Self-citation (Langetepe) (Correct)
No context found.
C. Hipke, C. Icking, R. Klein, and E. Langetepe. How to find a point on a line within a fixed distance. Discrete Appl. Math., 93:67--73, 1999.
On the Competitive Complexity of Navigation Tasks - Icking, Kamphans, Klein.. (2002) Self-citation (Icking Klein Langetepe) (Correct)
....of the navigation task alone. At first glance the above example may appear a bit contrived. After all, a single, extremely long wall is an environment rarely encountered. But the above approach can be generalized to situations where an upper bound to the distance of the door is known in advance [19], or where m, rather than 2, alternatives must be searched [23] like corridors leading o# a central room. This indicates that results first obtained for very basic situations may later be generalized to fit more realistic settings. We think that knowing about the competitive complexities of ....
C. Hipke, C. Icking, R. Klein, and E. Langetepe. How to find a point on a line within a fixed distance. Discrete Appl. Math., 93:67--73, 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC