4,482 research outputs found
Norm Monitoring under Partial Action Observability
In the context of using norms for controlling multi-agent systems, a vitally
important question that has not yet been addressed in the literature is the
development of mechanisms for monitoring norm compliance under partial action
observability. This paper proposes the reconstruction of unobserved actions to
tackle this problem. In particular, we formalise the problem of reconstructing
unobserved actions, and propose an information model and algorithms for
monitoring norms under partial action observability using two different
processes for reconstructing unobserved actions. Our evaluation shows that
reconstructing unobserved actions increases significantly the number of norm
violations and fulfilments detected.Comment: Accepted at the IEEE Transaction on Cybernetic
Norm Monitoring under Partial Action Observability
In the context of using norms for controlling multi-agent systems, a vitally important question that has not yet been addressed in the literature is the development of mechanisms for monitoring norm compliance under partial action observability. This paper proposes the reconstruction of unobserved actions to tackle this problem. In particular, we formalise the problem of reconstructing unobserved actions, and propose an information model and algorithms for monitoring norms under partial action observability using two different processes for reconstructing unobserved actions. Our evaluation shows that reconstructing unobserved actions increases significantly the number of norm violations and fulfilments detected
No Internal Regret via Neighborhood Watch
We present an algorithm which attains O(\sqrt{T}) internal (and thus
external) regret for finite games with partial monitoring under the local
observability condition. Recently, this condition has been shown by (Bartok,
Pal, and Szepesvari, 2011) to imply the O(\sqrt{T}) rate for partial monitoring
games against an i.i.d. opponent, and the authors conjectured that the same
holds for non-stochastic adversaries. Our result is in the affirmative, and it
completes the characterization of possible rates for finite partial-monitoring
games, an open question stated by (Cesa-Bianchi, Lugosi, and Stoltz, 2006). Our
regret guarantees also hold for the more general model of partial monitoring
with random signals
Coverage and Field Estimation on Bounded Domains by Diffusive Swarms
In this paper, we consider stochastic coverage of bounded domains by a
diffusing swarm of robots that take local measurements of an underlying scalar
field. We introduce three control methodologies with diffusion, advection, and
reaction as independent control inputs. We analyze the diffusion-based control
strategy using standard operator semigroup-theoretic arguments. We show that
the diffusion coefficient can be chosen to be dependent only on the robots'
local measurements to ensure that the swarm density converges to a function
proportional to the scalar field. The boundedness of the domain precludes the
need to impose assumptions on decaying properties of the scalar field at
infinity. Moreover, exponential convergence of the swarm density to the
equilibrium follows from properties of the spectrum of the semigroup generator.
In addition, we use the proposed coverage method to construct a
time-inhomogenous diffusion process and apply the observability of the heat
equation to reconstruct the scalar field over the entire domain from
observations of the robots' random motion over a small subset of the domain. We
verify our results through simulations of the coverage scenario on a 2D domain
and the field estimation scenario on a 1D domain.Comment: To appear in the proceedings of the 55th IEEE Conference on Decision
and Control (CDC 2016
- …