98,855 research outputs found
Towards time-varying proximal dynamics in Multi-Agent Network Games
Distributed decision making in multi-agent networks has recently attracted
significant research attention thanks to its wide applicability, e.g. in the
management and optimization of computer networks, power systems, robotic teams,
sensor networks and consumer markets. Distributed decision-making problems can
be modeled as inter-dependent optimization problems, i.e., multi-agent
game-equilibrium seeking problems, where noncooperative agents seek an
equilibrium by communicating over a network. To achieve a network equilibrium,
the agents may decide to update their decision variables via proximal dynamics,
driven by the decision variables of the neighboring agents. In this paper, we
provide an operator-theoretic characterization of convergence with a
time-invariant communication network. For the time-varying case, we consider
adjacency matrices that may switch subject to a dwell time. We illustrate our
investigations using a distributed robotic exploration example.Comment: 6 pages, 3 figure
Generic-case complexity, decision problems in group theory and random walks
We give a precise definition of ``generic-case complexity'' and show that for
a very large class of finitely generated groups the classical decision problems
of group theory - the word, conjugacy and membership problems - all have
linear-time generic-case complexity. We prove such theorems by using the theory
of random walks on regular graphs.Comment: Revised versio
On Structured Realizability and Stabilizability of Linear Systems
We study the notion of structured realizability for linear systems defined
over graphs. A stabilizable and detectable realization is structured if the
state-space matrices inherit the sparsity pattern of the adjacency matrix of
the associated graph. In this paper, we demonstrate that not every structured
transfer matrix has a structured realization and we reveal the practical
meaning of this fact. We also uncover a close connection between the structured
realizability of a plant and whether the plant can be stabilized by a
structured controller. In particular, we show that a structured stabilizing
controller can only exist when the plant admits a structured realization.
Finally, we give a parameterization of all structured stabilizing controllers
and show that they always have structured realizations
Extracting causal relationships from Chinese written text
Expert systems form one of the most important research areas in Artificial Intelligence. The main parts in expert systems are knowledge bases and inference engines. In the knowledge bases the main knowledge is knowledge in the form of ``IF-THEN" statements. In knowledge graphs, a new form of knowledge representation, the ``IF-THEN" statements are tied up with causal operators (CAU-relations). In this paper, we picked out some Chinese operators with ``CAU" meaning, and investigated these operators. We also show by an example how to extract causal relations from a given Chinese writing text
- …