A visibility-based approach to computing non-deterministic bouncing strategies

Inspired by motion patterns of some commercially available mobile robots, we investigate the power of robots that move forward in straight lines until colliding with an environment boundary, at which point they can rotate in place and move forward again; we visualize this as the robot “bouncing” off boundaries. We define bounce rules governing how the robot should reorient after reaching a boundary, such as reorienting relative to its heading prior to collision, or relative to the normal of the boundary. We then generate plans as sequences of rules, using the bounce visibility graph generated from a polygonal environment definition, while assuming we have unavoidable non-determinism in our actuation. Our planner can be queried to determine the feasibility of tasks such as reaching goal sets and patrolling (repeatedly visiting a sequence of goals). If the task is found feasible, the planner provides a sequence of non-deterministic interaction rules, which also provide information on how precisely the robot must execute the plan to succeed. We also show how to compute stable cyclic trajectories and use these to limit uncertainty in the robot’s position.

Nilles Alexandra Q., Ren Yingying, Becerra Israel, LaValle Steven M.

A1 Journal article – refereed

Nilles, A. Q., Ren, Y., Becerra, I., & LaValle, S. M. (2021). A visibility-based approach to computing non-deterministic bouncing strategies. In The International Journal of Robotics Research (Vol. 40, Issues 10–11, pp. 1196–1211). SAGE Publications. https://doi.org/10.1177/0278364921992788

https://doi.org/10.1177/0278364921992788 http://urn.fi/urn:nbn:fi-fe2021102752475