Joint Exploration of Local Metrics and Geometry in Sampling-based Planning

This thesis addresses how the local geometry of the workspace around a system state can be combined with local metrics describing system dynamics to improve the connectivity of the graph produced by a sampling-based planner over a fixed number of configurations. This development is achieved through generalization of the concept of the local free space to inner products other than the Euclidean inner product. This new structure allows for naturally combining the local free space construction with a locally applicable metric. The combination of the local free space with two specific metrics is explored in this work. The first metric is the quadratic cost-to-go function defined by a linear quadratic regulator, which captures the local behavior of the dynamical system. The second metric is the Mahalanobis distance for a belief state in a belief space planner. Belief space planners reason over distributions of states, called belief states, to include modeled uncertainty in the planning process. The Mahalanobis distances metric for a given belief state can be exploited to include notions of risk in local free space construction. Numerical simulations are provided to demonstrate the improved connectivity of the graph generated by a sampling-based planner using these concepts

Computer Science 2019 APR Self-Study & Documents

UNM Computer Science APR self-study report and review team report for Spring 2019, fulfilling requirements of the Higher Learning Commission

Planning Algorithms for Multi-Robot Active Perception

A fundamental task of robotic systems is to use on-board sensors and perception algorithms to understand high-level semantic properties of an environment. These semantic properties may include a map of the environment, the presence of objects, or the parameters of a dynamic field. Observations are highly viewpoint dependent and, thus, the performance of perception algorithms can be improved by planning the motion of the robots to obtain high-value observations. This motivates the problem of active perception, where the goal is to plan the motion of robots to improve perception performance. This fundamental problem is central to many robotics applications, including environmental monitoring, planetary exploration, and precision agriculture. The core contribution of this thesis is a suite of planning algorithms for multi-robot active perception. These algorithms are designed to improve system-level performance on many fronts: online and anytime planning, addressing uncertainty, optimising over a long time horizon, decentralised coordination, robustness to unreliable communication, predicting plans of other agents, and exploiting characteristics of perception models. We first propose the decentralised Monte Carlo tree search algorithm as a generally-applicable, decentralised algorithm for multi-robot planning. We then present a self-organising map algorithm designed to find paths that maximally observe points of interest. Finally, we consider the problem of mission monitoring, where a team of robots monitor the progress of a robotic mission. A spatiotemporal optimal stopping algorithm is proposed and a generalisation for decentralised monitoring. Experimental results are presented for a range of scenarios, such as marine operations and object recognition. Our analytical and empirical results demonstrate theoretically-interesting and practically-relevant properties that support the use of the approaches in practice

Context Awareness in Swarm Systems

Recent swarms of Uncrewed Systems (UxS) require substantial human input to support their operation. The little 'intelligence' on these platforms limits their potential value and increases their overall cost. Artificial Intelligence (AI) solutions are needed to allow a single human to guide swarms of larger sizes. Shepherding is a bio-inspired swarm guidance approach with one or a few sheepdogs guiding a larger number of sheep. By designing AI-agents playing the role of sheepdogs, humans can guide the swarm by using these AI agents in the same manner that a farmer uses biological sheepdogs to muster sheep. A context-aware AI-sheepdog offers human operators a smarter command and control system. It overcomes the current limiting assumption in the literature of swarm homogeneity to manage heterogeneous swarms and allows the AI agents to better team with human operators. This thesis aims to demonstrate the use of an ontology-guided architecture to deliver enhanced contextual awareness for swarm control agents. The proposed architecture increases the contextual awareness of AI-sheepdogs to improve swarm guidance and control, enabling individual and collective UxS to characterise and respond to ambiguous swarm behavioural patterns. The architecture, associated methods, and algorithms advance the swarm literature by allowing improved contextual awareness to guide heterogeneous swarms. Metrics and methods are developed to identify the sources of influence in the swarm, recognise and discriminate the behavioural traits of heterogeneous influencing agents, and design AI algorithms to recognise activities and behaviours. The proposed contributions will enable the next generation of UxS with higher levels of autonomy to generate more effective Human-Swarm Teams (HSTs)

Using MapReduce Streaming for Distributed Life Simulation on the Cloud

Distributed software simulations are indispensable in the study of large-scale life models but often require the use of technically complex lower-level distributed computing frameworks, such as MPI. We propose to overcome the complexity challenge by applying the emerging MapReduce (MR) model to distributed life simulations and by running such simulations on the cloud. Technically, we design optimized MR streaming algorithms for discrete and continuous versions of Conway’s life according to a general MR streaming pattern. We chose life because it is simple enough as a testbed for MR’s applicability to a-life simulations and general enough to make our results applicable to various lattice-based a-life models. We implement and empirically evaluate our algorithms’ performance on Amazon’s Elastic MR cloud. Our experiments demonstrate that a single MR optimization technique called strip partitioning can reduce the execution time of continuous life simulations by 64%. To the best of our knowledge, we are the first to propose and evaluate MR streaming algorithms for lattice-based simulations. Our algorithms can serve as prototypes in the development of novel MR simulation algorithms for large-scale lattice-based a-life models.https://digitalcommons.chapman.edu/scs_books/1014/thumbnail.jp