150 research outputs found
Persistent Monitoring of Events with Stochastic Arrivals at Multiple Stations
This paper introduces a new mobile sensor scheduling problem, involving a
single robot tasked with monitoring several events of interest that occur at
different locations. Of particular interest is the monitoring of transient
events that can not be easily forecast. Application areas range from natural
phenomena ({\em e.g.}, monitoring abnormal seismic activity around a volcano
using a ground robot) to urban activities ({\em e.g.}, monitoring early
formations of traffic congestion using an aerial robot). Motivated by those and
many other examples, this paper focuses on problems in which the precise
occurrence times of the events are unknown {\em a priori}, but statistics for
their inter-arrival times are available. The robot's task is to monitor the
events to optimize the following two objectives: {\em (i)} maximize the number
of events observed and {\em (ii)} minimize the delay between two consecutive
observations of events occurring at the same location. The paper considers the
case when a robot is tasked with optimizing the event observations in a
balanced manner, following a cyclic patrolling route. First, assuming the
cyclic ordering of stations is known, we prove the existence and uniqueness of
the optimal solution, and show that the optimal solution has desirable
convergence and robustness properties. Our constructive proof also produces an
efficient algorithm for computing the unique optimal solution with time
complexity, in which is the number of stations, with time
complexity for incrementally adding or removing stations. Except for the
algorithm, most of the analysis remains valid when the cyclic order is unknown.
We then provide a polynomial-time approximation scheme that gives a
-optimal solution for this more general, NP-hard problem
Multi-Robot Path Planning for Persistent Monitoring in Stochastic and Adversarial Environments
In this thesis, we study multi-robot path planning problems for persistent monitoring tasks. The goal of such persistent monitoring tasks is to deploy a team of cooperating mobile robots in an environment to continually observe locations of interest in the environment. Robots patrol the environment in order to detect events arriving at the locations of the environment. The events stay at those locations for a certain amount of time before leaving and can only be detected if one of the robots visits the location of an event while the event is there.
In order to detect all possible events arriving at a vertex, the maximum time spent by the robots between visits to that vertex should be less than the duration of the events arriving at that vertex. We consider the problem of finding the minimum number of robots to satisfy these revisit time constraints, also called latency constraints. The decision version of this problem is PSPACE-complete. We provide an O(log p) approximation algorithm for this problem where p is the ratio of the maximum and minimum latency constraints. We also present heuristic algorithms to solve the problem and show through simulations that a proposed orienteering-based heuristic algorithm gives better solutions than the approximation algorithm. We additionally provide an algorithm for the problem of minimizing the maximum weighted latency given a fixed number of robots.
In case the event stay durations are not fixed but are drawn from a known distribution, we consider the problem of maximizing the expected number of detected events. We motivate randomized patrolling paths for such scenarios and use Markov chains to represent those random patrolling paths. We characterize the expected number of detected events as a function of the Markov chains used for patrolling and show that the objective function is submodular for randomly arriving events. We propose an approximation algorithm for the case where the event durations for all the vertices is a constant. We also propose a centralized and an online distributed algorithm to find the random patrolling policies for the robots. We also consider the case where the events are adversarial and can choose where and when to appear in order to maximize their chances of remaining undetected.
The last problem we study in this thesis considers events triggered by a learning adversary. The adversary has a limited time to observe the patrolling policy before it decides when and where events should appear. We study the single robot version of this problem and model this problem as a multi-stage two player game. The adversary observes the patroller’s actions for a finite amount of time to learn the patroller’s strategy and then either chooses a location for the event to appear or reneges based on its confidence in the learned strategy. We characterize the expected payoffs for the players and propose a search algorithm to find a patrolling policy in such scenarios. We illustrate the trade off between hard to learn and hard to attack strategies through simulations
Age Optimal Information Gathering and Dissemination on Graphs
We consider the problem of timely exchange of updates between a central
station and a set of ground terminals , via a mobile agent that traverses
across the ground terminals along a mobility graph . We design the
trajectory of the mobile agent to minimize peak and average age of information
(AoI), two newly proposed metrics for measuring timeliness of information. We
consider randomized trajectories, in which the mobile agent travels from
terminal to terminal with probability . For the information
gathering problem, we show that a randomized trajectory is peak age optimal and
factor- average age optimal, where is the mixing
time of the randomized trajectory on the mobility graph . We also show that
the average age minimization problem is NP-hard. For the information
dissemination problem, we prove that the same randomized trajectory is
factor- peak and average age optimal. Moreover, we propose an
age-based trajectory, which utilizes information about current age at
terminals, and show that it is factor- average age optimal in a symmetric
setting
Risk-aware navigation for UAV digital data collection
This thesis studies the navigation task for autonomous UAVs to collect digital data in a risky environment. Three problem formulations are proposed according to different real-world situations. First, we focus on uniform probabilistic risk and assume UAV has unlimited amount of energy. With these assumptions, we provide the graph-based Data-collecting Robot Problem (DRP) model, and propose heuristic planning solutions that consist of a clustering step and a tour building step. Experiments show our methods provide high-quality solutions with high expected reward. Second, we investigate non-uniform probabilistic risk and limited energy capacity of UAV. We present the Data-collection Problem (DCP) to model the task. DCP is a grid-based Markov decision process, and we utilize reinforcement learning with a deep Ensemble Navigation Network (ENN) to tackle the problem. Given four simple navigation algorithms and some additional heuristic information, ENN is able to find improved solutions. Finally, we consider the risk in the form of an opponent and limited energy capacity of UAV, for which we resort to the Data-collection Game (DCG) model. DCG is a grid-based two-player stochastic game where the opponent may have different strategies. We propose opponent modeling to improve data-collection efficiency, design four deep neural networks that model the opponent\u27s behavior at different levels, and empirically prove that explicit opponent modeling with a dedicated network provides superior performance
Energy-Efficient URLLC Service Provision via a Near-Space Information Network
The integration of a near-space information network (NSIN) with the
reconfigurable intelligent surface (RIS) is envisioned to significantly enhance
the communication performance of future wireless communication systems by
proactively altering wireless channels. This paper investigates the problem of
deploying a RIS-integrated NSIN to provide energy-efficient, ultra-reliable and
low-latency communications (URLLC) services. We mathematically formulate this
problem as a resource optimization problem, aiming to maximize the effective
throughput and minimize the system power consumption, subject to URLLC and
physical resource constraints. The formulated problem is challenging in terms
of accurate channel estimation, RIS phase alignment, theoretical analysis, and
effective solution. We propose a joint resource allocation algorithm to handle
these challenges. In this algorithm, we develop an accurate channel estimation
approach by exploring message passing and optimize phase shifts of RIS
reflecting elements to further increase the channel gain. Besides, we derive an
analysis-friend expression of decoding error probability and decompose the
problem into two-layered optimization problems by analyzing the monotonicity,
which makes the formulated problem analytically tractable. Extensive
simulations have been conducted to verify the performance of the proposed
algorithm. Simulation results show that the proposed algorithm can achieve
outstanding channel estimation performance and is more energy-efficient than
diverse benchmark algorithms
Optimal UAS Assignments and Trajectories for Persistent Surveillance and Data Collection from a Wireless Sensor Network
This research developed a method for multiple Unmanned Aircraft Systems (UAS) to efficiently collect data from a Wireless Sensor Networks (WSN). WSN are composed of any number of fixed, ground-based sensors that collect and upload local environmental data to over flying UAS. The three-step method first uniquely assigns aircraft to specific sensors on the ground. Second, an efficient flight path is calculated to minimize the aircraft flight time required to verify their assigned sensors. Finally, sensors reporting relatively higher rates of local environmental activity are re-assigned to dedicated aircraft tasked with concentrating on only those sensors. This work was sponsored by the Air Force Research Laboratory, Control Sciences branch, at Wright Patterson AFB. Based on simulated scenarios and preliminary flight tests, optimal flight paths resulted in a 14 to 32 reduction in flight time and distance when compared to traditional flight planning methods
- …