Guided airdrop parafoil systems depend on GPS for localization and landing. In some scenarios, GPS may be unreliable (jammed, spoofed, or disabled), or unavailable (indoor, or extraterrestrial environments). In the context of guided parafoils, landing locations for each system must be pre-programmed manually with global coordinates, which may be inaccurate or outdated, and offer no in-flight adaptability. Parafoil systems in particular have constrained motion, communication, and on-board computation and storage capabilities, and must operate in harsh conditions. These constraints necessitate a comprehensive approach to address the fundamental limitations of these systems when GPS cannot be used reliably. A novel and minimalist approach to visual navigation and multi-agent communication using semantic machine learning classification and geometric constraints is introduced. This approach enables localization and landing site identification for multiple communicating parafoil systems deployed in GPS-denied environments.

We introduce a framework that would enable using autonomous aerial vehicles in search and rescue scenarios associated with missing person incidents to assist human searchers. We formulate a lost person behavior model and a human searcher model informed by data collected from past search missions. These models are used to generate a probabilistic heatmap of the lost person's position and anticipated searcher trajectories. We use Gaussian processes with a Gibbs' kernel for data fusion to accurately model a limited field-of-view sensor. Our algorithm thereby computes a set of trajectories for a team of aerial vehicles to autonomously navigate, so as to assist and complement human searchers' efforts. / Master of Science / Our goal is to assist human searchers using autonomous aerial vehicles in search and rescue scenarios associated with missing person incidents. We formulate a lost person behavior model and a human searcher model informed by data collected from past search missions. These models are used to generate a probabilistic heatmap of the lost person’s position and anticipated searcher trajectories. We use Gaussian processes for data fusion with Gibbs’ kernel to accurately model a limited field-of-view sensor. Our algorithm thereby computes a set of trajectories for a team of aerial vehicles to autonomously navigate, so as to assist and complement human searchers’ efforts.

The efficiency, security and resiliency are very important factors for the operation of a distribution power system. Taking into account customer demand and energy resource constraints, electric utilities not only need to provide reliable services but also need to operate a power grid as efficiently as possible. The objective of this dissertation is to design, develop and deploy the Multi-Agent Systems (MAS) - together with control algorithms - that enable demand response (DR) implementation at the customer level, focusing on both residential and commercial customers. For residential applications, the main objective is to propose an approach for a smart distribution transformer management. The DR objective at a distribution transformer is to ensure that the instantaneous power demand at a distribution transformer is kept below a certain demand limit while impacts of demand restrike are minimized. The DR objectives at residential homes are to secure critical loads, mitigate occupant comfort violation, and minimize appliance run-time after a DR event. For commercial applications, the goal is to propose a MAS architecture and platform that help facilitate the implementation of a Critical Peak Pricing (CPP) program. Main objectives of the proposed DR algorithm are to minimize power demand and energy consumption during a period that a CPP event is called out, to minimize occupant comfort violation, to minimize impacts of demand restrike after a CPP event, as well as to control the device operation to avoid restrikes. Overall, this study provides an insight into the design and implementation of MAS, together with associated control algorithms for DR implementation in smart buildings. The proposed approaches can serve as alternative solutions to the current practices of electric utilities to engage end-use customers to participate in DR programs where occupancy level, tenant comfort condition and preference, as well as controllable devices and sensors are taken into account in both simulated and real-world environments. Research findings show that the proposed DR algorithms can perform effectively and efficiently during a DR event in residential homes and during the CPP event in commercial buildings. / Ph. D.

This work addresses applications of search theory where a mobile search agent seeks to find an unknown number of stationary targets randomly distributed in a bounded search domain. We assume that the search mission is subject to a time or distance constraint, and that the local environmental conditions affect sensor performance. Because the environment varies by location, the effectiveness of the search sensor also varies by location. Our contribution to search theory includes new decision-theoretic approaches for generating optimal search plans in the presence of false alarms and uncertain environmental variability. We also formally define the value of environmental information for improving the effectiveness of a search mission, and we develop methods for optimal deployment of assets that can acquire environmental information in order to improve search effectiveness. Finally, we extend our research to the case of multiple cooperating search agents. For the case that inter-agent communication is severely bandwidth-limited, such as in subsea applications, we propose a method for assessing the expected value of inter-agent communication relative to joint search effectiveness. Our results lead to a method for determining when search agents should communicate. Our contributions to search theory address important applications that range from subsea mine-hunting to post-disaster search and rescue applications. / PHD / We address search applications where a mobile search agent seeks to find an unknown number of stationary targets randomly distributed in a bounded search domain. The search agent is equipped with a search sensor that detects the targets at a location. Sensor measurements are often imperfect due to possible missed detections and false alarms. We also consider that the local environmental conditions affect the quality of the data acquired from the search sensor. For instance, if we are searching for a target that has a rocky shape, we expect that it will be harder to find that target in a rocky environment. We consider that the search mission is subject to a time or distance constraint, and thus, search can be performed on only a subset of locations. Our goal in this study is to formally determine where to acquire the search measurements so that the search effectiveness can be maximized. We also formally define the value of acquiring environmental information for improving the effectiveness of a search mission, and we develop methods for optimal deployment of assets that can acquire environmental information in order to improve search effectiveness. Finally, we address the cases where multiple search assets collaboratively search the environment and they can communicate their local information with each other. We are particularly interested in determining when a vehicle should communicate with another vehicle so that the joint search effectiveness can be improved. Our contributions to search theory address important applications that range from subsea mine-hunting to post-disaster search and rescue applications.

This dissertation addresses a fundamental question of multi-agent coordination: what infor- mation should be sent to whom and when, with the limited resources available to each agent? Communication requirements for multi-agent systems can be rather high when an accurate picture of the environment and the state of other agents must be maintained. To reduce the impact of multi-agent coordination on networked systems, e.g., power and bandwidth, this dissertation introduces new concepts to enable Intelligent Knowledge Distribution (IKD), including Constrained-action POMDPs (CA-POMDP) and concurrent decentralized (CoDec) POMDPs for an agnostic plug-and-play capability for fully autonomous systems. Each agent runs a CoDec POMDP where all the decision making (motion planning, task allocation, asset monitoring, and communication) are separated into concurrent individual MDPs to reduce the combinatorial explosion of the action and state space while maintaining dependencies between the models. We also introduce the CA-POMDP with action-based constraints on partially observable Markov decision processes, rewards driven by the value of information, and probabilistic constraint satisfaction through discrete optimization and Markov chain Monte Carlo analysis. IKD is adapted real-time through machine learning of the actual environmental impacts on the behavior of the system, including collaboration strategies between autonomous agents, the true value of information between heterogeneous systems, observation probabilities and resource utilization. / Doctor of Philosophy / This dissertation addresses a fundamental question behind when multiple autonomous sys- tems, like drone swarms, in the field need to coordinate and share data: what information should be sent to whom and when, with the limited resources available to each agent? Intelligent Knowledge Distribution is a framework that answers these questions. Communication requirements for multi-agent systems can be rather high when an accurate picture of the environment and the state of other agents must be maintained. To reduce the impact of multi-agent coordination on networked systems, e.g., power and bandwidth, this dissertation introduces new concepts to enable Intelligent Knowledge Distribution (IKD), including Constrained-action POMDPs and concurrent decentralized (CoDec) POMDPs for an agnostic plug-and-play capability for fully autonomous systems. The IKD model was able to demonstrate its validity as a "plug-and-play" library that manages communications between agents that ensures the right information is being transmitted at the right time to the right agent to ensure mission success.

Unfavorable environmental and (or) human displacement may engender the need for Search and Rescue (SAR). Challenges such as inaccessibility, large search areas, and heavy reliance on available responder count, limited equipment and training makes SAR a challenging problem. Additionally, SAR operations also pose significant risk to involved responders. This opens a remarkable opportunity for robotic systems to assist and augment human understanding of the harsh environments. A large body of work exists on the introduction of ground and aerial robots in visual and temporal inspection of search areas with varying levels of autonomy. Unfortunately, limited autonomy is the norm in such systems, due to the limitations presented by on-board UAV resources and networking capabilities. In this work we propose a new multi-agent approach to SAR and introduce a wearable compute cluster in the form factor of a backpack. The backpack allows offloading compute intensive tasks such as Lost Person Behavior Modelling, Path Planning and Deep Neural Network based computer vision applications away from the UAVs and offers significantly high performance computers to execute them. The backpack also provides for a strong networking backbone and task orchestrators which allow for enhanced coordination and resource sharing among all the agents in the system. On the basis of our benchmarking experiments, we observe that the backpack can significantly boost capabilities and success in modern SAR responses. / Master of Science / Unfavorable environmental and (or) human displacement may engender the need for Search and Rescue (SAR). Challenges such as inaccessibility, large search areas, and heavy reliance on available responder count, limited equipment and training makes SAR a challenging problem. Additionally, SAR operations also pose significant risk to involved responders. This opens a remarkable opportunity for robotic systems to assist and augment human understanding of the harsh environments. A large body of work exists on the introduction of ground and aerial robots in visual and temporal inspection of search areas with varying levels of autonomy. Unfortunately, limited autonomy is the norm in such systems, due to the limitations presented by on-board UAV resources and networking capabilities. In this work we propose a new multi-agent approach to SAR and introduce a wearable compute cluster in the form factor of a backpack. The backpack allows offloading compute intensive tasks such as Lost Person Behavior Modelling, Path Planning and Deep Neural Network based computer vision applications away from the UAVs and offers significantly high performance computers to execute them. The backpack also provides for a strong networking backbone and task orchestrators which allow for enhanced coordination and resource sharing among all the agents in the system. On the basis of our benchmarking experiments, we observe that the backpack can significantly boost capabilities and success in modern SAR responses.

<p dir="ltr">Increased frequency and intensity of disasters necessitate the dynamic post-disaster recovery process. Developing human mobility patterns, household return decision-making models, and agent-based simulations in disaster management has opened a new door towards more intricate and enduring recovery frameworks. Despite these opportunities, the importance of a unified framework is underestimated to identify the underlying mechanisms hindering the post-disaster recovery process. My research has been geared towards forging advancements in civil and disaster management, focusing on two main areas: (1) modeling the post-disaster recovery process and (2) identifying critical transitions within the recovery process.</p><p dir="ltr">My dissertation explores the collective and individual dynamics of post-disaster recovery across different spatial and temporal scales. I have identified the best recovery strategies for various contexts by constructing data-driven socio-physical multi-agent systems. Employing various advanced computational methodologies, including machine learning, system dynamics, causal discovery, econometrics, and network analysis, has been instrumental. I start with aggregated level analysis for post-disaster recovery. Initially, I examined the system dynamics model for the post-discovery recovery process in socio-physical systems, using normalized visit density of points of interest and power outage information. Through counterfactual analyses of budget allocation strategies, I discovered their significant impact on recovery trajectories, noting that specific budget allocations substantially enhance recovery patterns. I also revealed the urban-rural dissimilarity by the data-driven causal discovery approach. I utilized county-level normalized visit density of points of interest and nighttime light data to identify the relationship between counties. I found that urban and rural areas have similar but different recovery patterns across different types of points of interest.</p><p dir="ltr">Moving from aggregated to disaggregated level analysis on post-disaster recovery, I investigated household-level decision-making regarding disaster-induced evacuation and return behaviors. The model yielded insights into the varying influences of certain variables across urban and rural contexts. Subsequently, I developed a unified framework integrating aggregated and disaggregated level analyses through multilayer multi-agent systems to model significant shifts in the post-disaster recovery process. I evaluated various scenarios to pinpoint conditions for boosting recovery and assessing the effects of different intervention strategies on these transitions. Lastly, a comparison between mathematical models and graph convolutional networks was conducted to better understand the conditions leading to critical transitions in the recovery process. The insights and methodologies presented in this dissertation contribute to the broader understanding of the disaster recovery process in complex urban systems, advocating for a shift towards a unified framework over individual models. By harnessing big data and complex systems modeling, I can achieve a detailed quantitative analysis of the disaster recovery process, including critical transition conditions of the post-disaster recovery. This approach facilitates the evaluation of such recovery policies through inter-regional comparisons and the testing of various policy interventions in counterfactual scenarios.</p>

A cyber-physical control system (CPS) typically consists of a set of physical subsystems, their remote terminal units, a central control center (if applicable), and local communication networks that interconnect all the components to achieve a common goal. Applications include energy systems, autonomous vehicles, and collaborative robots. Ensuring stability, performance, and resilience in CPS requires thorough analysis and control design, utilizing robust algorithms to handle delays, communication failures, and potential cyber-attacks. Time delays are a challenge in CPS, particularly in teleoperation systems, where human operators remotely control robotic systems. These delays cause chattering, oscillations, and instability, making it difficult to achieve smooth and stable remote robot control. Applications like remote surgery, space exploration, and hazardous environment operations are highly susceptible to these disruptions. To address this issue, a novel passivity-shortage framework is proposed, that enables systems to maintain stability and transparency despite time-varying communication delays and environmental disturbances. CPS are prone to attacks, particularly Denial-of-Service (DoS) attacks, which disrupt the normal functioning of a network by overwhelming it with excessive internet traffic, rendering the communication channels unavailable to legitimate users. These attacks threaten the stability and functionality of CPS. To enhance resilience in multi-agent systems, novel distributed algorithms are proposed. These graph theory-based algorithms mitigate network vulnerabilities by incorporating strategically placed additional communication channels, thereby increasing tolerance to attacks in large, dynamic networks. The effectiveness of these proposed approaches is validated through simulations, experiments, and numerical examples. The passivity-shortage teleoperation strategies are tested using Phantom Omni devices and they show reduced chattering and better steady-state error convergence. A case study demonstrates how the proposed distributed algorithms effectively achieve consensus, even when some agents are disconnected from the network due to DoS attacks.

Optimizing connected automated vehicle movements through roadway intersections is a challenging problem. Traditional traffic control strategies, such as traffic signals are not optimal, especially for heavy traffic. Alternatively, centralized automated vehicle control strategies are costly and not scalable given that the ability of a central controller to track and schedule the movement of hundreds of vehicles in real-time is highly questionable. In this research, a series of fully distributed heuristic algorithms are proposed where vehicles in the vicinity of an intersection continuously cooperate with each other to develop a schedule that allows them to safely proceed through the intersection while incurring minimum delays. An algorithm is proposed for the case of an isolated intersection then a number of algorithms are proposed for a network of intersections where neighboring intersections communicate directly or indirectly to help the distributed control at each intersection makes a better estimation of traffic in the whole network. An algorithm based on the Godunov scheme outperformed optimized signalized control. The simulated experiments show significant reductions in the average delay. The base algorithm is successfully added to the INTEGRATION micro-simulation model and the results demonstrate improvements in delay, fuel consumption, and emissions when compared to roundabout, signalized, and stop sign controlled intersections. The study also shows the capability of the proposed technique to favor emergency vehicles, producing significant increases in mobility with minimum delays to the other vehicles in the network. / Ph. D. / Intelligent self-driving cars are getting much closer to reality than fiction. Technological advances make it feasible to produce such vehicles at low affordable cost. This type of vehicles is also promising to significantly reduce car accidents saving people lives and health. Moreover, the congested roads in cities and metropolitan areas especially at rush hours can benefit from this technology to avoid or at least to reduce the delays experienced by car passengers during their trips. One major challenge facing the operation of an intelligent self-driving car is how to pass an intersection as fast as possible without any collision with cars approaching from other directions of the intersection. The use of current traffic lights or stop signs is not the best choice to make the best use of the capabilities of future cars. In this dissertation, the aim is to study and propose ways to make sure the future intersections are ready for such self-driving intelligent cars. Assuming that an intersection has no type of traditional controls such as traffic lights or stop signs, this research effort shows how vehicles can pass safely with minimum waiting. The proposed techniques focus on providing lowcost solutions that do not require installation of expensive devices at intersections that makes it difficult to be approved by authorities. The proposed techniques can be applied to intersections of various sizes. The algorithms in this dissertation carefully design a way for vehicles in a network of intersections to communicate and cooperate while passing an intersection. The algorithms are extensively compared to the case of using traffic lights, stop signs, and roundabouts. Results show significant improvement in delay reduction and fuel consumption when the proposed techniques are used.

In decentralised multi-agent reinforcement learning communication can be used as a measure to increase coordination among the agents. At the same time, the essence of message exchange and its contribution to successful goal achievement can only be established with the domain knowledge of a given environment. This thesis focuses on understanding the impact of communication on a decentralised multi-agent system. To achieve this, communication is employed and studied in the context of Urban Air Mobility, in particular- to the vertiport terminal area control problem. A proposed in this work experimental framework, that promotes different information exchange protocols, allows to investigate if and how the agents leverage their communication capabilities. Acquired simulation results show that in the terminal area of a vertiport the aircrafts, controlled in a decentralised way, are capable of proper self-organisation, similar to the structured technique formulated in [Bertram and Wei(2020)]. A study of their communication mechanisms indicates that through different protocols the agents learn to signal their intent to enter a vertiport regardless of environment settings.