Coverage path planning is the operation of finding a path that covers all the points of a specific area. Thanks to the recent advances of hardware technology, Unmanned Aerial Vehicles (UAVs) are starting to be used for photogrammetric sensing of large areas in several application domains, such as agriculture, rescuing, and surveillance. However, most of the research focused on finding the optimal path taking only geometrical constraints into account, without considering the peculiar features of the robot, like available energy, weight, maximum speed, sensor resolution, etc. This paper proposes an energy-aware path planning algorithm that minimizes energy consumption while satisfying a set of other requirements, such as coverage and resolution. The algorithm is based on an energy model derived from real measurements. Finally, the proposed approach is validated through a set of experiments.
5 February 2016 in Journal of Intelligent & Robotic Systems
Most UAVs nowadays engage in coverage missions using simple patterns, such as back-and-forth and spiral. However, there is no general agreement about which one is more appropriate. This paper proposes an E-Spiral algorithm for accurate photogrammetry that considers the camera sensor and the flight altitude to apply the overlapping necessary to guarantee the mission success. The algorithm uses an energy model to set different optimal speeds for straight segments of the path, reducing the energy consumption. We also propose an improvement for the energy model to predict the overall energy of the paths. We compare E-Spiral and E-BF algorithms in simulations over more than 3500 polygonal areas with different characteristics, such as vertices, irregularity, and size. Results showed that E-Spiral outperforms E-BF in all the cases, providing an effective energy saving even in the worst scenario with a percentage improvement of 10.37% up to the best case with 16.1% of improvement. Real flights performed with a quadrotor state the effectiveness of the E-Spiral over E-BF in two areas, presenting an improvement of 9% in the time and 7.7% in the energy. The improved energy model increases the time and the energy estimation precision in 13.24% and 13.41%, respectively.
11 February 2019 in Landscape and Ecological Engineering
We present a method for calibration-free, infrastructure-free localization in sensor networks. Our strategy is to estimate node positions and noise distributions of all links in the network simultaneously - a strategy that has not been attempted thus far. In particular, we account for biased, non-line-of-sight (NLOS) range measurements from ultra-wideband (UWB) devices that lead to multi-modal noise distributions, for which few solutions exist to date. Our approach circumvents cumbersome a-priori calibration, allows for rapid deployment in unknown environments, and facilitates adaptation to changing conditions. Our first contribution is a generalization of the classical multidimensional scaling algorithm to account for measurements that have multi-modal error distributions. Our second contribution is an online approach that iterates between node localization and noise parameter estimation. We validate our method in 3-dimensional networks, (i) through simulation to test the sensitivity of the algorithm on its design parameters, and (ii) through physical experimentation in a NLOS environment. Our setup uses UWB devices that provide time-of-flight measurements, which can lead to positively biased distance measurements in NLOS conditions. We show that our algorithm converges to accurate position estimates, even when initial position estimates are very uncertain, initial error models are unknown, and a significant proportion of the network links are in NLOS.
15 April 2020 in IEEE Robotics & Automation Magazine
Autonomous systems operating in uncertain environments under the effects of disturbances and noises can reach unsafe states even while using finetuned controllers and precise sensors and actuators. To provide safety guarantees on such systems during motion planning operations, reachability analysis (RA) has been demonstrated to be a powerful tool. RA, however, suffers from computational complexity, especially when dealing with intricate systems characterized by high-order dynamics, making it hard to deploy for runtime monitoring.