This thesis addresses the improvement of cooperative task allocation to vehicles in multiple-vehicle, multiple-target scenarios through the use of more effective preplanned tours. Effective allocation of vehicles to targets requires knowledge of both the team objectives and the contributions that individual vehicles can make toward accomplishing team goals. This is primarily an issue of individual vehicle path planning --- determining the path the vehicles will follow to accomplish individual and team goals. Conventional methods plan optimal point-to-point path segments that often result in lengthy and suboptimal tours because the trajectory neither considers future tasks nor the overall path. However, cooperation between agents is improved when the team selects vehicle assignments based on the ability to complete immediate and subsequent tasks. This research demonstrates that planning more efficient tour paths through multiple targets results in better use of individual vehicle resources, faster completion of team objectives, and improved overall cooperation between agents. This research presents a method of assigning unmanned aerial vehicles to targets to improve cooperation. A tour path planning method was developed to overcome shortcomings of traditional point-to-point path planners, and is extended to the specific tour-planning needs of this problem. The planner utilizes an on-line learning heuristic search to find paths that accomplish team goals in the shortest flight time. The learning search planner uses the entire sensor footprint, more efficiently plans tours through closely packed targets, and learns the best order for completion of the multiple tasks. The improved planner results in assignment completion times that range on average between 1.67 and 2.41 times faster, depending on target spread. Assignments created from preplanned tours make better use of vehicle resources and improve team cooperation. Path planning and assignment selection are accomplished in near real-time through the use of path heuristics and assignment cost estimates to reduce the problem size to tractable levels. Assignments are ordered according to estimated or predicted value. A reduced number of ordered assignments is considered and evaluated to control problem growth. The estimates adequately represent the actual assignment value, effectively reduce problem size, and produce near-optimal paths and assignments for near-real-time applications.

Unmanned air vehicles (UAVs) have become an important area of research. UAVs are used in many environments which may have previously unknown obstacles or sources of danger. This research addresses the problem of obstacle mapping and path planning while the UAV is in flight. Online obstacle mapping is achieved through the use of a multi-resolution map. As sensor information is received, a quadtree is built up to hold the information based upon the uncertainty associated with the measurement. Once a quadtree map of obstacles is built up, we desire online path re-planning to occur as quickly as possible. We introduce the idea of a quadtree rapidly-exploring random tree (RRT), which will be used as the online path re-planning algorithm. This approach implements a variable sized step instead of the fixed-step size usually used in the RRT algorithm. This variable step uses the structure of the quadtree to determine the step size. The step size grows larger or smaller based upon the size of the area represented by the quadtree it passes through. Finally this approach is tested in a simulation environment. The results show that the quadtree RRT requires fewer steps on average than a standard RRT to find a path through an area. It also has a smaller variance in the number of steps taken by the path planning algorithm in comparison to the standard RRT.

Unmanned vehicle systems, specifically Unmanned Air Vehicles (UAVs) and Unmanned Ground Vehicles (UGVs) have found potential use in both military and civilian applications. For many applications, unmanned vehicle systems are required to navigate in urban environments where obstacles with various types and sizes exist. The main contribution of this research is to offer vision-based path planning, collision avoidance, and target tracking strategies for Unmanned Air and Ground vehicles operating in urban environments. Two vision-based local-level frame mapping and planning techniques are first developed for Miniature Air Vehicles (MAVs). The techniques build maps and plan paths in the local-level frame of MAVs directly using the camera measurements without transforming to the inertial frame. Using a depth map of an environment obtained by computer vision methods, the first technique employs an extended Kalman Filter (EKF) to estimate the range, azimuth to, and height of obstacles, and constructs local spherical maps around MAVs. Based on the maps, the Rapidly-Exploring Random Tree (RRT) algorithm is used to plan collision-free Dubins paths. The second technique constructs local multi-resolution maps using an occupancy grid, which give higher resolution to the areas that are close to MAVs and give lower resolution to the areas that are far away. The maps are built using a log-polar representation. The two planning techniques are demonstrated in simulation and flight tests. Based on the observation that a camera does not provide accurate time-to-collision (TTC) measurements, two and three dimensional observability-based planning algorithms are explored. The techniques estimate both TTC and bearing using bearing-only measurements. A nonlinear observability analysis of state estimation process is conducted to obtain the conditions for complete observability of the system. Using the conditions, the observability-based planning algorithms are designed to minimize the estimation uncertainties while simultaneously avoiding collisions. The two dimensional planning algorithm parameterizes an obstacle using TTC and azimuth, and constructs local polar maps. The three dimensional planning algorithm parameterizes an obstacle using inverse TTC, azimuth, and elevation, and constructs local spherical maps. The algorithms are demonstrated in simulation. Lastly, a probabilistic path planning algorithm is developed for tracking a moving target in urban environments using UAVs and UGVs. The algorithm takes into account occlusions due to obstacles. It models the target using a dynamic occupancy grid and updates the target location using a Bayesian filter. Based on the target's current and probable future locations, a decentralized path planning algorithm is designed to generate suboptimal paths that maximize the sum of the joint probability of detection for all vehicles over a finite look-ahead horizon. Results demonstrate the planning algorithm is successful in solving the moving target tracking problem in urban environments.

Unmanned aircraft systems (UAS) represent the future of modern aviation. Over the past 10 years their use abroad by the military has become commonplace for surveillance and combat. Unfortunately, their use at home has been far more restrictive. Due to safety and regulatory concerns, UAS are prohibited from flying in the National Airspace System without special authorization from the FAA. One main reason for this is the lack of an on-board pilot to "see and avoid" other air traffic and thereby maintain the safety of the skies. Development of a comparable capability, known as "Sense and Avoid" (SAA), has therefore become a major area of focus. This research focuses on the SAA problem as it applies specifically to small UAS. Given the size, weight, and power constraints on these aircraft, current approaches fail to provide a viable option. To aid in the development of a SAA system for small UAS, various simulation and hardware tools are discussed. The modifications to the MAGICC Lab's simulation environment to provide support for multiple agents is outlined. The use of C-MEX s-Functions to improve simulation performance and code portability is also presented. For hardware tests, two RC airframes were constructed and retrofitted with autopilots to allow autonomous flight. The development of a program to interface with the ground control software and run the collision avoidance algorithms is discussed as well. Intruder sensing is accomplished using a low-power, low-resolution radar for detection and an Extended Kalman Filter (EKF) for tracking. The radar provides good measurements for range and closing speed, but bearing measurements are poor due to the low-resolution. A novel method for improving the bearing approximation using the raw radar returns is developed and tested. A four-state EKF used to track the intruder's position and trajectory is derived and used to provide estimates to the collision avoidance planner. Simulation results and results from flight tests using a simulated radar are both presented. To effectively plan collision avoidance paths a tree-branching path planner is developed. Techniques for predicting the intruder position and creating safe, collision-free paths using the estimates provided by the EKF are presented. A method for calculating the cost of flying each path is developed to allow the selection of the best candidate path. As multiple duplicate paths can be created using the branching planner, a strategy to remove these paths and greatly increase computation speed is discussed. Both simulation and hardware results are presented for validation.

When working with a complex AI or robotics system in a specific application, users often need to incorporate their special domain knowledge into the autonomous system. Such needs call for the ability to manage autonomy. However, managing autonomy can be a difficult task because the internal mechanisms and algorithms of the autonomous components may be beyond the users' understanding. We propose an approach where users manage autonomy indirectly by managing information provided to the intelligent system hierarchically at three different temporal scales: strategic, between-episodes, and within-episode. Information management tools at multiple temporal scales allow users to influence the autonomous behaviors of the system without the need for tedious direct/manual control. Information fed to the system can be in the forms of areas of focus, representations of task difficulty, and the amount of autonomy desired. We apply this approach to using an Unmanned Aerial Vehicle (UAV) to support Wilderness Search and Rescue (WiSAR). This dissertation presents autonomous algorithms/components and autonomy management tools/interfaces we designed at different temporal scales, and provides evidence that the approach improves the performance of the human-robot team and the experience of the human partner.

No description available.

Currently, robotics is a discipline that is present, and it is becoming more important in daily life and different areas. Moreover, the research in this field is making improvements on the tasks that robots can perform, making it possible to appear in disciplines that have typically been made by humans, such as Art. In this project, it has been developed and implemented a program that allows the creation of paths after processing a picture, and the control of a real robot to follow the generated paths, in this case, the objective is to perform a sketch from a given picture. Nevertheless, it is applicable in many areas that need this kind of application like processing images, identification of trajectories, and path following. Moreover, in this project, it has been developed to simulate in a virtual environment the path planning and all the features of the real robot, which suppose that the user can check trajectories before trying on the real world, avoid problems of collisions or work without needing the physical robot. For that reason, the objective of this project is to contribute to the development of robotics and create a base that could be used in future research or as a source of information for similar projects that will be performed in the future.

Virtual visualization of mobile robot analytical trajectories while avoiding moving obstacles is presented in this thesis as a very helpful technique to properly display and communicate simulation results. Analytical solutions to the path planning problem of mobile robots in the presence of obstacles and a dynamically changing environment have been presented in the current robotics and controls literature. These techniques have been demonstrated using two-dimensional graphical representation of simulation results. In this thesis, the analytical solution published by Dr. Zhihua Qu in December 2004 is used and simulated using a virtual visualization tool called VRML.

Many real-world electrical and mechanical systems have velocity-dependent constraints in their dynamic models. For example, car-like robots, unmanned aerial vehicles, autonomous underwater vehicles and hopping robots, etc. Most of these systems can be transformed into a chained form, which is considered as a canonical form of these nonholonomic systems. Hence, study of chained systems ensure their wide applicability. This thesis studied the problem of continuous feed-back control of the chained systems while pursuing inverse optimality and exponential convergence rates, as well as the feed-back stabilization problem under input saturation constraints. These studies are based on global singularity-free state transformations and controls are synthesized from resulting linear systems. Then, the application of optimal motion planning and dynamic tracking control of nonholonomic autonomous underwater vehicles is considered. The obtained trajectories satisfy the boundary conditions and the vehicles' kinematic model, hence it is smooth and feasible. A collision avoidance criteria is set up to handle the dynamic environments. The resulting controls are in closed forms and suitable for real-time implementations. Further, dynamic tracking controls are developed through the Lyapunov second method and back-stepping technique based on a NPS AUV II model. In what follows, the application of cooperative surveillance and formation control of a group of nonholonomic robots is investigated. A designing scheme is proposed to achieves a rigid formation along a circular trajectory or any arbitrary trajectories. The controllers are decentralized and are able to avoid internal and external collisions. Computer simulations are provided to verify the effectiveness of these designs.

The present study focuses on developing an efficient and stable unmanned aerial system traffic management (UTM) system that utilizes a data-driven target tracking method and a distributed path planning algorithm for multiple Unmanned Aerial Vehicle (UAV) operations with local dynamic networks, which can provide flexible scalability, enabling autonomous operation of a large number of UAVs in dynamically changing environment. Traditional dynamic motion-based target tracking methods often encounter limitations due to their reliance on a finite number of dynamic motion models. To address this, data-driven target tracking methods were developed based on the statistical model of the Gaussian mixture model (GMM) and deep neural networks of long-short term memory (LSTM) model, to estimate instant and future states of UAV for local path planning problems. The estimation accuracy of the data-driven target tracking methods were analyzed and compared with dynamic model-based target tracking methods. A hybrid dynamic path planning algorithm was proposed, which selectively employs grid-free and -based path search methods depending on the spatio-temporal characteristics of the environments. In static environment, the artificial potential field (APF) method was utilized, while the $A^*$ algorithm was applied in the dynamic state environment. Furthermore, the data-driven target tracking method was integrated with the hybrid path planning algorithm to enhance deconfliction. To ensure smooth trajectories, a minimum snap trajectory method was applied to the planned paths, enabling controller tracking that remains dynamically feasible throughout the entire operation of UAVs. The methods were validated in the Software-in-the-loop (SITL) demonstration with the simple PID controller of the UAVs implemented in the software program. / Ph.D. / This dissertation focuses on developing data-driven models for tracking and path planning of Unmanned Aerial Vehicle (UAV) in dynamic environments with multiple operations. The goal is to improve the accuracy and efficiency of Unmanned Aircraft System traffic management (UTM) under such conditions. The data-driven models are based on Gaussian mixture model (GMM) and long-short term memory (LSTM) and are used to estimate the instant and consecutive future states of UAV for local planning problems. These models are compared to traditional target tracking models, which use dynamic motion models like constant velocity or acceleration. A hybrid dynamic path planning approach is also proposed to solve dynamic path planning problems for multiple UAV operations at an efficient computation cost. The algorithm selectively employs a path planning method between grid-free and grid-based methods depending on the characteristics of the environment. In static state conditions, the system uses the artificial potential field method (APF). When the environment is time-variant, local path planning problems are solved by activating the $A^*$ algorithm. Also, the planned paths are refined by minimum snap trajectory to ensure that the path is dynamically feasible throughout a full operation of the UAV along with controller tracking. The methods were validated in the Software-in-the-loop (SITL) demonstration with the simple PID controller of the UAVs implemented in the software program.