C. Icking, R. Klein, E. Langetepe, S. Schuierer, and I. Semrau. An optimal competitive strategy for walking in streets. SIAM J. Comput., 33:462--486, 2004. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Exploring Simple Grid Polygons - Icking, Kamphans, Klein, Langetepe (2005) Self-citation (Icking Klein Langetepe) (Correct)
No context found.
C. Icking, R. Klein, E. Langetepe, S. Schuierer, and I. Semrau. An optimal competitive strategy for walking in streets. SIAM J. Comput., 33:462--486, 2004.
Exploring Grid Polygons Online - Icking, Kamphans, Klein, Langetepe (2005) Self-citation (Icking Klein Langetepe) (Correct)
No context found.
C. Icking, R. Klein, E. Langetepe, S. Schuierer, and I. Semrau. An optimal competitive strategy for walking in streets. SIAM J. Comput., 33:462--486, 2004.
Exploring Grid Polygons Online - Icking, Kamphans, Klein, Langetepe (2005) Self-citation (Icking Klein Langetepe) (Correct)
No context found.
C. Icking, R. Klein, and E. Langetepe. An optimal competitive strategy for walking in streets. In Proc. 16th Sympos. Theoret. Aspects Comput. Sci., volume 1563 of Lecture Notes Comput. Sci., pages 110--120. Springer-Verlag, 1999. 48
Competitive Online Approximation of the Optimal Search.. - Fleischer, Kamphans.. (2004) Self-citation (Klein Langetepe) (Correct)
No context found.
Christian Icking, Rolf Klein, and Elmar Langetepe. An optimal competitive strategy for walking in streets. In Proc. 16th STACS, LNCS 1563, pp. 110--120. Springer, 1999.
The Polygon Exploration Problem II: The Angle Hull - Hoffmann, Icking, Klein.. Self-citation (Icking Klein) (Correct)
No context found.
C. Icking, R. Klein, and E. Langetepe. An optimal competitive strategy for walking in streets. In Proc. 16th Sympos. Theoret. Aspects Comput. Sci., volume 1563 of Lecture Notes Comput. Sci., pages 110--120. Springer-Verlag, 1999.
On the Competitive Complexity of Navigation Tasks - Icking, Kamphans, Klein.. (2002) Self-citation (Icking Klein Langetepe) (Correct)
....competitive complexities of basic navigation tasks Apart from the wall problem mentioned above, there are only very few tasks whose complexities are precisely known. One of them is the street problem originally presented by Klein [26] whose complexity has finally been determined in Icking et al. [22] and independently by Semrau and Schuierer [40] This problem is briefly reviewed in Sect. 2 of this paper. In general it is quite di#cult to precisely determine the competitive complexity of a task. Then we can at least try to put in an interval [l, u] by proving that each possible strategy can ....
....Schuierer [31] 2.05, Lopez Ortiz and Schuierer [33] 1.73, Semrau [41] 1.57, Icking et al. 24] 1. 51, Dasgupta et al. 10] Kranakis and Spatharis [29] Lopez Ortiz and Schuierer [34] The gap between the upper and lower bound, also mentioned in Mitchell [37] was finally closed by Icking et al. [22] and independently by Semrau and Schuierer [40] A java implementation of this strategy is available at http: www.informatik.uni bonn.de I GeomLab Gridrobot . t r # s v l v r lr t l # 0 Fig. 1. A funnel. 2.2 Funnels The competitive complexity of the street problem can be shown to ....
[Article contains additional citation context not shown here]
C. Icking, R. Klein, and E. Langetepe. An optimal competitive strategy for walking in streets. In Proc. 16th Sympos. Theoret. Aspects Comput. Sci., volume 1563 of Lecture Notes Comput. Sci., pages 110--120. Springer-Verlag, 1999.
The Polygon Exploration Problem - Hoffmann, Icking, Klein, Kriegel (2002) (2 citations) Self-citation (Icking) (Correct)
....path length of at most W opt . 3. The angle hull. In on line navigation algorithms for autonomous robots, analyzing the length of the robot s path is often a complicated issue. Sometimes, only the discovery of certain structural properties has lead to a reasonably sharp analysis; see [1, 18, 19, 20] and Rote [24] Here we provide a new result of this type. It is crucial in analyzing our on line strategy of Section 2, and it seems also to be interesting in its own right. For convenience, we repeat the definition of the angle hull. Let D be a simply connected region contained in a simple ....
C. Icking, R. Klein, and E. Langetepe, An optimal competitive strategy for walking in streets, in Proc. 16th Sympos. Theoret. Aspects Comput. Sci., vol. 1563 of Lecture Notes Comput. Sci., Springer-Verlag, 1999, pp. 110--120.
Competitive Searching in a Generalized Street - Datta, Icking (1999) (23 citations) Self-citation (Icking) (Correct)
....streets. Quite a couple of improvements have been made to the competitive factor for searching in streets, e.g. by Lopez Ortiz and Schuierer [24,25,27] and by Icking et al. 17] to name just a few. This question is now finally settled by an optimal # 2 competitive strategy by Icking et al. [16] and, independently, by Schuierer et al. 33] Other interesting geometric applications for competitive strategies are e.g. the search for the kernel of a polygon [15,24,28,22] exploration or path planning in unknown environments [7,11,12,1,6] or localization in known environments ....
C. Icking, R. Klein, and E. Langetepe. An optimal competitive strategy for walking in streets. In Proc. 16th Sympos. Theoret. Aspects Comput. Sci.,volume 1563 of Lecture Notes Comput. Sci., pages 110--120. Springer-Verlag, 1999.
Online Routing in Geometric Graphs - Morin (2001) (2 citations) (Correct)
No context found.
C. Icking, R. Klein, and E. Langetepe. An optimal competitive strategy for walking in streets. In Proceedings of the 16th Symposium on Theoretical Aspects of Computer Science (STACS'99), pages 110-120, 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