A multi-touch interface for multi-robot path planning and control

In the last few years, research in human-robot interaction has moved beyond the issues concerning the design of the interaction between a person and a single robot. Today many researchers have shifted their focus toward the problem of how humans can control a multi-robot team. The rising of multi-touch devices provides a new range of opportunities in this sense. Our research seeks to discover new insights and guidelines for the design of multi-touch interfaces for the control of biologically inspired multi-robot teams. We have developed an iPad touch interface that lets users exert partial control over a set of autonomous robots. The interface also serves as an experimental platform to study how human operators design multi-robot motion in a pursuit-evasion setting

CPC: Crime, Policing and Citizenship - Intelligent Policing and Big Data

Crime, Policing and Citizenship (CPC) – Space-Time Interactions of Dynamic Networks has been a major UK EPSRC-funded research project. It has been a multidisciplinary collaboration of geoinformatics, crime science, computer science and geography within University College London (UCL), in partnership with the Metropolitan Police Service (MPS). The aim of the project has been to develop new methods and applications in space-time analytics and emergent network complexity, in order to uncover patterning and interactions in crime, policing and citizen perceptions. The work carried out throughout the project will help inform policing at a range of scales, from the local to the city-wide, with the goal of reducing both crime and the fear of crime. The CPC project is timely given the tremendous challenging facing policing in big cities nationally and globally, as consequences of changes in society, population structure and economic well-being. It addresses these issues through an intelligent approach to data-driven policing, using daily reported crime statistics, GPS traces of foot and vehicular patrols, surveys of public attitudes and geo-temporal demographic data of changing community structure. The analytic focus takes a spatio-temporal perspective, reflecting the strong spatial and temporal integration of criminal, policing and citizen activities. Street networks are used throughout as a basis for analysis, reflecting their role as a key determinant of urban structure and the substrate on which crime and policing take place. The project has presented a manifesto for ‘intelligent policing’ which embodies the key issues arising in the transition from Big Data into actionable insights. Police intelligence should go beyond current practice, incorporating not only the prediction of events, but also how to respond to them, and how to evaluate the actions taken. Cutting-edge network-based crime prediction methods have been developed to accurately predict crime risks at street segment level, helping police forces to focus resources in the right places at the right times. Methods and tools have been implemented to support senior offices in strategic planning, and to provide guidance to frontline officers in daily patrolling. To evaluate police performance, models and tools have been developed to aid identification of areas requiring greater attention, and to analyse the patrolling behaviours of officers. Methods to understand and model confidence in policing have also been explored, suggesting strategies by which confidence in the police can be improved in different population segments and neighbourhood areas. A number of tools have been developed during the course of the project include data-driven methods for crime prediction and for performance evaluation. We anticipate that these will ultimately be adopted in daily policing practice and will play an important role in the modernisation of policing. Furthermore, we believe that the approaches to the building of public trust and confidence that we suggest will contribute to the transformation and improvement of the relationship between the public and police

Mission Planning Techniques for Cooperative LEO Spacecraft Constellations

This research develops a mission planning approach that allows different systems to cooperate in accomplishing a single mission goal. Using the techniques described allows satellites to cooperate in efficiently maneuvering, or collecting images of Earth and transmitting the collected data to users on the ground. The individual resources onboard each satellite, like fuel, memory capacity and pointing agility, are used in a manner that ensures the goals and objectives of the mission are realized in a feasible way. A mission plan can be generated for each satellite within the cooperating group that collectively optimize the mission objectives from a global viewpoint. The unique methods and framework presented for planning the spacecraft operations are flexible and can be applied to a variety of decision making processes where prior decisions impact later decision options. This contribution to the satellite constellation mission planning field, thus has greater applicability to the wider decision problem discipline

A Hybrid Multi-Robot Control Architecture

Multi-robot systems provide system redundancy and enhanced capability versus single robot systems. Implementations of these systems are varied, each with specific design approaches geared towards an application domain. Some traditional single robot control architectures have been expanded for multi-robot systems, but these expansions predominantly focus on the addition of communication capabilities. Both design approaches are application specific and limit the generalizability of the system. This work presents a redesign of a common single robot architecture in order to provide a more sophisticated multi-robot system. The single robot architecture chosen for application is the Three Layer Architecture (TLA). The primary strength of TLA is in the ability to perform both reactive and deliberative decision making, enabling the robot to be both sophisticated and perform well in stochastic environments. The redesign of this architecture includes incorporation of the Unified Behavior Framework (UBF) into the controller layer and an addition of a sequencer-like layer (called a Coordinator) to accommodate the multi-robot system. These combine to provide a robust, independent, and taskable individual architecture along with improved cooperation and collaboration capabilities, in turn reducing communication overhead versus many traditional approaches. This multi-robot systems architecture is demonstrated on the RoboCup Soccer Simulator showing its ability to perform well in a dynamic environment where communication constraints are high

Inter-workgroup barrier synchronisation on graphics processing units

GPUs are parallel devices that are able to run thousands of independent threads concurrently. Traditional GPU programs are data-parallel, requiring little to no communication, i.e. synchronisation, between threads. However, classical concurrency in the context of CPUs often exploits synchronisation idioms that are not supported on GPUs. By studying such idioms on GPUs, with an aim to facilitate them in a portable way, a wider and more generic space of GPU applications can be made possible. While the breadth of this thesis extends to many aspects of GPU systems, the common thread throughout is the global barrier: an execution barrier that synchronises all threads executing a GPU application. The idea of such a barrier might seem straightforward, however this investigation reveals many challenges and insights. In particular, this thesis includes the following studies: Execution models: while a general global barrier can deadlock due to starvation on GPUs, it is shown that the scheduling guarantees of current GPUs can be used to dynamically create an execution environment that allows for a safe and portable global barrier across a subset of the GPU threads. Application optimisations: a set GPU optimisations are examined that are tailored for graph applications, including one optimisation enabled by the global barrier. It is shown that these optimisations can provided substantial performance improvements, e.g. the barrier optimisation achieves over a 10X speedup on AMD and Intel GPUs. The performance portability of these optimisations is investigated, as their utility varies across input, application, and architecture. Multitasking: because many GPUs do not support preemption, long-running GPU compute tasks (e.g. applications that use the global barrier) may block other GPU functions, including graphics. A simple cooperative multitasking scheme is proposed that allows graphics tasks to meet their deadlines with reasonable overheads.Open Acces

Multi-type Fair Resource Allocation for Distributed Multi-Robot Systems

Fair resource allocation is essential to ensure that all resource requesters acquire adequate resources and accomplish tasks. We propose solutions to the fairness problem in multi-type resource allocation for multi-robot systems that have multiple resource requesters. We apply the dominant resource fairness (DRF) principle in our solutions to two different systems: single-tasking robots with multi-robot tasks (STR-MRT) and multi-tasking robots with single-robot tasks (MTR-SRT). In STR-MRT, each robot can perform only one task at a time, tasks are divisible, and accomplishing each task requires one or more robots. In MTR-SRT, each robot can perform multiple tasks at a time, tasks are not divisible, and accomplishing each task requires only one robot. We present centralized solutions to the fairness problem in STR-MRT. Meanwhile, we model the decentralized resource allocation in STR-MRT as a coordination game between the robots. Each robot subgroup is formed by robots that strategically select the same resource requester. For a requester associated with a specific subgroup, a consensus-based team formation algorithm further chooses the minimal set of robots to accomplish the task. We leverage the Deep Q-learning Network (DQN) to support requester selection. The results suggest that the DQN outperforms the commonly used Q-learning. Finally, we propose two decentralized solutions to promote fair resource allocation in MTR-SRT, as a centralized solution already exists. We first propose a task-forwarding solution in which the robots need to negotiate the placement of each task. In our second solution, each robot first selects resource requesters and then independently allocates resources to tasks that arrive from the selected requesters. The resource-requester selection phase of the latter solution models a coordination game that is solved by reinforcement learning. The experimental results suggest that both approaches outperform their baselines

A Localized Autonomous Control Algorithm For Robots With Heterogeneous Capabilities In A Multi-Tier Architecture

This dissertation makes two contributions to the use of the Blackboard Architecture for command. The use of boundary nodes for data abstraction is introduced and the use of a solver-based blackboard system with pruning is proposed. It also makes contributions advancing the engineering design process in the area of command system selection for heterogeneous robotic systems. It presents and analyzes data informing decision making between centralized and distributed command systems and also characterizes the efficacy of pruning across different experimental scenarios, demonstrating when it is effective or not. Finally, it demonstrates the operations of the system, raising the technology readiness level (TRL) of the technology towards a level suitable for actual mission use. The context for this work is a multi-tier mission architecture, based on prior work by Fink on a “tier scalable” architecture. This work took a top-down approach where the superior tiers (in terms of scope of visibility) send specific commands to craft in lower tiers. While benefitting from the use of a large centralized processing center, this approach is limited in responding to failures and interference. The work presented herein has involved developing and comparatively characterizing centralized and decentralized (where superior nodes provide information and goals to the lower-level craft, but decisions are made locally) Blackboard Architecture based command systems. Blackboard Architecture advancements (a solver, pruning, boundary nodes) have been made and tested under multiple experimental conditions

Evolutionary Computation 2020

Intelligent optimization is based on the mechanism of computational intelligence to refine a suitable feature model, design an effective optimization algorithm, and then to obtain an optimal or satisfactory solution to a complex problem. Intelligent algorithms are key tools to ensure global optimization quality, fast optimization efficiency and robust optimization performance. Intelligent optimization algorithms have been studied by many researchers, leading to improvements in the performance of algorithms such as the evolutionary algorithm, whale optimization algorithm, differential evolution algorithm, and particle swarm optimization. Studies in this arena have also resulted in breakthroughs in solving complex problems including the green shop scheduling problem, the severe nonlinear problem in one-dimensional geodesic electromagnetic inversion, error and bug finding problem in software, the 0-1 backpack problem, traveler problem, and logistics distribution center siting problem. The editors are confident that this book can open a new avenue for further improvement and discoveries in the area of intelligent algorithms. The book is a valuable resource for researchers interested in understanding the principles and design of intelligent algorithms