Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userMixed Hegselmann-Krause Dynamics--Nondeterministic Case
160
0
0.0
(
0
)
Authors
Hsin-Lun Li
Ask ChatGPT about the research
No Arabic abstract
The original Hegselmann-Krause (HK) model is composed of a finite number of agents characterized by their opinion, a number in $[0,1]$. An agent updates its opinion via taking the average opinion of its neighbors whose opinion differs by at most $epsilon$ for $epsilon>0$ a confidence bound. An agent is absolutely stubborn if it does not change its opinion while update, and absolutely open-minded if its update is the average opinion of its neighbors. There are two types of HK models--the synchronous HK model and the asynchronous HK model. The paper is about a variant of the HK dynamics, called the mixed model, where each agent can choose its degree of stubbornness and mix its opinion with the average opinion of its neighbors at all times. The mixed model reduces to the synchronous HK model if all agents are absolutely open-minded all the time, and the asynchronous HK model if only one uniformly randomly selected agent is absolutely open-minded and the others are absolutely stubborn at all times. In cite{mhk}, we discuss the mixed model deterministically. Point out some properties of the synchronous HK model, such as finite-time convergence, do not hold for the mixed model. In this topic, we study the mixed model nondeterministically. List some properties of the asynchronous model which do not hold for the mixed model. Then, study circumstances under which the asymptotic stability holds.
rate research
Read More
The original Hegselmann-Krause (HK) model consists of a set of~$n$ agents that are characterized by their opinion, a number in~$[0, 1]$. Each agent, say agent~$i$, updates its opinion~$x_i$ by taking the average opinion of all its neighbors, the agents whose opinion differs from~$x_i$ by at most~$epsilon$. There are two types of~HK models: the synchronous~HK model and the asynchronous~HK model. For the synchronous model, all the agents update their opinion simultaneously at each time step, whereas for the asynchronous~HK model, only one agent chosen uniformly at random updates its opinion at each time step. This paper is concerned with a variant of the~HK opinion dynamics, called the mixed~HK model, where each agent can choose its degree of stubbornness and mix its opinion with the average opinion of its neighbors at each update. The degree of the stubbornness of agents can be different and/or vary over time. An agent is not stubborn or absolutely open-minded if its new opinion at each update is the average opinion of its neighbors, and absolutely stubborn if its opinion does not change at the time of the update. The particular case where, at each time step, all the agents are absolutely open-minded is the synchronous~HK model. In contrast, the asynchronous model corresponds to the particular case where, at each time step, all the agents are absolutely stubborn except for one agent chosen uniformly at random who is absolutely open-minded. We first show that some of the common properties of the synchronous~HK model, such as finite-time convergence, do not hold for the mixed model. We then investigate conditions under which the asymptotic stability holds, or a consensus can be achieved for the mixed model.
This paper elaborates control strategies to prevent clustering effects in opinion formation models. This is the exact opposite of numerous situations encountered in the literature where, on the contrary, one seeks controls promoting consensus. In order to promote declustering, instead of using the classical variance that does not capture well the phenomenon of dispersion, we introduce an entropy-type functional that is adapted to measuring pairwise distances between agents. We then focus on a Hegselmann-Krause-type system and design declustering sparse controls both in finite-dimensional and kinetic models. We provide general conditions characterizing whether clustering can be avoided as function of the initial data. Such results include the description of black holes (where complete collapse to consensus is not avoidable), safety zones (where the control can keep the system far from clustering), basins of attraction (attractive zones around the clustering set) and collapse prevention (when convergence to the clustering set can be avoided).
Interface theories are powerful frameworks supporting incremental and compositional design of systems through refinements and constructs for conjunction, and parallel composition. In this report we present a first Interface Theor -- |Modal Mixed Interfaces -- for systems exhibiting both non-determinism and randomness in their behaviour. The associated component model -- Mixed Markov Decision Processes -- is also novel and subsumes both ordinary Markov Decision Processes and Probabilistic Automata.
We propose a dual dynamic integer programming (DDIP) framework for solving multi-scale mixed-integer model predictive control (MPC) problems. Such problems arise in applications that involve long horizons and/or fine temporal discretizations as well as mixed-integer states and controls (e.g., scheduling logic and discrete actuators). The approach uses a nested cutting-plane scheme that performs forward and backward sweeps along the time horizon to adaptively approximate cost-to-go functions. The DDIP scheme proposed can handle general MPC formulations with mixed-integer controls and states and can perform forward-backward sweeps over block time partitions. We demonstrate the performance of the proposed scheme by solving mixed-integer MPC problems that arise in the scheduling of central heating, ventilation, and air-conditioning (HVAC) plants. We show that the proposed scheme is scalable and dramatically outperforms state-of-the-art mixed-integer solvers.
The travelling salesman problem (TSP) of space trajectory design is complicated by its complex structure design space. The graph based tree search and stochastic seeding combinatorial approaches are commonly employed to tackle the time-dependent TSP due to their combinatorial nature. In this paper, a new continuous optimization strategy for the mixed integer combinatorial problem is proposed. The space trajectory combinatorial problem is tackled using continuous gradient based method. A continuous mapping technique is developed to map the integer type ID of targets on the sequence to a set of continuous design variables. Expected flyby targets are introduced as references and used as priori to select the candidate target to fly by. Bayesian based analysis is employed to model accumulated posterior of the sequence and a new objective function with quadratic form constraints is constructed. The new introduced auxiliary design variables of expected targets together with the original design variables are set to be optimized. A gradient based optimizer is used to search optimal sequence parameter. Performances of the proposed algorithm are demonstrated through a multiple debris rendezvous problem and a static TSP benchmark.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
