(BIBTEX) becerra2015maintaining

Maintaining strong mutual visibility of an evader moving over the reduced visibility graph. Israel Becerra, Rafael Murrieta-Cid, Raul Monroy, Seth Hutchinson and Jean-Paul Laumond. Autonomous Robots, 40(2):395-423, 2015. (PDF)

Abstract

In this paper, we address the problem of determining whether a mobile robot, called the pursuer, is able to maintain strong mutual visibility (a visibility notion between regions over a convex partition of the environment) of an antagonist agent, called the evader. We frame the problem as a non cooperative game. We consider the case in which the pursuer and the evader move at bounded speed, traveling in a known polygonal environment with or without holes, and in which there are no restrictions as to the distance that might separate the agents. Unlike our previous efforts (Murrieta-Cid et al. in Int J Robot Res 26:233--253, 2007), we give special attention to the combinatorial problem that arises when searching for a solution through visiting several locations in an environment with obstacles. In this paper we take a step further, namely, we assume an antagonistic evader who moves continuously and unpredictably, but with a constraint over its set of admissible motion policies, as the evader moves in the shortest-path roadmap, also called the reduced visibility graph (RVG). The pursuer does not know which among the possible paths over the RVG the evader will choose, but the pursuer is free to move within all the environment. We provide a constructive method to solve the decision problem of determining whether or not the pursuer is able to maintain strong mutual visibility of the evader. This method is based on an algorithm that computes the safe areas (areas that keep evader surveillance) at all times. We prove decidability of this problem, and provide a complexity measure to this evader surveillance game; both contributions hold for any general polygonal environment that might or not contain holes. All our algorithms have been implemented and we show simulation results.

Pdf

Bibtex entry

@ARTICLE { becerra2015maintaining,
    TITLE = { Maintaining strong mutual visibility of an evader moving over the reduced visibility graph },
    AUTHOR = { Becerra, Israel and Murrieta-Cid, Rafael and Monroy, Raul and Hutchinson, Seth and Laumond, Jean-Paul },
    JOURNAL = { Autonomous Robots },
    YEAR = { 2015 },
    PUBLISHER = { Springer },
    VOLUME = { 40 },
    NUMBER = { 2 },
    PAGES = { 395--423 },
    ABSTRACT = { In this paper, we address the problem of determining whether a mobile robot, called the pursuer, is able to maintain strong mutual visibility (a visibility notion between regions over a convex partition of the environment) of an antagonist agent, called the evader. We frame the problem as a non cooperative game. We consider the case in which the pursuer and the evader move at bounded speed, traveling in a known polygonal environment with or without holes, and in which there are no restrictions as to the distance that might separate the agents. Unlike our previous efforts (Murrieta-Cid et al. in Int J Robot Res 26:233--253, 2007), we give special attention to the combinatorial problem that arises when searching for a solution through visiting several locations in an environment with obstacles. In this paper we take a step further, namely, we assume an antagonistic evader who moves continuously and unpredictably, but with a constraint over its set of admissible motion policies, as the evader moves in the shortest-path roadmap, also called the reduced visibility graph (RVG). The pursuer does not know which among the possible paths over the RVG the evader will choose, but the pursuer is free to move within all the environment. We provide a constructive method to solve the decision problem of determining whether or not the pursuer is able to maintain strong mutual visibility of the evader. This method is based on an algorithm that computes the safe areas (areas that keep evader surveillance) at all times. We prove decidability of this problem, and provide a complexity measure to this evader surveillance game; both contributions hold for any general polygonal environment that might or not contain holes. All our algorithms have been implemented and we show simulation results. },
    ISSN = { 1573-7527 },
    DOI = { 10.1007/s10514-015-9477-5 },
    URL = { http://dx.doi.org/10.1007/s10514-015-9477-5 },
    PDF = { http://personal.cimat.mx:8181/~murrieta/Papersonline/BeMuMoHuLa_AR16.pdf },
}