Task scheduling and merging in space and time

Every day, robots are being deployed in more challenging environments, where they are required to perform complex tasks. In order to achieve these tasks, robots rely on intelligent deliberation algorithms. In this thesis, we study two deliberation approaches – task scheduling and task planning. We extend these approaches in order to not only deal with temporal and spatial constraints imposed by the environment, but also exploit them to be more efficient than the state-of-the-art approaches. Our first main contribution is a scheduler that exploits a heuristic based on Allen’s interval algebra to prune the search space to be traversed by a mixed integer program. We empirically show that the proposed scheduler outperforms the state of the art by at least one order of magnitude. Furthermore, the scheduler has been deployed on several mobile robots in long-term autonomy scenarios. Our second main contribution is the POPMERX algorithm, which is based on merging of partially ordered temporal plans. POPMERX first reasons with the spatial and temporal structure of separately generated plans. Then, it merges these plans into a single final plan, while optimising the makespan of the merged plan. We empirically show that POPMERX produces better plans that the-state-ofthe- art planners on temporal domains with time windows

Portfolios in Stochastic Local Search: Efficiently Computing Most Probable Explanations in Bayesian Networks

Portfolio methods support the combination of different algorithms and heuristics, including stochastic local search (SLS) heuristics, and have been identified as a promising approach to solve computationally hard problems. While successful in experiments, theoretical foundations and analytical results for portfolio-based SLS heuristics are less developed. This article aims to improve the understanding of the role of portfolios of heuristics in SLS. We emphasize the problem of computing most probable explanations (MPEs) in Bayesian networks (BNs). Algorithmically, we discuss a portfolio-based SLS algorithm for MPE computation, Stochastic Greedy Search (SGS). SGS supports the integration of different initialization operators (or initialization heuristics) and different search operators (greedy and noisy heuristics), thereby enabling new analytical and experimental results. Analytically, we introduce a novel Markov chain model tailored to portfolio-based SLS algorithms including SGS, thereby enabling us to analytically form expected hitting time results that explain empirical run time results. For a specific BN, we show the benefit of using a homogenous initialization portfolio. To further illustrate the portfolio approach, we consider novel additive search heuristics for handling determinism in the form of zero entries in conditional probability tables in BNs. Our additive approach adds rather than multiplies probabilities when computing the utility of an explanation. We motivate the additive measure by studying the dramatic impact of zero entries in conditional probability tables on the number of zero-probability explanations, which again complicates the search process. We consider the relationship between MAXSAT and MPE, and show that additive utility (or gain) is a generalization, to the probabilistic setting, of MAXSAT utility (or gain) used in the celebrated GSAT and WalkSAT algorithms and their descendants. Utilizing our Markov chain framework, we show that expected hitting time is a rational function - i.e. a ratio of two polynomials - of the probability of applying an additive search operator. Experimentally, we report on synthetically generated BNs as well as BNs from applications, and compare SGSs performance to that of Hugin, which performs BN inference by compilation to and propagation in clique trees. On synthetic networks, SGS speeds up computation by approximately two orders of magnitude compared to Hugin. In application networks, our approach is highly competitive in Bayesian networks with a high degree of determinism. In addition to showing that stochastic local search can be competitive with clique tree clustering, our empirical results provide an improved understanding of the circumstances under which portfolio-based SLS outperforms clique tree clustering and vice versa

Verified multi-robot planning under uncertainty

Multi-robot systems are being increasingly deployed to solve real-world problems, from warehouses to autonomous fleets for logistics, from hospitals to nuclear power plants and emergency search and rescue scenarios. These systems often need to operate in uncertain environments which can lead to robot failure, uncertain action durations or the inability to complete assigned tasks. In many scenarios, the safety or reliability of these systems is critical to their deployment. Therefore there is a need for robust multi-robot planning solutions that offer guarantees on the performance of the robot team. In this thesis we develop techniques for robust multi-robot task allocation and planning under uncertainty by building on techniques from formal verification. We present three algorithms that solve the problem of task allocation and planning for a multi-robot team operating under uncertainty. These algorithms are able to calculate the expected maximum number of tasks the multi-robot team can achieve, considering the possibility of robot failure. They are also able to reallocate tasks when robots fail. We formalise the problem of task allocation and robust planning for a multi-robot team using Linear Temporal Logic to specify the team's mission and Markov decision processes to model the robots. Our first solution method is a sampling based approach to simultaneous task allocation and planning. Our second solution method separates task allocation and planning for the same problem using auctioning for the former. Our final solution lies midway between the first two using simultaneous task allocation and planning in a sequential team model. We evaluate all solution approaches extensively using a set of tests inspired by existing benchmarks in related fields with a focus on scalability

Argumentation-based methods for multi-perspective cooperative planning

Through cooperation, agents can transcend their individual capabilities and achieve goals that would be unattainable otherwise. Existing multiagent planning work considers each agent’s action capabilities, but does not account for distributed knowledge and the incompatible views agents may have of the planning domain. These divergent views can be a result of faulty sensors, local and incomplete knowledge, and outdated information, or simply because each agent has conducted different inferences and their beliefs are not aligned. This thesis is concerned with Multi-Perspective Cooperative Planning (MPCP), the problem of synthesising a plan for multiple agents which share a goal but hold different views about the state of the environment and the specification of the actions they can perform to affect it. Reaching agreement on a mutually acceptable plan is important, since cautious autonomous agents will not subscribe to plans that they individually believe to be inappropriate or even potentially hazardous. We specify the MPCP problem by adapting standard set-theoretic planning notation. Based on argumentation theory we define a new notion of plan acceptability, and introduce a novel formalism that combines defeasible logic programming and situation calculus that enables the succinct axiomatisation of contradictory planning theories and allows deductive argumentation-based inference. Our work bridges research in argumentation, reasoning about action and classical planning. We present practical methods for reasoning and planning with MPCP problems that exploit the inherent structure of planning domains and efficient planning heuristics. Finally, in order to allow distribution of tasks, we introduce a family of argumentation-based dialogue protocols that enable the agents to reach agreement on plans in a decentralised manner. Based on the concrete foundation of deductive argumentation we analytically investigate important properties of our methods illustrating the correctness of the proposed planning mechanisms. We also empirically evaluate the efficiency of our algorithms in benchmark planning domains. Our results illustrate that our methods can synthesise acceptable plans within reasonable time in large-scale domains, while maintaining a level of expressiveness comparable to that of modern automated planning

Gray-box combinatorial interaction testing

The enourmous size of configuration spaces in highly configurable softwares pose challenges to testing. Typically exhaustive testing is neither an option nor a way. Combinatorial interaction techiques are a systematic way to test such enourmous configuration spaces by a systematic way of sampling the space, employed through covering arrays. A t-way covering array is a sampled subset of configurations which contains all t-way option setting combinations. Testing through t-way covering arrays is proven to be highly e ective at revealing failures caused by interaction of t or fewer options. Although, traditional covering arrays are e ective however, we’ve observed that they su er in the presence of complex interactions among configuration options, referred as tangled options. A tangled configuration option is described as either a configuration option with complex structure and/or nested in hierarchy of configuration options. In this thesis, we conjecture the e ectiveness of CIT in the presence of tangled options can greatly be improved, by analyzing the system’s source code. The analysis of source code reveals the interaction of configuration options with each other, this information can be used to determine which additional option setting combinations and the conditions under which these combinations must be tested. Gray-box testing methods rely on partial structural information of the system during testing. We’ve statically analyzed the source code of subject applications to extract the structure and hierachy of configuration options. Each configuration option has been structurally tested according to a test criterion against a t-way covering array and subsequently their t-way interactions. The criterion revealed the missing coverage of options which were employed to drive the additional testcase generation phase to acheive complete coverage. We present a number of novel CIT coverage criteria for t-wise interaction testing of configuration options. In this thesis, we’ve conducted a series of large scale experiments on 18 di erent real-world highly configurable software applications from di erent application domains to evaluate the proposed approach. We’ve observed that traditional t-way CAs can provide above 80% coverage for configuration options testing. However, they significantly su er to provide interaction coverage under high t and tangling e ects where coverage is dropped to less than 50%. Our work address these issues and propose a technique to acheive complete coverage

A Summary of NASA Rotary Wing Research: Circa 20082018

The general public may not know that the first A in NASA stands for Aeronautics. If they do know, they will very likely be surprised that in addition to airplanes, the A includes research in helicopters, tiltrotors, and other vehicles adorned with rotors. There is, arguably, no subsonic air vehicle more difficult to accurately analyze than a vehicle with lift-producing rotors. No wonder that NASA has conducted rotary wing research since the days of the NACA and has partnered, since 1965, with the U.S. Army in order to overcome some of the most challenging obstacles to understanding the behavior of these vehicles. Since 2006, NASA rotary wing research has been performed under several different project names [Gorton et al., 2015]: Subsonic Rotary Wing (SRW) (20062012), Rotary Wing (RW) (20122014), and Revolutionary Vertical Lift Technology (RVLT) (2014present). In 2009, the SRW Project published a report that assessed the status of NASA rotorcraft research; in particular, the predictive capability of NASA rotorcraft tools was addressed for a number of technical disciplines. A brief history of NASA rotorcraft research through 2009 was also provided [Yamauchi and Young, 2009]. Gorton et al. [2015] describes the system studies during 20092011 that informed the SRW/RW/RVLT project investment prioritization and organization. The authors also provided the status of research in the RW Project in engines, drive systems, aeromechanics, and impact dynamics as related to structural dynamics of vertical lift vehicles. Since 2009, the focus of research has shifted from large civil VTOL transports, to environmentally clean aircraft, to electrified VTOL aircraft for the urban air mobility (UAM) market. The changing focus of rotorcraft research has been a reflection of the evolving strategic direction of the NASA Aeronautics Research Mission Directorate (ARMD). By 2014, the project had been renamed the Revolutionary Vertical Lift Technology Project. In response to the 2014 NASA Strategic Plan, ARMD developed six Strategic Thrusts. Strategic Thrust 3B was defined as the Ultra-Efficient Commercial VehiclesVertical Lift Aircraft. Hochstetler et al. [2017] uses Thrust 3B as an example for developing metrics usable by ARMD to measure the effectiveness of each of the Strategic Thrusts. The authors provide near-, mid-, and long-term outcomes for Thrust 3B with corresponding benefits and capabilities. The importance of VTOL research, especially with the rapidly expanding UAM market, eventually resulted in a new Strategic Thrust (to begin in 2020): Thrust 4Safe, Quiet, and Affordable Vertical Lift Air Vehicles. The underlying rotary wing analysis tools used by NASA are still applicable to traditional rotorcraft and have been expanded in capability to accommodate the growing number of VTOL configurations designed for UAM. The top-level goal of the RVLT Project remains unchanged since 2006: Develop and validate tools, technologies and concepts to overcome key barriers for vertical lift vehicles. In 2019, NASA rotary wing/VTOL research has never been more important for supporting new aircraft and advancements in technology. 2 A decade is a reasonable interval to pause and take stock of progress and accomplishments. In 10 years, digital technology has propelled progress in computational efficiency by orders of magnitude and expanded capabilities in measurement techniques. The purpose of this report is to provide a compilation of the NASA rotary wing research from ~2008 to ~2018. Brief summaries of publications from NASA, NASA-funded, and NASA-supported research are provided in 12 chapters: Acoustics, Aeromechanics, Computational Fluid Dynamics (External Flow), Experimental Methods, Flight Dynamics and Control, Drive Systems, Engines, Crashworthiness, Icing, Structures and Materials, Conceptual Design and System Analysis, and Mars Helicopter. We hope this report serves as a useful reference for future NASA vertical lift researchers

Adaptive Similarity Measures for Material Identification in Hyperspectral Imagery

Remotely-sensed hyperspectral imagery has become one the most advanced tools for analyzing the processes that shape the Earth and other planets. Effective, rapid analysis of high-volume, high-dimensional hyperspectral image data sets demands efficient, automated techniques to identify signatures of known materials in such imagery. In this thesis, we develop a framework for automatic material identification in hyperspectral imagery using adaptive similarity measures. We frame the material identification problem as a multiclass similarity-based classification problem, where our goal is to predict material labels for unlabeled target spectra based upon their similarities to source spectra with known material labels. As differences in capture conditions affect the spectral representations of materials, we divide the material identification problem into intra-domain (i.e., source and target spectra captured under identical conditions) and inter-domain (i.e., source and target spectra captured under different conditions) settings. The first component of this thesis develops adaptive similarity measures for intra-domain settings that measure the relevance of spectral features to the given classification task using small amounts of labeled data. We propose a technique based on multiclass Linear Discriminant Analysis (LDA) that combines several distinct similarity measures into a single hybrid measure capturing the strengths of each of the individual measures. We also provide a comparative survey of techniques for low-rank Mahalanobis metric learning, and demonstrate that regularized LDA yields competitive results to the state-of-the-art, at substantially lower computational cost. The second component of this thesis shifts the focus to inter-domain settings, and proposes a multiclass domain adaptation framework that reconciles systematic differences between spectra captured under similar, but not identical, conditions. Our framework computes a similarity-based mapping that captures structured, relative relationships between classes shared between source and target domains, allowing us apply a classifier trained using labeled source spectra to classify target spectra. We demonstrate improved domain adaptation accuracy in comparison to recently-proposed multitask learning and manifold alignment techniques in several case studies involving state-of-the-art synthetic and real-world hyperspectral imagery