We consider searching problems in robotics that a robot has to find a path to a target by traveling in an unknown star shaped polygon P. The goal is to minimize the ratio of the distance traveled by the robot to the length of the shortest start-to-target path. Let s be a starting point in p. We first present a competitive strategy to find a path from s to the closest kernel point k of P. The length of the path that the robot generates is less than 1+2 square root 2 (<3.829) times the distance from s to k, which improves the best previous bound 5.331 (C. Icking and R. Klein, 1995). Second, given a specified target t in P, we present a competitive strategy to find a path from s to t whose length does not exceed 17 times the length of the shortest s-t path.


    Zugriff

    Zugriff über TIB

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    New competitive strategies for searching in unknown star-shaped polygons


    Beteiligte:
    Lee, Jae-Ha (Autor:in) / Shin, Chan-Su (Autor:in) / Kim, Jae-Hoon (Autor:in) / Sung Yung Shin (Autor:in) / Chwa, Kyung-Yong (Autor:in)


    Erscheinungsdatum :

    1997


    Format / Umfang :

    3 Seiten, 9 Quellen




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Print


    Sprache :

    Englisch




    On the Geometry of Spatial Polygons and Screw Polygons

    Mavroidis, C. | Online Contents | 1997



    Star-configuration searching for satellite attitude computation

    Baldini, D. / Barni, M. / Foggi, A. et al. | IEEE | 1995


    Active Polygons for Object Tracking

    Unal, G. / Krim, H. / Yezzi, A. | British Library Conference Proceedings | 2002