Abstract : We present an economical ($6,000) framework for verifying, in hardware, swarm-based algorithms that were previously developed in computer simulation of large numbers of weapons engaging a plurality of highly maneuverable targets. This framework consists of a maximum of 10 small, autonomous, ground robots and an overhead vision tracking system that mimics both global positioning system (GPS) localization and peer-to-peer robot communications. Robots maintain a cohesive network formation by balancing a virtual system of interconnecting spring forces. The use of an optimal target-weapon pairing algorithm and interception methods enable weapons to intercept targets while minimizing global transit distance. Experimental results indicate that network formation occurs, on the average, in less than 25 seconds for a sixnode robotic swarm. Thus our framework provides an economical, simple, quick, and reliable way of investigating the interaction among the mobile nodes of a robotic swarm using embedded algorithms.
[1]
Suranga Hettiarachchi,et al.
An Overview of Physicomimetics
,
2004,
Swarm Robotics.
[2]
Gary Hewer,et al.
Swarm Counter-Asymmetric-Threat (CAT) 6-DOF Dynamics Simulation
,
2005
.
[3]
Issei Fujishiro,et al.
The elements of graphing data
,
2005,
The Visual Computer.
[4]
Ling Shi,et al.
Virtual attractive-repulsive potentials for cooperative control of second order dynamic vehicles on the Caltech MVWT
,
2005,
Proceedings of the 2005, American Control Conference, 2005..
[5]
Dimitri P. Bertsekas,et al.
Reverse Auction and the Solution of Inequality Constrained Assignment Problems
,
1993,
SIAM J. Optim..
[6]
Yuan Huang,et al.
An economical micro-car testbed for validation of cooperative control strategies
,
2006,
2006 American Control Conference.