Swarm ant robotics for a dynamic cleaning problem — upper bounds
暂无分享,去创建一个
[1] Bhaskar Krishnamachari,et al. Distributed Constraint Satisfaction in a Wireless Sensor Tracking System , 2001 .
[2] Ralph L. Hollis,et al. Distributed coverage of rectilinear environments , 2000 .
[3] Manfredo P. do Carmo,et al. Differential geometry of curves and surfaces , 1976 .
[4] Siddhartha S. Srinivasa,et al. Toward sensor-based coverage with robot teams , 2002, SPIE Optics East.
[5] Rodney A. Brooks,et al. Elephants don't play chess , 1990, Robotics Auton. Syst..
[6] Marios M. Polycarpou,et al. Cooperative Control for Autonomous Air Vehicles , 2002 .
[7] Sandip Sen,et al. Learning to Coordinate without Sharing Information , 1994, AAAI.
[8] Sven Koenig,et al. Terrain coverage with ant robots: a simulation study , 2001, AGENTS '01.
[9] Jayme Luiz Szwarcfiter,et al. Hamilton Paths in Grid Graphs , 1982, SIAM J. Comput..
[10] Howie Choset,et al. Path Planning for Robotic Demining and Development of a Test Platform , 2001 .
[11] Irene A. Stegun,et al. Handbook of Mathematical Functions. , 1966 .
[12] How Khee Yin,et al. A decentralized approach for cooperative sweeping by multiple mobile robots , 1998 .