Title :
Swarming control using parallel Gibbs sampling
Author_Institution :
Dept. of Electr. & Comput. Eng., Michigan State Univ., East Lansing, MI
Abstract :
In the prior work of the author and his coworkers, Gibbs sampling was proposed for coordination of autonomous swarms, where convergence results were only obtained for sequential sampling with additional requirement of modest global communication. In this paper the convergence behavior is investigated under parallel Gibbs sampling, where all mobile nodes update their locations simultaneously. It is established that, with a pairwise Gibbs potential, parallel Gibbs sampling and annealing minimizes a modified potential energy, where the extent of modification is determined by the maximum travel range of each node within one time step. This is the first convergence result for parallel sampling algorithms for Gibbs random fields with configuration-dependent neighborhood systems, and it provides justification for Gibbs sampling as a viable method for swarming control. The latter is further illustrated with simulation results.
Keywords :
Markov processes; convergence; mobile robots; parallel algorithms; random processes; sampling methods; simulated annealing; Markov random fields; autonomous swarm control; configuration-dependent neighborhood systems; convergence behavior; mobile robot; pairwise Gibbs potential; parallel Gibbs sampling algorithm; simulated annealing; Annealing; Communication system control; Convergence; Costs; Global communication; Mobile robots; Potential energy; Remotely operated vehicles; Sampling methods; Weather forecasting;
Conference_Titel :
American Control Conference, 2008
Conference_Location :
Seattle, WA
Print_ISBN :
978-1-4244-2078-0
Electronic_ISBN :
0743-1619
DOI :
10.1109/ACC.2008.4587069