Decentralized State-Dependent Markov Chain Synthesis for Swarm Guidance

by   Samet Uzun, et al.

This paper introduces a decentralized state-dependent Markov chain synthesis method for probabilistic swarm guidance of a large number of autonomous agents to a desired steady-state distribution. The probabilistic swarm guidance approach is based on using a Markov chain that determines the transition probabilities of agents to transition from one state to another while satisfying prescribed transition constraints and converging to a desired steady-state distribution. Our main contribution is to develop a decentralized approach to the Markov chain synthesis that updates the underlying column stochastic Markov matrix as a function of the state, i.e., the current swarm probability distribution. Having a decentralized synthesis method eliminates the need to have complex communication architecture. Furthermore, the proposed method aims to cause a minimal number of state transitions to minimize resource usage while guaranteeing convergence to the desired distribution. It is also shown that the convergence rate is faster when compared with previously proposed methodologies.



There are no comments yet.


page 8


A Probabilistic Guidance Approach to Swarm-to-Swarm Engagement Problem

This paper introduces a probabilistic guidance approach for the swarm-to...

Probabilistic Control of Heterogeneous Swarms Subject to Graph Temporal Logic Specifications: A Decentralized and Scalable Approach

We develop a probabilistic control algorithm, , for swarms of agents wit...

The Platform Design Problem

On-line firms deploy suites of software platforms, where each platform i...

Estimation of Semi-Markov Multi-state Models: A Comparison of the Sojourn Times and Transition Intensities Approaches

Semi-Markov models are widely used for survival analysis and reliability...

Pangloss: a novel Markov chain prefetcher

We present Pangloss, an efficient high-performance data prefetcher that ...

Tractable Learning and Inference for Large-Scale Probabilistic Boolean Networks

Probabilistic Boolean Networks (PBNs) have been previously proposed so a...

Infinity Learning: Learning Markov Chains from Aggregate Steady-State Observations

We consider the task of learning a parametric Continuous Time Markov Cha...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.