117 research outputs found

    Path Planning and Real-Time Collision Avoidance Based on the Essential Visibility Graph

    Get PDF
    This paper deals with a novel procedure to generate optimum flight paths for multiple unmanned aircraft in the presence of obstacles and/or no-fly zones. A real-time collision avoidance algorithm solving the optimization problem as a minimum cost piecewise linear path search within the so-called Essential Visibility Graph (EVG) is first developed. Then, a re-planning procedure updating the EVG over a selected prediction time interval is proposed, accounting for the presence of multiple flying vehicles or movable obstacles. The use of Dubins curves allows obtaining smooth paths, compliant with flight mechanics constraints. In view of possible future applications in hybrid scenarios where both manned and unmanned aircraft share the airspace, visual flight rules compliant with International Civil Aviation Organization (ICAO) Annex II Right of Way were implemented. An extensive campaign of numerical simulations was carried out to test the effectiveness of the proposed technique by setting different operational scenarios of increasing complexity. Results show that the algorithm is always able to identify trajectories compliant with ICAO rules for avoiding collisions and assuring a minimum safety distance as well. Furthermore, the low computational burden suggests that the proposed procedure can be considered a promising approach for real-time applications

    Robust Distributed Formation Control of UAVs with Higher-Order Dynamics

    Get PDF
    In this thesis, we introduce distributed formation control strategies to reach an intended linear formation for agents with a diverse array of dynamics. The suggested technique is distributed entirely, does not include inter-agent cooperation or a barrier of orientation, and can be applied using relative location information gained by agents in their local cooperation frames. We illustrate how the control optimized for agents with the simpler dynamic model, i.e., the dynamics of the single integrator, can be expanded to holonomic agents with higher dynamics such as quadrotors and non-holonomic agents such as unicycles and cars. Our suggested approach makes feedback saturations, unmodelled dynamics, and switches stable in the sensing topology. We also indicate that the control is relaxed as agents will travel along with a rotated and scaled control direction without disrupting the convergence to the desired formation. We can implement this observation to design a distributed strategy for preventing collisions. In simulations, we explain the suggested solution and further introduce a distributed robotic framework to experimentally validate the technique. Our experimental platform is made up of off-the-shelf devices that can be used to evaluate other multi-agent algorithms and verify them

    Visibility maintenance via controlled invariance for leader-follower Dubins-like vehicles

    Full text link
    The paper studies the visibility maintenance problem (VMP) for a leader-follower pair of Dubins-like vehicles with input constraints, and proposes an original solution based on the notion of controlled invariance. The nonlinear model describing the relative dynamics of the vehicles is interpreted as linear uncertain system, with the leader robot acting as an external disturbance. The VMP is then reformulated as a linear constrained regulation problem with additive disturbances (DLCRP). Positive D-invariance conditions for linear uncertain systems with parametric disturbance matrix are introduced and used to solve the VMP when box bounds on the state, control input and disturbance are considered. The proposed design procedure is shown to be easily adaptable to more general working scenarios. Extensive simulation results are provided to illustrate the theory and show the effectiveness of our approachComment: 17 pages, 24 figures, extended version of the journal paper of the authors submitted to Automatic

    Evolutionary coordination system for fixed-wing communications unmanned aerial vehicles

    Get PDF
    A system to coordinate the movement of a group of un- manned aerial vehicles that provide a network backbone over mobile ground-based vehicles with communication needs is presented. Using evo- lutionary algorithms, the system evolves flying manoeuvres that position the aerial vehicles by fulfilling two key requirements; i) they maximise net coverage and ii) they minimise the power consumption. Experimental results show that the proposed coordination system is able to offer a de- sirable level of adaptability with respect to the objectives set, providing useful feedback for future research directions

    Unmanned Aerial Vehicle (UAV) mission planning based on Fast Marching Square (FM²) planner and Differential Evolution (DE)

    Get PDF
    Nowadays, mission planning for Unmanned Aerial Vehicles (UAVs) is a very attractive research field. UAVs have been a research focus for many purposes. In military and civil fields, the UAVs are very used for different missions. Many of these studies require a path planning to perform autonomous flights. Several problems related to the physical limitations of the UAV arise when the planning is carried out, as well as the maintenance of a fixed flight level with respect to the ground to capture videos or overlying images. This work presents an approach to plan missions for UAVs keeping a fixed flight level constraint. An approach is proposed to solve these problems and to generate effective paths in terms of smoothness and safety distance in two different types of environments: 1) 3D urban environments and 2) open field with non-uniform terrain environments. Many proposed activities to be carried out by UAVs in whatever the environment require a control over the altitude for different purposes: energy saving and minimization of costs are some of these objectives. In general terms, the planning is required to avoid all obstacles encountered in the environment and to maintain a fixed flight level during the path execution. For this reason, a mission planning requires robust planning methods. The method used in this work as planner is the Fast Marching Square (FM2) method, which generates a path free of obstacles. As a novelty, the method proposed includes two adjustment parameters. Depending on the values of these parameters, the restriction of flight level can be modified, as well as the smoothness and safety margins from the obstacles of the generated paths. The Dubins airplane model is used to check if the path resulting from the FM2 is feasible according to the constraints of the UAV: its turning rate, climb rate and cruise speed. Besides, this research also presents a novel approach for missions of Coverage Path Planning (CPP) carried out by UAVs in 3D environments. These missions are focused on path planning to cover a certain area in an environment in order to carry out tracking, search or rescue tasks. The methodology followed uses an optimization process based on the Differential Evolution (DE) algorithm in combination with the FM2 planner. Finally, the UAVs formation problem is introduced and addressed in a first stage using the planner proposed in this thesis. A wide variety of simulated experiments have been carried out to illustrate the efficiency and robustness of the approaches presented, obtaining successful results in different urban and open field 3D environments.Hoy en día la planificación de misiones para vehículos aéreos no tripulados (UAV) es un campo de investigación muy atractivo. Los UAV son foco de investigación en numerosas aplicaciones, tanto en el campo civil como militar. Muchas de estas aplicaciones requieren de un sistema de planificación de ruta que permita realizar vuelos autónomos y afrontar problemas relacionados con las limitaciones físicas del UAV y con requerimientos como el nivel de vuelo sobre el suelo para, entre otras funciones, poder capturar videos o imágenes. Este trabajo presenta una propuesta de planificador para vehículos aéreos no tripulados que permite resolver los problemas citados previamente, incluyendo en la planificación las consideraciones cinemáticas del UAV y las restricciones de nivel de vuelo, generando rutas suaves, realizables y suficientemente seguras para dos tipos diferentes de entornos 3D: 1) entornos urbanos y 2) campos abiertos con terrenos no uniformes. El método utilizado en esta tesis como base para la planificación es el método Fast Marching Square (FM2), que genera un camino libre de obstáculos. Como novedad, el método propuesto incluye dos parámetros de ajuste. Dependiendo de los valores de estos parámetros, se puede modificar la restricción de nivel de vuelo, así como la suavidad y los márgenes de seguridad respecto a los obstáculos de las rutas generadas. El modelo cinemático de Dubins se utiliza para verificar si la ruta resultante de nuestro planificador es realizable de acuerdo con las restricciones del UAV: su velocidad de giro, velocidad de ascenso y velocidad de crucero. Además, esta tesis también presenta una propuesta novedosa para la planificación de misiones de Coverage Path Planning (CPP) en entornos 3D. Estas misiones se centran en la planificación de rutas para cubrir un área determinada de un entorno con el fin de llevar a cabo tareas de rastreo, búsqueda o rescate. La metodología seguida utiliza un proceso de optimización basado en el algoritmo Differential Evolution (DE) en combinación con nuestro planificador FM2. Como parte final de la tesis, el problema de formación de UAVs se introduce y aborda en una primera etapa utilizando el planificador FM2 propuesto.Programa Oficial de Doctorado en Ingeniería Eléctrica, Electrónica y AutomáticaPresidente: Antonio Giménez Fernández.- Secretario: Luis Santiago Garrido Bullón.- Vocal: Raúl Suárez Feijó

    Design of an UAV swarm

    Get PDF
    This master thesis tries to give an overview on the general aspects involved in the design of an UAV swarm. UAV swarms are continuoulsy gaining popularity amongst researchers and UAV manufacturers, since they allow greater success rates in task accomplishing with reduced times. Appart from this, multiple UAVs cooperating between them opens a new field of missions that can only be carried in this way. All the topics explained within this master thesis will explain all the agents involved in the design of an UAV swarm, from the communication protocols between them, navigation and trajectory analysis and task allocation

    Surveillance Using Multiple Unmanned Aerial Vehicles

    Get PDF
    This study examines the performance and limitations of a heuristic cooperative control (CC) surveillance algorithm for multiple unmanned aerial vehicles (UAVs) under both simulation and demonstration. The algorithm generates Dubin\u27s based paths and provides velocity feedback to accomplish simultaneous arrival onto a surveillance orbit around the target and maintains position while orbiting. The CC algorithm has two modes: one that generates commands to multiple UAVs for simultaneous arrival to a surveillance orbit, and one that maintains equal angular spacing about the orbit. In addition to positional performance metrics, percentage of target in-view time was also measured based on the UAV\u27s side camera field of view (FOV). Simulation tested both modes under wind conditions of 0%, 10%, 25%, and 50% of the nominal airspeed (Vnom). Results showed that the algorithm maintained UAV position with winds 25% of Vnom, but instabilities appeared at 50% where large overshoots appeared on the downwind side of the orbit. Target visibility was most impacted by crosstrack errors that steadily grew with increasing winds. Roll of the UAV showed the greatest impact on the FOV due to its coupling effect with crosstrack error. Overall target in-view time also improved with increasing numbers of UAVs for all wind conditions

    Path Planning For Persistent Surveillance Applications Using Fixed-Wing Unmanned Aerial Vehicles

    Get PDF
    This thesis addresses coordinated path planning for fixed-wing Unmanned Aerial Vehicles (UAVs) engaged in persistent surveillance missions. While uniquely suited to this mission, fixed wing vehicles have maneuver constraints that can limit their performance in this role. Current technology vehicles are capable of long duration flight with a minimal acoustic footprint while carrying an array of cameras and sensors. Both military tactical and civilian safety applications can benefit from this technology. We make three main contributions: C1 A sequential path planner that generates a C2 flight plan to persistently acquire a covering set of data over a user designated area of interest. The planner features the following innovations: • A path length abstraction that embeds kino-dynamic motion constraints to estimate feasible path length • A Traveling Salesman-type planner to generate a covering set route based on the path length abstraction • A smooth path generator that provides C2 routes that satisfy user specified curvature constraints C2 A set of algorithms to coordinate multiple UAVs, including mission commencement from arbitrary locations to the start of a coordinated mission and de-confliction of paths to avoid collisions with other vehicles and fixed obstacles iv C3 A numerically robust toolbox of spline-based algorithms tailored for vehicle routing validated through flight test experiments on multiple platforms. A variety of tests and platforms are discussed. The algorithms presented are based on a technical approach with approximately equal emphasis on analysis, computation, dynamic simulation, and flight test experimentation. Our planner (C1) directly takes into account vehicle maneuverability and agility constraints that could otherwise render simple solutions infeasible. This is especially important when surveillance objectives elevate the importance of optimized paths. Researchers have devel oped a diverse range of solutions for persistent surveillance applications but few directly address dynamic maneuver constraints. The key feature of C1 is a two stage sequential solution that discretizes the problem so that graph search techniques can be combined with parametric polynomial curve generation. A method to abstract the kino-dynamics of the aerial platforms is then presented so that a graph search solution can be adapted for this application. An A* Traveling Salesman Problem (TSP) algorithm is developed to search the discretized space using the abstract distance metric to acquire more data or avoid obstacles. Results of the graph search are then transcribed into smooth paths based on vehicle maneuver constraints. A complete solution for a single vehicle periodic tour of the area is developed using the results of the graph search algorithm. To execute the mission, we present a simultaneous arrival algorithm (C2) to coordinate execution by multiple vehicles to satisfy data refresh requirements and to ensure there are no collisions at any of the path intersections. We present a toolbox of spline-based algorithms (C3) to streamline the development of C2 continuous paths with numerical stability. These tools are applied to an aerial persistent surveillance application to illustrate their utility. Comparisons with other parametric poly nomial approaches are highlighted to underscore the benefits of the B-spline framework. Performance limits with respect to feasibility constraints are documented
    corecore