1,869 research outputs found
Rendezvous of Two Robots with Constant Memory
We study the impact that persistent memory has on the classical rendezvous
problem of two mobile computational entities, called robots, in the plane. It
is well known that, without additional assumptions, rendezvous is impossible if
the entities are oblivious (i.e., have no persistent memory) even if the system
is semi-synchronous (SSynch). It has been recently shown that rendezvous is
possible even if the system is asynchronous (ASynch) if each robot is endowed
with O(1) bits of persistent memory, can transmit O(1) bits in each cycle, and
can remember (i.e., can persistently store) the last received transmission.
This setting is overly powerful.
In this paper we weaken that setting in two different ways: (1) by
maintaining the O(1) bits of persistent memory but removing the communication
capabilities; and (2) by maintaining the O(1) transmission capability and the
ability to remember the last received transmission, but removing the ability of
an agent to remember its previous activities. We call the former setting
finite-state (FState) and the latter finite-communication (FComm). Note that,
even though its use is very different, in both settings, the amount of
persistent memory of a robot is constant.
We investigate the rendezvous problem in these two weaker settings. We model
both settings as a system of robots endowed with visible lights: in FState, a
robot can only see its own light, while in FComm a robot can only see the other
robot's light. We prove, among other things, that finite-state robots can
rendezvous in SSynch, and that finite-communication robots are able to
rendezvous even in ASynch. All proofs are constructive: in each setting, we
present a protocol that allows the two robots to rendezvous in finite time.Comment: 18 pages, 3 figure
Optimal Byzantine Resilient Convergence in Asynchronous Robot Networks
We propose the first deterministic algorithm that tolerates up to
byzantine faults in -sized networks and performs in the asynchronous
CORDA model. Our solution matches the previously established lower bound for
the semi-synchronous ATOM model on the number of tolerated Byzantine robots.
Our algorithm works under bounded scheduling assumptions for oblivious robots
moving in a uni-dimensional space
Development of foam-based layered targets for laser-driven ion beam production
We report on the development of foam-based double-layer targets (DLTs) for laser-driven ion acceleration. Foam layers with a density of a few mg cm-3 and controlled thickness in the 8-36 μm range were grown on μm-thick Al foils by pulsed laser deposition (PLD). The DLTs were experimentally investigated by varying the pulse intensity, laser polarisation and target properties. Comparing DLTs with simple Al foils, we observed a systematic enhancement of the maximum and average energies and number of accelerated ions. Maximum energies up to 30 MeV for protons and 130 MeV for C6+ ions were detected. Dedicated three-dimensional particle-in-cell (3D-PIC) simulations were performed considering both uniform and cluster-assembled foams to interpret the effect of the foam nanostructure on the acceleration process
- …