Browsing by Author "Beveridge, Andrew"
Now showing 1 - 6 of 6
Results Per Page
Sort Options
Item A Pursuit-Evasion Toolkit(2015-07-24) Noori, Narges; Beveridge, Andrew; Isler, VolkanThis tutorial contains tools and techniques for designing pursuit and evasion strategies. The material targets a diverse audience including STEM educators as well as robotics researchers interested in applications of pursuit-evasion games. We start with a simple "lion and man" game in a square environment which should be accessible to anyone with a high-school level background on geometry and trigonometry. We then visit various versions of this game with increasing complexity. Rather than surveying specific results for specific environments, the tutorial highlights broadly applicable techniques and strategies. It also includes exercises for STEM educators as well as open problems for robotics researchers.Item The discrete Green's function and stopping rules for random walks on graphs(University of Minnesota. Institute for Mathematics and Its Applications, 2015-01) Beveridge, AndrewItem Line-of-sight pursuit in strictly sweepable polygons(University of Minnesota. Institute for Mathematics and Its Applications, 2015-08) Berry, Lindsay; Beveridge, Andrew; Butterfield, Jane; Isler, Volkan; Keller, Zachary; Shine, Alana; Wang, JunyiItem On the minimum order of k-cop-win graph(University of Minnesota. Institute for Mathematics and Its Applications, 2012-07) Baird, William; Beveridge, Andrew; Bonato, Anthony; Codenotti, Paolo; Maurer, Aaron; McCauley, John; Valeva, SilviyaItem Symmetric Linear Rendezvous with an Unknown Initial Distance(2011-03-28) Beveridge, Andrew; Ozsoyeller, DenizImagine two robots trying to meet. They do not know each other's locations. How should they move so that they meet as quickly as possible? This classical rendezvous problem has numerous applications in search-and-rescue, network formation, multi-robot exploration and mapping. We study symmetric rendezvous on the line and introduce a new version of the problem in which the robots do not have any information about their initial distance. Further, they must execute the same strategy. We present an algorithm that is 19.166-competitive in terms of distance traveled, and discuss further refinements. As an application of our algorithm, we present results from an experiment in which two mobile robots try to meet in a corridor.Item Two-dimensional pursuit-evasion in a compact domain with piecewise analytic boundary(University of Minnesota. Institute for Mathematics and Its Applications, 2015-05) Beveridge, Andrew; Cai, Yiqing