Related papers: Optimal management of impaired self-avoiding rando…
In tasks such as surveying or monitoring remote regions, an autonomous robot must move while transmitting data over a wireless network with unknown, position-dependent transmission rates. For such a robot, this paper considers the problem…
One of the main challenges in reinforcement learning is solving tasks with sparse reward. We show that the difficulty of discovering a distant rewarding state in an MDP is bounded by the expected cover time of a random walk over the graph…
We carry out comparative studies of random walks on deterministic Apollonian networks (DANs) and random Apollonian networks (RANs). We perform computer simulations for the mean first passage time, the average return time, the mean-square…
This paper addresses consensus optimization problems in a multi-agent network, where all agents collaboratively find a minimizer for the sum of their private functions. We develop a new decentralized algorithm in which each agent…
The use of data assimilation technique to identify optimal topography is discussed in frames of time-dependent motion governed by non-linear barotropic ocean model. Assimilation of artificially generated data allows to measure the influence…
We study, on a $d$ dimensional hypercubic lattice, a random walk which is homogeneous except for one site. Instead of visiting this site, the walker hops over it with arbitrary rates. The probability distribution of this walk and the…
We study exploration properties of a random walk on a network. For a fully connected network we find that the problem can be mapped to the well known coupon collector problem, thus allowing us to estimate form of $P(S,t)$: the distribution…
We introduce a formalism based on a continuous time approximation, to study the characteristics of Page Rank random walks. We find that the diffusion of the occupancy probability has a dynamics that exponentially "forgets" the initial…
We study the kinetics for the search of an immobile target by randomly moving searchers that detect it only upon encounter. The searchers perform intermittent random walks on a one-dimensional lattice. Each searcher can step on a nearest…
We study the dynamics of a starving random walk in general spatial dimension $d$. This model represents an idealized description for the fate of an unaware forager whose motion is not affected by the presence or absence of resources. The…
We consider a class of reinforcement-learning systems in which the agent follows a behavior policy to explore a discrete state-action space to find an optimal policy while adhering to some restriction on its behavior. Such restriction may…
Seamless redundancy layered atop Wi-Fi has been shown able to tangibly increase communication quality, hence offering industry-grade reliability. However, it also implies much higher network traffic, which is often unbearable as the…
Let D be a domain in the plane containing the origin. We are interested in the ensemble of self-avoiding walks (SAW's) in D which start at the origin and end on the boundary of the domain. We introduce an ensemble of SAW's that we expect to…
Multi-agent coverage control is used as a mechanism to influence the behavior of a group of robots by introducing time-varying domain. The coverage optimization problem is modified to adopt time-varying domains, and the proposed control law…
In this paper, preys with stochastic evasion policies are considered. The stochasticity adds unpredictable changes to the prey's path for avoiding predator's attacks. The prey's cost function is composed of two terms balancing the…
Aging refers to the property of two-time correlation functions to decay very slowly on (at least) two time scales. This phenomenon has gained recent attention due to experimental observations of the history dependent relaxation behavior in…
A defender dispatches patrollers to circumambulate a perimeter to guard against potential attacks. The defender decides on the time points to dispatch patrollers and each patroller's direction and speed, as long as the long-run rate…
This paper investigates the mission planning problem for spacecraft confronting orbital debris to achieve autonomous avoidance. Firstly, combined with the avoidance requirements, a closed-loop framework of autonomous avoidance for orbital…
This work analyzes fractional continuous-time random walks on two-layer multiplexes. A node-centric dynamics is used, in which it is assumed a Poisson distribution of a walker to become active, while a jump to one of its neighbors depends…
The patterns of motion of mobile agents has received recently wide attention in the literature. There is a number of recent studies centered around the motion behavior of many agents ranging from albatrosses to human beings. Special…