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.


    Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    New competitive strategies for searching in unknown star-shaped polygons


    Contributors:


    Publication date :

    1997


    Size :

    3 Seiten, 9 Quellen




    Type of media :

    Conference paper


    Type of material :

    Print


    Language :

    English




    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