Matching Items (5)
Filtering by

Clear all filters

156952-Thumbnail Image.png
Description
Robotic swarms can potentially perform complicated tasks such as exploration and mapping at large space and time scales in a parallel and robust fashion. This thesis presents strategies for mapping environmental features of interest – specifically obstacles, collision-free paths, generating a metric map and estimating scalar density fields– in an

Robotic swarms can potentially perform complicated tasks such as exploration and mapping at large space and time scales in a parallel and robust fashion. This thesis presents strategies for mapping environmental features of interest – specifically obstacles, collision-free paths, generating a metric map and estimating scalar density fields– in an unknown domain using data obtained by a swarm of resource-constrained robots. First, an approach was developed for mapping a single obstacle using a swarm of point-mass robots with both directed and random motion. The swarm population dynamics are modeled by a set of advection-diffusion-reaction partial differential equations (PDEs) in which a spatially-dependent indicator function marks the presence or absence of the obstacle in the domain. The indicator function is estimated by solving an optimization problem with PDEs as constraints. Second, a methodology for constructing a topological map of an unknown environment was proposed, which indicates collision-free paths for navigation, from data collected by a swarm of finite-sized robots. As an initial step, the number of topological features in the domain was quantified by applying tools from algebraic topology, to a probability function over the explored region that indicates the presence of obstacles. A topological map of the domain is then generated using a graph-based wave propagation algorithm. This approach is further extended, enabling the technique to construct a metric map of an unknown domain with obstacles using uncertain position data collected by a swarm of resource-constrained robots, filtered using intensity measurements of an external signal. Next, a distributed method was developed to construct the occupancy grid map of an unknown environment using a swarm of inexpensive robots or mobile sensors with limited communication. In addition to this, an exploration strategy which combines information theoretic ideas with Levy walks was also proposed. Finally, the problem of reconstructing a two-dimensional scalar field using observations from a subset of a sensor network in which each node communicates its local measurements to its neighboring nodes was addressed. This problem reduces to estimating the initial condition of a large interconnected system with first-order linear dynamics, which can be solved as an optimization problem.
ContributorsRamachandran, Ragesh Kumar (Author) / Berman, Spring M (Thesis advisor) / Mignolet, Marc (Committee member) / Artemiadis, Panagiotis (Committee member) / Marvi, Hamid (Committee member) / Robinson, Michael (Committee member) / Arizona State University (Publisher)
Created2018
134544-Thumbnail Image.png
Description
This thesis presents an approach to design and implementation of an adaptive boundary coverage control strategy for a swarm robotic system. Several fields of study are relevant to this project, including; dynamic modeling, control theory, programming, and robotic design. Tools and techniques from these fields were used to design and

This thesis presents an approach to design and implementation of an adaptive boundary coverage control strategy for a swarm robotic system. Several fields of study are relevant to this project, including; dynamic modeling, control theory, programming, and robotic design. Tools and techniques from these fields were used to design and implement a model simulation and an experimental testbed. To achieve this goal, a simulation of the boundary coverage control strategy was first developed. This simulated model allowed for concept verification for different robot groups and boundary designs. The simulation consisted of a single, constantly expanding circular boundary with a modeled swarm of robots that autonomously allocate themselves around the boundary. Ultimately, this simulation was implemented in an experimental testbed consisting of mobile robots and a moving boundary wall to exhibit the behaviors of the simulated robots. The conclusions from this experiment are hoped to help make further advancements to swarm robotic technology. The results presented show promise for future progress in adaptive control strategies for robotic swarms.
ContributorsMurphy, Hunter Nicholas (Author) / Berman, Spring (Thesis director) / Marvi, Hamid (Committee member) / Mechanical and Aerospace Engineering Program (Contributor) / Barrett, The Honors College (Contributor)
Created2017-05
147753-Thumbnail Image.png
Description

The researchers build a drone with a grasping mechanism to wrap around branches to perch. The design process and methodology are discussed along with the software and hardware configuration. The researchers explain the influences on the design and the possibilities for what it could inspire.

ContributorsDowney, Matthew Evan (Co-author) / Macias, Jose (Co-author) / Goldenberg, Edward (Co-author) / Zhang, Wenlong (Thesis director) / Aukes, Daniel (Committee member) / Engineering Programs (Contributor) / Barrett, The Honors College (Contributor)
Created2021-05
156672-Thumbnail Image.png
Description
Existing robotic excavation research has been primarily focused on lunar mining missions or simple traffic control in confined tunnels, however little work attempts to bring collective excavation into the realm of human infrastructure. This thesis explores a decentralized approach to excavation processes, where traffic laws are borrowed from swarms of

Existing robotic excavation research has been primarily focused on lunar mining missions or simple traffic control in confined tunnels, however little work attempts to bring collective excavation into the realm of human infrastructure. This thesis explores a decentralized approach to excavation processes, where traffic laws are borrowed from swarms of fire ants (Solenopsis invicta) or termites (Coptotermes formosanus) to create decision rules for a swarm of robots working together and organizing effectively to create a desired final excavated pattern.

First, a literature review of the behavioral rules of different types of insect colonies and the resulting structural patterns over the course of excavation was conducted. After identifying pertinent excavation laws, three different finite state machines were generated that relate to construction, search and rescue operations, and extraterrestrial exploration. After analyzing these finite state machines, it became apparent that they all shared a common controller. Then, agent-based NetLogo software was used to simulate a swarm of agents that run this controller, and a model for excavating behaviors and patterns was fit to the simulation data. This model predicts the tunnel shapes formed in the simulation as a function of the swarm size and a time delay, called the critical waiting period, in one of the state transitions. Thus, by controlling the individual agents' behavior, it was possible to control the structural outcomes of collective excavation in simulation.

To create an experimental testbed that could be used to physically implement the controller, a small foldable robotic platform was developed, and it's capabilities were tested in granular media. In order to characterize the granular media, force experiments were conducted and parameters were measured for resistive forces during an excavation cycle. The final experiment verified the robot's ability to engage in excavation and deposition, and to determine whether or not to begin the critical waiting period. This testbed can be expanded with multiple robots to conduct small-scale experiments on collective excavation, such as further exploring the effects of the critical waiting period on the resulting excavation pattern. In addition, investigating other factors like tuning digging efficiency or deposition proximity could help to transition the proposed bio-inspired swarm excavation controllers to implementation in real-world applications.
ContributorsHaggerty, Zz Mae (Author) / Berman, Spring M (Thesis advisor) / Aukes, Daniel (Committee member) / Marvi, Hamid (Committee member) / Arizona State University (Publisher)
Created2018
161731-Thumbnail Image.png
Description
As technological advancements in silicon, sensors, and actuation continue, the development of robotic swarms is shifting from the domain of science fiction to reality. Many swarm applications, such as environmental monitoring, precision agriculture, disaster response, and lunar prospecting, will require controlling numerous robots with limited capabilities and information to redistribute

As technological advancements in silicon, sensors, and actuation continue, the development of robotic swarms is shifting from the domain of science fiction to reality. Many swarm applications, such as environmental monitoring, precision agriculture, disaster response, and lunar prospecting, will require controlling numerous robots with limited capabilities and information to redistribute among multiple states, such as spatial locations or tasks. A scalable control approach is to program the robots with stochastic control policies such that the robot population in each state evolves according to a mean-field model, which is independent of the number and identities of the robots. Using this model, the control policies can be designed to stabilize the swarm to the target distribution. To avoid the need to reprogram the robots for different target distributions, the robot control policies can be defined to depend only on the presence of a “leader” agent, whose control policy is designed to guide the swarm to a particular distribution. This dissertation presents a novel deep reinforcement learning (deep RL) approach to designing control policies that redistribute a swarm as quickly as possible over a strongly connected graph, according to a mean-field model in the form of the discrete-time Kolmogorov forward equation. In the leader-based strategies, the leader determines its next action based on its observations of robot populations and shepherds the swarm over the graph by probabilistically repelling nearby robots. The scalability of this approach with the swarm size is demonstrated with leader control policies that are designed using two tabular Temporal-Difference learning algorithms, trained on a discretization of the swarm distribution. To improve the scalability of the approach with robot population and graph size, control policies for both leader-based and leaderless strategies are designed using an actor-critic deep RL method that is trained on the swarm distribution predicted by the mean-field model. In the leaderless strategy, the robots’ control policies depend only on their local measurements of nearby robot populations. The control approaches are validated for different graph and swarm sizes in numerical simulations, 3D robot simulations, and experiments on a multi-robot testbed.
ContributorsKakish, Zahi Mousa (Author) / Berman, Spring (Thesis advisor) / Yong, Sze Zheng (Committee member) / Marvi, Hamid (Committee member) / Pavlic, Theodore (Committee member) / Pratt, Stephen (Committee member) / Ben Amor, Hani (Committee member) / Arizona State University (Publisher)
Created2021