This paper addresses the complete area coverage problem of a known environment by multiple-robots. Complete area coverage is the problem of moving an end-effector over all available space while avoiding existing obstacles. In such tasks, using multiple robots can increase the efficiency of the area coverage in terms of minimizing the operational time and increase the robustness in the face of robot attrition. Unfortunately, the problem of finding an optimal solution for such an area coverage problem with multiple robots is known to be NP-complete. In this paper we present two approximation heuristics for solving the multi-robot coverage problem. The first solution presented is a direct extension of an efficient single robot area coverage algorithm, based on an exact cellular decomposition. The second algorithm is a greedy approach that divides the area into equal regions and applies an efficient single-robot coverage algorithm to each region. We present experimental results for two algorithms. Results indicate that our approaches provide good coverage distribution between robots and minimize the workload per robot, meanwhile ensuring complete coverage of the area.
more »
« less
RESPIRE: Robust Sensor Placement Optimization in Probabilistic Environments
Optimal sensor coverage considers where to place sensors at minimal cost while maximizing coverage. This approach often overlooks the robustness of the entire system. If sensors break down, the application performance might severely be affected. This paper constructs a multi-objective optimization model that considers not only optimal coverage, but also robustness. Our method increases the system robustness by up to 50% compared to a coverage-only approach with 201% higher probability of monitoring the entire environment.
more »
« less
- Award ID(s):
- 1830331
- PAR ID:
- 10216171
- Date Published:
- Journal Name:
- 2020 IEEE SENSORS
- Page Range / eLocation ID:
- 1-4
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Abstract Impact of ice coverage is significant in controlling the depth-averaged velocity profile and influencing morphological processes in alluvial channels. However, this impact is largely unknown under field conditions. In this work, a numerical method is introduced to compute the depth-averaged velocity profile in irregular cross-sections of ice-covered flows, based on the Shiono-Knight approach. The momentum equation is modified to account for the presence of secondary flows and the ice coverage. The equations are discretized and solved with velocity boundary conditions at the bank and at one vertical. Our approach only requires the cross-section geometry and a single velocity measurement near the high-velocity region, offering a significant advantage in inaccessible locations by avoiding the need to measure the velocity profile in the entire cross-section. The proposed model is then validated using depth-averaged velocity profile and secondary flow patterns from laboratory observations, analytical solution, and Large-Eddy Simulation. Finally, the method is applied to infer depth-averaged velocity profiles in the Red River of the North, United States, to test its performance in meandering sections. The proposed method demonstrates its robustness in reconstructing flow profiles in ice-covered conditions with a minimal amount of available data, which is crucial for assessing erosion risks and managing spring floods in cold regions.more » « less
-
Control systems are increasingly targeted by malicious adversaries, who may inject spurious sensor measurements in order to bias the controller behavior and cause suboptimal performance or safety violations. This paper investigates the problem of tracking a reference trajectory while satisfying safety and reachability constraints in the presence of such false data injection attacks. We consider a linear, time-invariant system with additive Gaussian noise in which a subset of sensors can be compromised by an attacker, while the remaining sensors are regarded as secure. We propose a control policy in which two estimates of the system state are maintained, one based on all sensors and one based on only the secure sensors. The optimal control action based on the secure sensors alone is then computed at each time step, and the chosen control action is constrained to lie within a given distance of this value. We show that this policy can be implemented by solving a quadraticallyconstrained quadratic program at each time step. We develop a barrier function approach to choosing the parameters of our scheme in order to provide provable guarantees on safety and reachability, and derive bounds on the probability that our control policies deviate from the optimal policy when no attacker is present. Our framework is validated through numerical study.more » « less
-
null (Ed.)Collaborative sensing of spatio-temporal events/processes is at the basis of many applications including e.g., spectrum and environmental monitoring, and self-driving cars. A system leveraging spatially distributed possibly airborn sensing nodes can in principle deliver better coverage as well as possibly redundant views of the observed processes. This paper focuses on modeling, characterising and quantifying the benefits of optimal sensor activation/scanning policies in resource constrained settings, e.g., constraints tied to energy expenditures or the scanning capabilities of nodes. Under a natural model for the process being observed we show that a periodic sensor activation policy is optimal, and characterize the relative phases of such policies via an optimization problem capturing knowledge of the sensor geometry, sensor coverage sets, and spatio-temporal intensity and event durations. Numerical and simulation results for simple different sensor geometries exhibit how performance depends on the underlying processes. We also study the gap between optimal and randomized policies and how it scales with the density of sensors and resource constraints.more » « less
-
This paper considers the optimal control of a second-order nonlinear system with unknown dynamics. A new reinforcement learning based approach is proposed with the aid of direct adaptive control. By the new approach actor-critic reinforcement learning algorithms are proposed with three neural network approximation. Simulation results are presented to show the effectiveness of the proposed algorithms.more » « less
An official website of the United States government

