Dynamic Motion Planning for Aerial Surveillance on a Fixed-Wing UAV

We present an efficient path planning algorithm for an Unmanned Aerial Vehicle surveying a cluttered urban landscape. A special emphasis is on maximizing area surveyed while adhering to constraints of the UAV and partially known and updating environment. A Voronoi bias is introduced in the probabilistic roadmap building phase to identify certain critical milestones for maximal surveillance of the search space. A kinematically feasible but coarse tour connecting these milestones is generated by the global path planner. A local path planner then generates smooth motion primitives between consecutive nodes of the global path based on UAV as a Dubins vehicle and taking into account any impending obstacles. A Markov Decision Process (MDP) models the control policy for the UAV and determines the optimal action to be undertaken for evading the obstacles in the vicinity with minimal deviation from current path. The efficacy of the proposed algorithm is evaluated in an updating simulation environment with dynamic and static obstacles.Comment: Accepted at International Conference on Unmanned Aircraft Systems 201

Static maritime enviroment representation of electronic navigational charts in global path planning

In past years, numerous global path planning methods have been researched and applied in maritime surface navigation. Regardless of intended usage for either decision-support in manned, or autonomous vessel navigation, path planning should generate a safe and efficient route. However, prior to route generation, static maritime environment representation must be created first. Whether it is transformed in to discrete or continuous form, common approach is to use Electronic Navigational Charts (ENCs) as a basis for maritime environment representation. Nevertheless its origins, ENCs still adhere to inherited data generalisations and simplifications to be comprehensible for human navigators. This leads to limitations when considering path planning and spatial resolution at different chart scales. Furthermore, when generating the representation and path, uncertainty must be considered since the quality and accuracy of chart data varies. Although these topics have been addressed separately in their respective domains, their relations have not been researched in detail. The aim of the proposed paper is the review of electronic navigational charts, environment representation and common global path planning approaches’ relations. Forthcoming standards and technologies, such as usage of high-density charts, are presented and discussed as well.Peer Reviewe

Path planning and collision avoidance for autonomous surface vehicles I: a review

Autonomous surface vehicles are gaining increasing attention worldwide due to the potential benefits of improving safety and efficiency. This has raised the interest in developing methods for path planning that can reduce the risk of collisions, groundings, and stranding accidents at sea, as well as costs and time expenditure. In this paper, we review guidance, and more specifically, path planning algorithms of autonomous surface vehicles and their classification. In particular, we highlight vessel autonomy, regulatory framework, guidance, navigation and control components, advances in the industry, and previous reviews in the field. In addition, we analyse the terminology used in the literature and attempt to clarify ambiguities in commonly used terms related to path planning. Finally, we summarise and discuss our findings and highlight the potential need for new regulations for autonomous surface vehicles

Autonomous Navigation for Unmanned Aerial Systems - Visual Perception and Motion Planning

L'abstract è presente nell'allegato / the abstract is in the attachmen

Development of an Integrated Intelligent Multi -Objective Framework for UAV Trajectory Generation

This thesis explores a variety of path planning and trajectory generation schemes intended for small, fixed-wing Unmanned Aerial Vehicles. Throughout this analysis, discrete and pose-based methods are investigated. Pose-based methods are the focus of this research due to their increased flexibility and typically lower computational overhead.;Path planning in 3 dimensions is also performed. The 3D Dubins methodology presented is an extension of a previously suggested approach and addresses both the mathematical formulation of the methodology, as well as an assessment of numerical issues encountered and the solutions implemented for these.;The main contribution of this thesis is a 3-dimensional clothoid trajectory generation algorithm, which produces flyable paths of continuous curvature to ensure a more followable commanded path. This methodology is an extension of the 3D Dubins method and the 2D clothoid method, which have been implemented herein. To ensure flyability of trajectories produced by 3D pose-based trajectory generation methodologies, a set of criteria are specified to limit the possible solutions to only those flyable by the aircraft. Additionally, several assumptions are made concerning the motion of the aircraft in order to simplify the path generation problem.;The 2D and 3D clothoid and Dubins trajectory planners are demonstrated through a trajectory tracking performance comparison between first the 2D Dubins and 2D clothoid methods using a position proportional-integral-derivative controller, then the 3D Dubins and 3D clothoid methods using both a position proportional-integral-derivative controller and an outer-loop non-linear dynamic inversion controller, within the WVU UAV Simulation Environment. These comparisons are demonstrated for both nominal and off-nominal conditions, and show that for both 2D and 3D implementations, the clothoid path planners yields paths with better trajectory tracking performance as compared to the Dubins path planners.;Finally, to increase the effectiveness and autonomy of these pose-based trajectory generation methodologies, an immunity-based evolutionary optimization algorithm is developed to select a viable and locally-optimal trajectory through an environment while observing desired points of interest and minimizing threat exposure, path length, and estimated fuel consumption. The algorithm is effective for both 2D and 3D routes, as well as combinations thereof. A brief demonstration is provided for this algorithm. Due to the calculation time requirements, this algorithm is recommended for offline use