Related papers: Optimal management of impaired self-avoiding rando…

The motion of self-propelled particles is modeled as a persistent random walk. An analytical framework is developed that allows the derivation of exact expressions for the time evolution of arbitrary moments of the persistent walk's…

During a random search, resetting the searcher's position from time to time to the starting point often reduces the mean completion time of the process. Although many different resetting models have been studied over the past ten years,…

The pursuit-evasion problem is widespread in nature, engineering, and societal applications. It is commonly observed in nature that predators often exhibit faster speeds than their prey but have less agile maneuverability. Over millions of…

Sensor networks are ubiquitously used for detection and tracking and as a result covering is one of the main tasks of such networks. We study the problem of maximizing the coverage lifetime of a barrier by mobile sensors with limited…

Cooperation between mobile robots and wireless sensor networks is a line of research that is currently attracting a lot of attention. In this context, we study the following problem of barrier coverage by stationary wireless sensors that…

A variant of the optimal control problem is considered which is nonstandard in that the performance index contains "stochastic" integrals, that is, integrals against very irregular functions. The motivation for considering such performance…

Classically encountered problem of acceleration runaway in radiative motion of a charged-particle is addressed by considering the criterion of minimum radiation loss under optimum displacement in variationally referred dynamic course in…

This paper examines the degree to which an evader seeking a safe and efficient path to a target location can benefit from increasing levels of knowledge regarding one or more range-limited pursuers seeking to intercept it. Unlike previous…

We consider a minimal model of persistent random searcher with short range memory. We calculate exactly for such searcher the mean first-passage time to a target in a bounded domain and find that it admits a non trivial minimum as function…

Optimal sensor placement (SP) usually minimizes an impact measure, such as the amount of contaminated water or the number of inhabitants affected before detection. The common choice is to minimize the minimum detection time (MDT) averaged…

Random walks on graphs are an essential primitive for many randomised algorithms and stochastic processes. It is natural to ask how much can be gained by running $k$ multiple random walks independently and in parallel. Although the cover…

The problem of noise-induced escape from a metastable state arises in physics, chemistry, biology, systems engineering, and other areas. The problem is well understood when the underlying dynamics of the system obey detailed balance. When…

We study diffusion on a multilayer network where the contact dynamics between the nodes is governed by a random process and where the waiting time distribution differs for edges from different layers. We study the impact on a random walk of…

Consider a team of agents in the plane searching for and visiting target points that appear in a bounded environment according to a stochastic renewal process with a known absolutely continuous spatial distribution. Agents must detect…

In this paper, we investigate a time-slotted cognitive setting with buffered primary and secondary users. In order to alleviate the negative effects of misdetection and false alarm probabilities, a novel design of spectrum access mechanism…

This paper presents Wanderer, a model of how autonomous adaptive systems coordinate internal biological needs with moment-by-moment assessments of the probabilities of events in the external world. The extent to which Wanderer moves about…

Navigating toward a known target in a noisy environment is a fundamental problem shared across biological, physical, and engineered systems. Although optimal strategies are often framed in terms of continuous, fine-grained feedback, we show…

Autonomous exploration in mobile robotics often involves a trade-off between two objectives: maximizing environmental coverage and minimizing the total path length. In the widely used information gain paradigm, exploration is guided by the…

This work concerns the minimization of the pseudospectral abscissa of a matrix-valued function dependent on parameters analytically. The problem is motivated by robust stability and transient behavior considerations for a linear control…

We consider the escape interdiction problem in a transportation network. In the absence of traffic in the network, the criminal/attacker tries to escape from the city using any of the shortest paths from the crime scene to any randomly…