Safe Metropolis-Hastings algorithm and its application to swarm control

DOI10.1016/J.SYSCONLE.2017.10.006zbMATH Open1380.93297OpenAlexW2771099899MaRDI QIDQ1697161FDOQ1697161

Authors: Mahmoud El Chamie, Behçet Açıkmeşe 

Publication date: 15 February 2018

Published in: Systems \& Control Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.sysconle.2017.10.006

Recommendations

• Gibbs sampler-based coordination of autonomous swarms
• Swarming for faster convergence in stochastic optimization
• Markov chain approach to probabilistic guidance for swarms of autonomous agents
• Decentralized coordination of autonomous swarms using parallel Gibbs sampling
• Swarm stability and optimization
• Swarm/flock optimization algorithms as continuous dynamic systems
• Probabilistic Control of Heterogeneous Swarms Subject to Graph Temporal Logic Specifications: A Decentralized and Scalable Approach
• Meta-control of an interacting-particle algorithm for global optimization
• Particle based gPC methods for mean-field models of swarming with uncertainty

zbMATH Keywords

Metropolis-Hastingsconvex optimizationMarkov chainssafety constraintsswarm control

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Stochastic programming (90C15) Decentralized systems (93A14) Synthesis problems (93B50)

Cites Work

• Title not available (Why is that?)
• Monte Carlo strategies in scientific computing
• Fast linear iterations for distributed averaging
• Graph theoretic methods in multiagent networks
• The Markov chain Monte Carlo revolution
• The Monte Carlo Method
• Non-negative matrices and Markov chains.
• Title not available (Why is that?)
• Title not available (Why is that?)
• What do we know about the Metropolis algorithm?
• Stability of Model-Based Networked Control Systems With Time-Varying Transmission Times
• Fastest mixing Markov chain on graphs with symmetries
• Fastest Mixing Markov Chain on a Graph
• Implicit dual control based on particle filtering and forward dynamic programming
• Controlled Markov chains with safety upper bound
• A geometric interpretation of the Metropolis-Hastings algorithm.
• Markov chain approach to probabilistic guidance for swarms of autonomous agents
• Convex Necessary and Sufficient Conditions for Density Safety Constraints in Markov Chain Synthesis
• Distributed Weight Selection in Consensus Protocols by Schatten Norm Minimization

Cited In (2)

• Gibbs sampler-based coordination of autonomous swarms
• Markov chain approach to probabilistic guidance for swarms of autonomous agents

This page was built for publication: Safe Metropolis-Hastings algorithm and its application to swarm control

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1697161)