Abstract In this paper, we describe a bouncing strategy (smart strategy) for a mobile robot that uses one bit of memory for feedback, and guarantees that the robot will traverse all the rooms (and doorways) of a 2D environment. The environment is modeled as a rectilinear polygon (also called orthogonal polygon), and the rooms and the doorways are defined by the decomposition algorithm we describe. Such a decomposition helps the robot to not go back to a room after leaving. We also define the notion of “virtual doors” that have the ability to let the robot through, or make the robot bounce from them. We compared three different types of bouncing rules: smart, random, billiard. The smart strategy grantees to reach to target. Although the random strategy on average behaves the same as the smart strategy, there are rectilinear polygons in which the robot cannot reach the target in the expected time steps. On the other hand, the billiard bouncing strategy can cause the robot to become trapped.


    Access

    Download


    Export, share and cite



    Title :

    Bouncing robots in rectilinear polygons



    Publication date :

    2022-01-01


    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English


    Classification :

    DDC:    629



    Bouncing robot

    TAO CHUNSHENG / LIU MEILIAN / WU XUE et al. | European Patent Office | 2024

    Free access

    Bouncing robot

    ZHOU ZUPENG / WU ZHE | European Patent Office | 2023

    Free access

    Bouncing device

    ZHONG BOWEN / ZHANG QIAN | European Patent Office | 2020

    Free access

    Bouncing back

    British Library Online Contents | 2007


    Bouncing back

    Online Contents | 2002