Neural Network Approach for Obstacle Avoidance in 3-D Environments for UAVs

In this paper a controller design is proposed to get obstacle free trajectories in a three dimensional urban environment for unmanned air vehicles (UAVs). The controller has a two-layer architecture. In the upper layer, vision-inspired Grossberg neural network is proposed to get the shortest distance paths. In the bottom layer, a model predictive control (MPC) based controller is used to obtain dynamically feasible trajectories. Simulation results are presented for to demonstrate the potential of the approach

Cooperative UAV Formation Flying with Obstacle/Collision Avoidance

Navigation problems of unmanned air vehicles (UAVs) flying in a formation in a free and an obstacle-laden environment are investigated in this brief. when static obstacles popup during the flight, the UAVs are required to steer around them and also avoid collisions between each other. In order to achieve these goals, a new dual-mode control strategy is proposed: a “safe mode” is defined as an operation in an obstacle-free environment and a “danger mode” is activated when there is a chance of collision or when there are obstacles in the path. Safe mode achieves global optimization because the dynamics of all the UAVs participating in the formation are taken into account in the controller formulation. In the danger mode, a novel algorithm using a modified Grossberg neural network (GNN) is proposed for obstacle/collision avoidance. This decentralized algorithm in 2-D uses the geometry of the flight space to generate optimal/suboptimal trajectories. Extension of the proposed scheme for obstacle avoidance in a 3-D environment is shown. In order to handle practical vehicle constraints, a model predictive control-based tracking controller is used to track the references generated. Numerical results are provided to motivate this approach and to demonstrate its potential

Geometric-based Optimization Algorithms for Cable Routing and Branching in Cluttered Environments

The need for designing lighter and more compact systems often leaves limited space for planning routes for the connectors that enable interactions among the system’s components. Finding optimal routes for these connectors in a densely populated environment left behind at the detail design stage has been a challenging problem for decades. A variety of deterministic as well as heuristic methods has been developed to address different instances of this problem. While the focus of the deterministic methods is primarily on the optimality of the final solution, the heuristics offer acceptable solutions, especially for such problems, in a reasonable amount of time without guaranteeing to find optimal solutions. This study is an attempt to furthering the efforts in deterministic optimization methods to tackle the routing problem in two and three dimensions by focusing on the optimality of final solutions. The objective of this research is twofold. First, a mathematical framework is proposed for the optimization of the layout of wiring connectors in planar cluttered environments. The problem looks at finding the optimal tree network that spans multiple components to be connected with the aim of minimizing the overall length of the connectors while maximizing their common length (for maintainability and traceability of connectors). The optimization problem is formulated as a bi-objective problem and two solution methods are proposed: (1) to solve for the optimal locations of a known number of breakouts (where the connectors branch out) using mixed-binary optimization and visibility notion and (2) to find the minimum length tree that spans multiple components of the system and generates the optimal layout using the previously-developed convex hull based routing. The computational performance of these methods in solving a variety of problems is further evaluated. Second, the problem of finding the shortest route connecting two given nodes in a 3D cluttered environment is considered and addressed through deterministically generating a graphical representation of the collision-free space and searching for the shortest path on the found graph. The method is tested on sample workspaces with scattered convex polyhedra and its computational performance is evaluated. The work demonstrates the NP-hardness aspect of the problem which becomes quickly intractable as added components or increase in facets are considered

Robust trajectory planning for unmanned aerial vehicles in uncertain environments

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2008.Includes bibliographical references (leaves 145-153).As unmanned aerial vehicles (UAVs) take on more prominent roles in aerial missions, it becomes necessary to increase the level of autonomy available to them within the mission planner. In order to complete realistic mission scenarios, the UAV must be capable of operating within a complex environment, which may include obstacles and other no-fly zones. Additionally, the UAV must be able to overcome environmental uncertainties such as modeling errors, external disturbances, and an incomplete situational awareness. By utilizing planners which can autonomously navigate within such environments, the cost-effectiveness of UAV missions can be dramatically improved.This thesis develops a UAV trajectory planner to efficiently identify and execute trajectories which are robust to a complex, uncertain environment. This planner, named Efficient RSBK, integrates previous mixed-integer linear programming (MILP) path planning algorithms with several implementation innovations to achieve provably robust on-line trajectory optimization. Using the proposed innovations, the planner is able to design intelligent long-term plans using a minimal number of decision variables. The effectiveness of this planner is demonstrated with both simulation results and flight experiments on a quadrotor testbed.Two major components of the Efficient RSBK framework are the robust model predictive control (RMPC) scheme and the low-level planner. This thesis develops a generalized framework to investigate RMPC affine feedback policies on the disturbance, identify relative strengths and weaknesses, and assess suitability for the UAV trajectory planning problem. A simple example demonstrates that even with a conventional problem setup, the closed-loop performance may not always improve with additional decision variables, despite the resulting increase in computational complexity. A compatible low-level troller is also introduced which significantly improves trajectory-following accuracy, as demonstrated by additional flight experiments.by Brandon Luders.S.M

A Decomposition Strategy for Optimal Coverage of an Area of Interest using Heterogeneous Team of UAVs

In this thesis, we study the problem of optimal search and coverage with heterogeneous team of unmanned aerial vehicles (UAVs). The team must complete the coverage of a given region while minimizing the required time and fuel for performing the mission. Since the UAVs have different characteristics one needs to equalize the ratio of the task to the capabilities of each agent to obtain an optimal solution. A multi-objective task assignment framework is developed for finding the best group of agents that by assigning the optimal tasks would carry out the mission with minimum total cost. Once the optimal tasks for UAVs are obtained, the coverage area (map) is partitioned according to the results of the multi-objective task assignment. The strategy is to partition the coverage area into separate regions so that each agent is responsible for performing the surveillance of its particular region. The decentralized power diagram algorithm is used to partition the map according to the results of the task assignment phase. Furthermore, a framework for solving the task assignment problem and the coverage area partitioning problem in parallel is proposed. A criterion for achieving the minimum number of turns in covering a region a with single UAV is studied for choosing the proper path direction for each UAV. This criterion is extended to develop a method for partitioning the coverage area among multiple UAVs that minimizes the number of turns. We determine the "best" team for performing the coverage mission and we find the optimal workload for each agent that is involved in the mission through a multi-objective optimization procedure. The search area is then partitioned into disjoint subregions, and each agent is assigned to a region having an optimum area resulting in the minimum cost for the entire surveillance mission

Trajectory planning for unmanned vehicles using robust receding horizon control

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2007.Includes bibliographical references (p. 211-223).This thesis presents several trajectory optimization algorithms for a team of cooperating unmanned vehicles operating in an uncertain and dynamic environment. The first, designed for a single vehicle, is the Robust Safe But Knowledgeable (RSBK) algorithm, which combines several previously published approaches to recover the main advantages of each. This includes a sophisticated cost-to-go function that provides a good estimate of the path beyond the planning horizon, which is extended in this thesis to account for three dimensional motion; constraint tightening to ensure robustness to disturbances, which is extended to a more general class of disturbance rejection controllers compared to the previous work, with a new off-line design procedure; and a robust invariant set which ensures the safety of the vehicle in the event of environmental changes beyond the planning horizon. The system controlled by RSBK is proven to robustly satisfy all vehicle and environmental constraint under the action of bounded external disturbances. Multi-vehicle teams could also be controlled using centralized RSBK, but to reduce computational effort, several distributed algorithms are presented in this thesis. The main challenge in distributing the planning is to capture the complex couplings between vehicles.(cont.) A decentralized form of RSBK algorithm is developed by having each vehicle optimize over its own decision variables and then locally communicate the solutions to its neighbors. By integrating a grouping algorithm, this approach enables simultaneous computation by vehicles in the team while guaranteeing the robust feasibility of the entire fleet. The use of a short planning horizon within RSBK enables the use of a very simple initialization algorithm when compared to previous work, which is essential if the technique is to be used in dynamic and uncertain environments. Improving the level of cooperation between the vehicles is another challenge for decentralized planning, but this thesis presents a unique strategy by enabling each vehicle to optimize its own decision as well as a feasible perturbation of its neighboring vehicles' plans. The resulting cooperative form of the distributed RSBK is shown to result in solutions that sacrifice local performance if it benefits the overall team performance. This desirable performance improvement is achieved with only a small increase in the computation and communication requirements. These algorithms are tested and demonstrated in simulation and on two multi-vehicle testbeds using rovers and quadrotors.(cont.) The experimental results demonstrate that the proposed algorithms successfully overcome the implementation challenges, such as limited onboard computation and communication resources, as well as the various sources of real-world uncertainties arising from modeling error of the vehicle dynamics, tracking error of the low-level controller, external disturbance, and sensing noise.by Yoshiaki Kuwata.Ph.D

A study of mobile robot motion planning

This thesis studies motion planning for mobile robots in various environments. The basic tools for the research are the configuration space and the visibility graph. A new approach is developed which generates a smoothed minimum time path. The difference between this and the Minimum Time Path at Visibility Node (MTPVN) is that there is more clearance between the robot and the obstacles, and so it is safer. The accessibility graph plays an important role in motion planning for a massless mobile robot in dynamic environments. It can generate a minimum time motion in 0(n2»log(n)) computation time, where n is the number of vertices of all the polygonal obstacles. If the robot is not considered to be massless (that is, it requires time to accelerate), the space time approach becomes a 3D problem which requires exponential time and memory. A new approach is presented here based on the improved accessibility polygon and improved accessibility graph, which generates a minimum time motion for a mobile robot with mass in O((n+k)2»log(n+k)) time, where n is the number of vertices of the obstacles and k is the number of obstacles. Since k is much less than n, so the computation time for this approach is almost the same as the accessibility graph approach. The accessibility graph approach is extended to solve motion planning for robots in three dimensional environments. The three dimensional accessibility graph is constructed based on the concept of the accessibility polyhedron. Based on the properties of minimum time motion, an approach is proposed to search the three dimensional accessibility graph to generate the minimum time motion. Motion planning in binary image representation environment is also studied. Fuzzy logic based digital image processing has been studied. The concept of Fuzzy Principal Index Of Area Coverage (PIOAC) is proposed to recognise and match objects in consecutive images. Experiments show that PIOAC is useful in recognising objects. The visibility graph of a binary image representation environment is very inefficient, so the approach usually used to plan the motion for such an environment is the quadtree approach. In this research, polygonizing an obstacle is proposed. The approaches developed for various environments can be used to solve the motion planning problem without any modification. A simulation system is designed to simulate the approaches