Python Library for simulating unManNed vehiclEs(PLANE) is an open source software module, written in Python, that focuses on Unmanned Aerial Vehicles (UAVs), on their movements and on the mechanics of flight, thus devoting particular attention to the equations that describe drones' movement. In the context of the Internet of Drones (IoD), the module can be widely used for the study of the mutual control of position coordination in scenarios in which drones may find obstacles, as it happens in densely populated urban scenarios. Emphasis is put on ease of use, performance evaluation, documentation, and Application Programming Interface (API) consistency. The software tool has minimal dependencies and is distributed under MIT License. Source code, binaries, and documentation can be downloaded from GitHub.
The work presented in @cite_21 addresses moving targets, with a specific reference to the knowledge of their mobility patterns. This work is based on a pragmatical approach that facilitates the implementation of the proposals in the context of real-time coverage problems it mainly aims at supporting applications based on mobile target tracking. Unfortunately, the work does not propose results for long flight times and or distances.
@cite_21
2049539639 2019094329 2245706161 2774492100
This article addresses the trajectory tracking problem for a wheeled mobile base, considering the presence of disturbances that violate the nonholonomic constraint, and using an approximated discrete-time model for the vehicle. The proposed solution is based on discrete-time sliding mode control, in order to ensure that the controller is both robust and implementable. The asymptotic boundedness of the discrete-time tracking errors is theoretically proved, and experimental results are reported, showing the effectiveness of the proposed control law. © 2002 Wiley Periodicals, Inc. Previous work on the coverage of mobile sensor networks focuses on algorithms to reposition sensors in order to achieve a static configuration with an enlarged covered area. In this paper, we study the dynamic aspects of the coverage of a mobile sensor network that depend on the process of sensor movement. As time goes by, a position is more likely to be covered; targets that might never be detected in a stationary sensor network can now be detected by moving sensors. We characterize the area coverage at specific time instants and during time intervals, as well as the time it takes to detect a randomly located stationary target. Our results show that sensor mobility can be exploited to compensate for the lack of sensors and improve network coverage. For mobile targets, we take a game theoretic approach and derive optimal mobility strategies for sensors and targets from their own perspectives. GPS-enabled devices are now ubiquitous, from airplanes and cars to smartphones and wearable technology. This has resulted in a wealth of data about the movements of individuals and populations, which can be analyzed for useful information to aid in city and traffic planning, disaster preparedness and so on. However, the places that people go can disclose extremely sensitive information about them, and thus their use needs to be filtered through privacy preserving mechanisms. This turns out to be a highly challenging task: raw trajectories are highly detailed, and typically no pair is alike. Previous attempts fail either to provide adequate privacy protection, or to remain sufficiently faithful to the original behavior. This paper presents DPT, a system to synthesize mobility data based on raw GPS trajectories of individuals while ensuring strong privacy protection in the form of e-differential privacy. DPT makes a number of novel modeling and algorithmic contributions including (i) discretization of raw trajectories using hierarchical reference systems (at multiple resolutions) to capture individual movements at differing speeds, (ii) adaptive mechanisms to select a small set of reference systems and construct prefix tree counts privately, and (iii) use of direction-weighted sampling for improved utility. While there have been prior attempts to solve the subproblems required to generate synthetic trajectories, to the best of our knowledge, ours is the first system that provides an end-to-end solution. We show the efficacy of our synthetic trajectory generation system using an extensive empirical evaluation. Mobile wireless sensor networks have been extensively deployed for enhancing environmental monitoring and surveillance. The availability of low-cost mobile robots equipped with a variety of sensors makes them promising in target coverage tasks. They are particularly suitable where quick, inexpensive, or nonlasting visual sensing solutions are required. In this paper, we consider the problem of low complexity target tracking to cover and follow moving targets using flying robots. We tackle this problem by clustering targets while estimating the camera location and orientation for each cluster separately through a cover-set coverage method. We also leverage partial knowledge of target mobility to enhance the efficiency of our proposed algorithms. Three computationally efficient approaches are developed: predictive fuzzy , predictive incremental fuzzy , and local incremental fuzzy . The objective is to find a compromise among coverage efficiency, traveled distance, number of drones required, and complexity. The targets move according to one of the following three possible mobility patterns: random waypoint, Manhattan grid, and reference point group mobility patterns. The feasibility of our algorithms and their performance are also tested on a real-world indoor testbed called drone-be-gone , using Parrot AR.Drone quadcopters. The deployment confirms the results obtained with simulations and highlights the suitability of the proposed solutions for real-time applications.