Related papers: A Combinatorial Bound for Beacon-based Routing in …
We consider an n-dimensional Brownian Motion trapped inside a bounded convex set by normally-reflecting boundaries. It is well-known that this process is uniformly ergodic. However, the rates of this ergodicity are not well-understood,…
An underactuated nonholonomic Dubins-vehicle-like robot with a lower-limited turning radius travels with a constant speed in a plane, which hosts unknown complex objects. The robot has to approach and then circumnavigate all objects, with…
In this paper, we consider nearest-neighbor oriented percolation with independent Bernoulli bond-occupation probability on the $d$-dimensional body-centered cubic (BCC) lattice $\mathbb{L}^d$ and the set of non-negative integers…
We study the problem of motion planning for a collection of $n$ labeled unit disc robots in a polygonal environment. We assume that the robots have revolving areas around their start and final positions: that each start and each final is…
We consider the following variant of the two dimensional gathering problem for swarms of robots: Given a swarm of $n$ indistinguishable, point shaped robots on a two dimensional grid. Initially, the robots form a closed chain on the grid…
We consider the unlabeled motion-planning problem of $m$ unit-disc robots moving in a simple polygonal workspace of $n$ edges. The goal is to find a motion plan that moves the robots to a given set of $m$ target positions. For the unlabeled…
In this paper, we propose a selection region based multihop routing protocol with directional antennas for wireless mobile ad hoc networks, where the selection region is defined by two parameters: a reference distance and the beamwidth of…
This work proposes a novel transformation termed the conformal navigation transformation to achieve collision-free navigation of a robot in a workspace populated with arbitrary polygonal obstacles. The properties of the conformal navigation…
This paper presents an algorithm to deploy a team of {\it free} guards equipped with omni-directional cameras for tracking a bounded speed intruder inside a simply-connected polygonal environment. The proposed algorithm partitions the…
Boolean networks are a popular modeling framework in computational biology to capture the dynamics of molecular networks, such as gene regulatory networks. It has been observed that many published models of such networks are defined by…
We consider a set of k autonomous robots that are endowed with visibility sensors (but that are otherwise unable to communicate) and motion actuators. Those robots must collaborate to reach a sin- gle vertex that is unknown beforehand, and…
This paper continues a study on trajectories of Brownian Motion in a field of soft trap whose radius distribution is unbounded. We show here for both point-to-point and point-to-plane model the volume exponent (the exponent associated to…
Attractor neural network models of cortical decision-making circuits represent them as dynamical systems in the state space of neural firing rates with the attractors of the network encoding possible decisions. While the attractors of these…
The Arbitrary Pattern Formation problem asks for a distributed algorithm that moves a set of autonomous mobile robots to form any arbitrary pattern given as input. The robots are assumed to be autonomous, anonymous and identical. They…
Given a set of $n$ point robots inside a simple polygon $P$, the task is to move the robots from their starting positions to their target positions along their shortest paths, while the mutual visibility of these robots is preserved.…
Multi-Robot Coverage problems have been extensively studied in robotics, planning and multi-agent systems. In this work, we consider the coverage problem when there are constraints on the proximity (e.g., maximum distance between the…
This work focuses on the following question related to the Gathering problem of $n$ autonomous, mobile robots in the Euclidean plane: Is it possible to solve Gathering of robots that do not agree on any axis of their coordinate systems…
We study the rendezvous problem for two robots moving in the plane (or on a line). Robots are autonomous, anonymous, oblivious, and carry colored lights that are visible to both. We consider deterministic distributed algorithms in which…
Bayesian persuasion is a model for understanding strategic information revelation: an agent with an informational advantage, called a sender, strategically discloses information by sending signals to another agent, called a receiver. In…
Despite their apparent simplicity, random Boolean networks display a rich variety of dynamical behaviors. Much work has been focused on the properties and abundance of attractors. We here derive an expression for the number of attractors in…