On rendezvous for visually-guided agents in a nonconvex polygon
暂无分享,去创建一个
F. Bullo | A. Ganguli | J. Cortes | F. Bullo | J. Cortés | Anurag Ganguli
[1] A. F. Filippov. Equations with the Right-Hand Side Continuous in x and Discontinuous in t , 1988 .
[2] Godfried T. Toussaint,et al. Relative neighborhood graphs and their relatives , 1992, Proc. IEEE.
[3] Kostas Daniilidis,et al. Mirrors in motion: epipolar geometry and motion estimation , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.
[4] Masafumi Yamashita,et al. Distributed memoryless point convergence algorithm for mobile robots with limited visibility , 1999, IEEE Trans. Robotics Autom..
[5] Aleksej F. Filippov,et al. Differential Equations with Discontinuous Righthand Sides , 1988, Mathematics and Its Applications.
[6] Nicola Santoro,et al. Gathering of Asynchronous Oblivious Robots with Limited Visibility , 2001, STACS.
[7] Sonia Martínez,et al. Robust rendezvous for mobile autonomous agents via proximity graphs in arbitrary dimensions , 2006, IEEE Transactions on Automatic Control.
[8] Mireille E. Broucke,et al. Local control strategies for groups of mobile autonomous agents , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).
[9] Justin Hayes,et al. Communication enhanced navigation strategies for teams of mobile agents , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).
[10] Brian D. O. Anderson,et al. The Multi-Agent Rendezvous Problem. An Extended Summary , 2005 .
[11] Mireille E. Broucke,et al. Local control strategies for groups of mobile autonomous agents , 2004, IEEE Transactions on Automatic Control.