Interactive Planning and Sensing for Aircraft in Uncertain Environments with Spatiotemporally Evolving Threats

Autonomous aerial, terrestrial, and marine vehicles provide a platform for several applications including cargo transport, information gathering, surveillance, reconnaissance, and search-and-rescue. To enable such applications, two main technical problems are commonly addressed.On the one hand, the motion-planning problem addresses optimal motion to a destination: an application example is the delivery of a package in the shortest time with least fuel. Solutions to this problem often assume that all relevant information about the environment is available, possibly with some uncertainty. On the other hand, the information gathering problem addresses the maximization of some metric of information about the environment: application examples include such as surveillance and environmental monitoring. Solutions to the motion-planning problem in vehicular autonomy assume that information about the environment is available from three sources: (1) the vehicle’s own onboard sensors, (2) stationary sensor installations (e.g. ground radar stations), and (3) other information gathering vehicles, i.e., mobile sensors, especially with the recent emphasis on collaborative teams of autonomous vehicles with heterogeneous capabilities. Each source typically processes the raw sensor data via estimation algorithms. These estimates are then available to a decision making system such as a motion- planning algorithm. The motion-planner may use some or all of the estimates provided. There is an underlying assumption of “separation� between the motion-planning algorithm and the information about environment. This separation is common in linear feedback control systems, where estimation algorithms are designed independent of control laws, and control laws are designed with the assumption that the estimated state is the true state. In the case of motion-planning, there is no reason to believe that such a separation between the motion-planning algorithm and the sources of estimated environment information will lead to optimal motion plans, even if the motion planner and the estimators are themselves optimal. The goal of this dissertation is to investigate whether the removal of this separation, via interactive motion-planning and sensing, can significantly improve the optimality of motion- planning. The major contribution of this work is interactive planning and sensing. We consider the problem of planning the path of a vehicle, which we refer to as the actor, to traverse a threat field with minimum threat exposure. The threat field is an unknown, time- variant, and strictly positive scalar field defined on a compact 2D spatial domain – the actor’s workspace. The threat field is estimated by a network of mobile sensors that can measure the threat field pointwise. All measurements are noisy. The objective is to determine a path for the actor to reach a desired goal with minimum risk, which is a measure sensitive not only to the threat exposure itself, but also to the uncertainty therein. A novelty of this problem setup is that the actor can communicate with the sensor network and request that the sensors position themselves in a procedure we call sensor reconfiguration such that the actor’s risk is minimized. This work continues with a foundation in motion planning in time-varying fields where waiting is a control input. Waiting is examined in the context of finding an optimal path with considerations for the cost of exposure to a threat field, the cost of movement, and the cost of waiting. For example, an application where waiting may be beneficial in motion-planning is the delivery of a package where adverse weather may pose a risk to the safety of a UAV and its cargo. In such scenarios, an optimal plan may include “waiting until the storm passes.� Results on computational efficiency and optimality of considering waiting in path- planning algorithms are presented. In addition, the relationship of waiting in a time- varying field represented with varying levels of resolution, or multiresolution is studied. Interactive planning and sensing is further developed for the case of time-varying environments. This proposed extension allows for the evaluation of different mission windows, finite sensor network reconfiguration durations, finite planning durations, and varying number of available sensors. Finally, the proposed method considers the effect of waiting in the path planner under the interactive planning and sensing for time-varying fields framework. Future work considers various extensions of the proposed interactive planning and sensing framework including: generalizing the environment using Gaussian processes, sensor reconfiguration costs, multiresolution implementations, nonlinear parameters, decentralized sensor networks and an application to aerial payload delivery by parafoil

Communication-Aware Map Compression for Online Path-Planning

This paper addresses the problem of the communication of optimally compressed information for mobile robot path-planning. In this context, mobile robots compress their current local maps to assist another robot in reaching a target in an unknown environment. We propose a framework that sequentially selects the optimal compression, guided by the robot's path, by balancing the map resolution and communication cost. Our approach is tractable in close-to-real scenarios and does not necessitate prior environment knowledge. We design a novel decoder that leverages compressed information to estimate the unknown environment via convex optimization with linear constraints and an encoder that utilizes the decoder to select the optimal compression. Numerical simulations are conducted in a large close-to-real map and a maze map and compared with two alternative approaches. The results confirm the effectiveness of our framework in assisting the robot reach its target by reducing transmitted information, on average, by approximately 50% while maintaining satisfactory performance

Probabilistic and Distributed Control of a Large-Scale Swarm of Autonomous Agents

We present a novel method for guiding a large-scale swarm of autonomous agents into a desired formation shape in a distributed and scalable manner. Our Probabilistic Swarm Guidance using Inhomogeneous Markov Chains (PSG-IMC) algorithm adopts an Eulerian framework, where the physical space is partitioned into bins and the swarm's density distribution over each bin is controlled. Each agent determines its bin transition probabilities using a time-inhomogeneous Markov chain. These time-varying Markov matrices are constructed by each agent in real-time using the feedback from the current swarm distribution, which is estimated in a distributed manner. The PSG-IMC algorithm minimizes the expected cost of the transitions per time instant, required to achieve and maintain the desired formation shape, even when agents are added to or removed from the swarm. The algorithm scales well with a large number of agents and complex formation shapes, and can also be adapted for area exploration applications. We demonstrate the effectiveness of this proposed swarm guidance algorithm by using results of numerical simulations and hardware experiments with multiple quadrotors.Comment: Submitted to IEEE Transactions on Robotic

A generalized laser simulator algorithm for optimal path planning in constraints environment

Path planning plays a vital role in autonomous mobile robot navigation, and it has thus become one of the most studied areas in robotics. Path planning refers to a robot's search for a collision-free and optimal path from a start point to a predefined goal position in a given environment. This research focuses on developing a novel path planning algorithm, called Generalized Laser Simulator (GLS), to solve the path planning problem of mobile robots in a constrained environment. This approach allows finding the path for a mobile robot while avoiding obstacles, searching for a goal, considering some constraints and finding an optimal path during the robot movement in both known and unknown environments. The feasible path is determined between the start and goal positions by generating a wave of points in all directions towards the goal point with adhering to constraints. A simulation study employing the proposed approach is applied to the grid map settings to determine a collision-free path from the start to goal positions. First, the grid mapping of the robot's workspace environment is constructed, and then the borders of the workspace environment are detected based on the new proposed function. This function guides the robot to move toward the desired goal. Two concepts have been implemented to find the best candidate point to move next: minimum distance to goal and maximum index distance to the boundary, integrated by negative probability to sort out the most preferred point for the robot trajectory determination. In order to construct an optimal collision-free path, an optimization step was included to find out the minimum distance within the candidate points that have been determined by GLS while adhering to particular constraint's rules and avoiding obstacles. The proposed algorithm will switch its working pattern based on the goal minimum and boundary maximum index distances. For static obstacle avoidance, the boundaries of the obstacle(s) are considered borders of the environment. However, the algorithm detects obstacles as a new border in dynamic obstacles once it occurs in front of the GLS waves. The proposed method has been tested in several test environments with different degrees of complexity. Twenty different arbitrary environments are categorized into four: Simple, complex, narrow, and maze, with five test environments in each. The results demonstrated that the proposed method could generate an optimal collision-free path. Moreover, the proposed algorithm result are compared to some common algorithms such as the A* algorithm, Probabilistic Road Map, RRT, Bi-directional RRT, and Laser Simulator algorithm to demonstrate its effectiveness. The suggested algorithm outperforms the competition in terms of improving path cost, smoothness, and search time. A statistical test was used to demonstrate the efficiency of the proposed algorithm over the compared methods. The GLS is 7.8 and 5.5 times faster than A* and LS, respectively, generating a path 1.2 and 1.5 times shorter than A* and LS. The mean value of the path cost achieved by the proposed approach is 4% and 15% lower than PRM and RRT, respectively. The mean path cost generated by the LS algorithm, on the other hand, is 14% higher than that generated by the PRM. Finally, to verify the performance of the developed method for generating a collision-free path, experimental studies were carried out using an existing WMR platform in labs and roads. The experimental work investigates complete autonomous WMR path planning in the lab and road environments using live video streaming. The local maps were built using data from live video streaming s by real-time image processing to detect the segments of the lab and road environments. The image processing includes several operations to apply GLS on the prepared local map. The proposed algorithm generates the path within the prepared local map to find the path between start-to-goal positions to avoid obstacles and adhere to constraints. The experimental test shows that the proposed method can generate the shortest path and best smooth trajectory from start to goal points in comparison with the laser simulator

3D multiresolution statistical approaches for accelerated medical image and volume segmentation

This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.Medical volume segmentation got the attraction of many researchers; therefore, many techniques have been implemented in terms of medical imaging including segmentations and other imaging processes. This research focuses on an implementation of segmentation system which uses several techniques together or on their own to segment medical volumes, the system takes a stack of 2D slices or a full 3D volumes acquired from medical scanners as a data input. Two main approaches have been implemented in this research for segmenting medical volume which are multi-resolution analysis and statistical modeling. Multi-resolution analysis has been mainly employed in this research for extracting the features. Higher dimensions of discontinuity (line or curve singularity) have been extracted in medical images using a modified multi-resolution analysis transforms such as ridgelet and curvelet transforms. The second implemented approach in this thesis is the use of statistical modeling in medical image segmentation; Hidden Markov models have been enhanced here to segment medical slices automatically, accurately, reliably and with lossless results. But the problem with using Markov models here is the computational time which is too long. This has been addressed by using feature reduction techniques which has also been implemented in this thesis. Some feature reduction and dimensionality reduction techniques have been used to accelerate the slowest block in the proposed system. This includes Principle Components Analysis, Gaussian Pyramids and other methods. The feature reduction techniques have been employed efficiently with the 3D volume segmentation techniques such as 3D wavelet and 3D Hidden Markov models. The system has been tested and validated using several procedures starting at a comparison with the predefined results, crossing the specialists’ validations, and ending by validating the system using a survey filled by the end users explaining the techniques and the results. This concludes that Markovian models segmentation results has overcome all other techniques in most patients’ cases. Curvelet transform has been also proved promising segmentation results; the end users rate it better than Markovian models due to the long time required with Hidden Markov models