Decentralized coordination of autonomous swarms using parallel Gibbs sampling
نویسندگان
چکیده
منابع مشابه
Decentralized coordination of autonomous swarms using parallel Gibbs sampling
In this paper we present analysis of a discrete-time, decentralized, stochastic coordination algorithm for a group of mobile nodes, called an autonomous swarm, on a finite spatial lattice. All nodes take their moves by sampling in parallel their locally perceived Gibbs distributions corresponding to a pairwise, nearestneighbor potential. The algorithm has no explicit requirements on the connect...
متن کاملGibbs sampler-based coordination of autonomous swarms
In this paper a novel, Gibbs sampler-based algorithm is proposed for coordination of autonomous swarms. The swarm is modeled as a Markov random field (MRF) on a graph with a time-varying neighborhood system determined by local interaction links. The Gibbs potential is designed to reflect global objectives and constraints. It is established that, with primarily local sensing/communications, the ...
متن کاملDecentralized probabilistic density control of autonomous swarms with safety constraints
This paper presents a Markov chain based approach for the probabilistic density control of a large number, swarm, of autonomous agents. The proposed approach specifies the time evolution of the probabilistic density distribution by using a Markov chain, which guides the swarm to a desired steady-state distribution, while satisfying the prescribed ergodicity, motion, and safety constraints. This...
متن کاملDecentralized Coordination of Autonomous Vehicles at intersections
In this paper, the decentralized coordination of point-mass autonomous vehicles at intersections using navigation functions is considered. As main contribution, the inertia of the vehicles is taken into account to enable on-board energy optimization for crossing. In such a way, heavier vehicles that need more energy and time for acceleration or breaking are given an indirect priority at interse...
متن کاملRandomized coordination in an autonomous decentralized system
We investigate the performance of a randomized coordination mechanism for resource access in an autonomous decentralized system. Given n users and r resources, each user decides to access a resource with probability a, and each resource is selected with equal likelihood. The goal i s to select a so that mutually conjicting decisions, where multiple users try to access the same resource, are min...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Automatica
سال: 2010
ISSN: 0005-1098
DOI: 10.1016/j.automatica.2010.09.004