A Decentralized Strategy for Swarm Robots to Manage Spatially Distributed Tasks

Large-scale scenarios such as search-and-rescue operations, agriculture, warehouse, surveillance, and construction consist of multiple tasks to be performed at the same time. These tasks have non-trivial spatial distributions. Robot swarms are envisioned to be efficient, robust, and flexible for such applications. We model this system such that each robot can service a single task at a time; each task requires a specific number of robots, which we refer to as \u27quota\u27; task allocation is instantaneous; and tasks do not have inter- dependencies. This work focuses on distributing robots to spatially distributed tasks of known quotas in an efficient manner. Centralized solutions which guarantee optimality in terms of distance travelled by the swarm exist. Although potentially scalable, they require non-trivial coordination; could be computationally expensive; and may have poor response time when the number of robots, tasks and task quotas increase. For a swarm to efficiently complete tasks with a short response time, a decentralized approach provides better parallelism and scalability than a centralized one. In this work, we study the performance of a weight-based approach which is enhanced to include spatial aspects. In our approach, the robots share a common table that reports the task locations and quotas. Each robot, according to its relative position with respect to task locations, modifies weights for each task and randomly chooses a task to serve. Weights increase for tasks that are closer and have high quota as opposed to tasks which are far away and have low quota. Tasks with higher weights have a higher probability of being selected. This results in each robot having its own set of weights for all tasks. We introduce a distance- bias parameter, which determines how sensitive the system is to relative robot-task locations over task quotas. We focus on evaluating the distance covered by the swarm, number of inter- task switches, and time required to completely allocate all tasks and study the performance of our approach in several sets of simulated experiments

Computational Frameworks for Multi-Robot Cooperative 3D Printing and Planning

This dissertation proposes a novel cooperative 3D printing (C3DP) approach for multi-robot additive manufacturing (AM) and presents scheduling and planning strategies that enable multi-robot cooperation in the manufacturing environment. C3DP is the first step towards achieving the overarching goal of swarm manufacturing (SM). SM is a paradigm for distributed manufacturing that envisions networks of micro-factories, each of which employs thousands of mobile robots that can manufacture different products on demand. SM breaks down the complicated supply chain used to deliver a product from a large production facility from one part of the world to another. Instead, it establishes a network of geographically distributed micro-factories that can manufacture the product at a smaller scale without increasing the cost. In C3DP, many printhead-carrying mobile robots work together to print a single part cooperatively. While it holds the promise to mitigate issues associated with gantry-based 3D printers, such as lack of scalability in print size and print speed, its realization is challenging because existing studies in the relevant literature do not address the fundamental issues in C3DP that stem from the amalgamation of the mobile nature of the robots, and continuous nature of the manufacturing tasks. To address this challenge, this dissertation asks two fundamental research questions: RQ1) How can the traditional 3D printing process be transformed to enable multi-robot cooperative AM? RQ2) How can cooperative manufacturing planning be realized in the presence of inherent uncertainties in AM and constraints that are dynamic in both space and time? To answer RQ1, we discretize the process of 3D printing into multiple stages. These stages include chunking (dividing a part into smaller chunks), scheduling (assigning chunks to robots and generating print sequences), and path and motion planning. To test the viability of the approach, we conducted a study on the tensile strength of chunk-based parts to examine their mechanical integrity. The study demonstrates that the chunk-based part can be as strong as the conventionally 3D-printed part. Next, we present different computational frameworks to address scheduling issues in C3DP. These include the development of 1) the world-first working strategy for C3DP, 2) a framework for automatic print schedule generation, evaluation, and validation, and 3) a resource-constrained scheduling approach for C3DP that uses a meta-heuristic approach such as a modified Genetic Algorithm (MGA) and a new algorithm that uses a constraint-satisficing approach to obtain collision-free print schedules for C3DP. To answer RQ2, a multi-robot decentralized approach based on a simple set of rules is used to plan for C3DP. The approach is resilient to uncertainties such as variation in printing times and can even outperform the centralized approach that uses MGA with a conflict-based search for large-scale problems. By answering these two fundamental questions, the central objective of the research project to establish computational frameworks to enable multi-robot cooperative manufacturing was achieved. The search for answers to the RQs led to the development of novel concepts that can be used not only in C3DP, but many other manufacturing tasks, in general, requiring cooperation among multiple robots

Target Assignment in Robotic Networks: Distance Optimality Guarantees and Hierarchical Strategies

We study the problem of multi-robot target assignment to minimize the total distance traveled by the robots until they all reach an equal number of static targets. In the first half of the paper, we present a necessary and sufficient condition under which true distance optimality can be achieved for robots with limited communication and target-sensing ranges. Moreover, we provide an explicit, non-asymptotic formula for computing the number of robots needed to achieve distance optimality in terms of the robots' communication and target-sensing ranges with arbitrary guaranteed probabilities. The same bounds are also shown to be asymptotically tight. In the second half of the paper, we present suboptimal strategies for use when the number of robots cannot be chosen freely. Assuming first that all targets are known to all robots, we employ a hierarchical communication model in which robots communicate only with other robots in the same partitioned region. This hierarchical communication model leads to constant approximations of true distance-optimal solutions under mild assumptions. We then revisit the limited communication and sensing models. By combining simple rendezvous-based strategies with a hierarchical communication model, we obtain decentralized hierarchical strategies that achieve constant approximation ratios with respect to true distance optimality. Results of simulation show that the approximation ratio is as low as 1.4

Solving the Task Variant Allocation Problem in Distributed Robotics

We consider the problem of assigning software processes (or tasks) to hardware processors in distributed robotics environments. We introduce the notion of a task variant, which supports the adaptation of software to specific hardware configurations. Task variants facilitate the trade-off of functional quality versus the requisite capacity and type of target execution processors. We formalise the problem of assigning task variants to processors as a mathematical model that incorporates typical constraints found in robotics applications; the model is a constrained form of a multi-objective, multi-dimensional, multiple-choice knapsack problem. We propose and evaluate three different solution methods to the problem: constraint programming, a constructive greedy heuristic and a local search metaheuristic. Furthermore, we demonstrate the use of task variants in a real instance of a distributed interactive multi-agent navigation system, showing that our best solution method (constraint programming) improves the system’s quality of service, as compared to the local search metaheuristic, the greedy heuristic and a randomised solution, by an average of 16, 31 and 56% respectively

Large-Scale Distributed Coalition Formation

The CyberCraft project is an effort to construct a large scale Distributed Multi-Agent System (DMAS) to provide autonomous Cyberspace defense and mission assurance for the DoD. It employs a small but flexible agent structure that is dynamically reconfigurable to accommodate new tasks and policies. This document describes research into developing protocols and algorithms to ensure continued mission execution in a system of one million or more agents, focusing on protocols for coalition formation and Command and Control. It begins by building large-scale routing algorithms for a Hierarchical Peer to Peer structured overlay network, called Resource-Clustered Chord (RC-Chord). RC-Chord introduces the ability to efficiently locate agents by resources that agents possess. Combined with a task model defined for CyberCraft, this technology feeds into an algorithm that constructs task coalitions in a large-scale DMAS. Experiments reveal the flexibility and effectiveness of these concepts for achieving maximum work throughput in a simulated CyberCraft environment