Digital Commons Network^™

Opportunities And Challenges From Major Disasters Lessons Learned Of Long-Term Recovery Group Members, Eduardo E. Landaeta

Graduate Program in International Studies Theses & Dissertations

Natural hazards caused by the alteration of weather patterns expose populations at risk, with an outcome of economic loss, property damage, personal injury, and loss of life. The unpredictability of disasters is a topic of concern to most governments. Disaster policies need more attention in aligning mitigation opportunities with disaster housing recovery (DHR). The effect of flooding, which primarily impacts housing in coastal areas, is one of the most serious issues associated with natural hazard. Flooding has a variety of causes and implications, especially for vulnerable populations who are exposed to it. DHR is complex, involving the need for effective …

Algorithmic Improvements In Deep Reinforcement Learning, Norman L. Tasfi

Electronic Thesis and Dissertation Repository

Reinforcement Learning (RL) has seen exponential performance improvements over the past decade, achieving super-human performance across many domains. Deep Reinforcement Learning (DRL), the combination of RL methods with deep neural networks (DNN) as function approximators, has unlocked much of this progress. The path to generalized artificial intelligence (GAI) will depend on deep learning (DL) and RL. However, much work is required before the technology reaches anything resembling GAI. Therefore, this thesis focuses on a subset of areas within RL that require additional research to advance the field, specifically: sample efficiency, planning, and task transfer. The first area, sample efficiency, refers …

Increasing The Value Of Information During Planning In Uncertain Environments, Gaurab Pokharel

Honors Papers

Prior studies have demonstrated that for many real-world problems, POMDPs can be solved through online algorithms both quickly and with near optimality [10, 8, 6]. However, on an important set of problems where there is a large time delay between when the agent can gather information and when it needs to use that information, these solutions fail to adequately consider the value of information. As a result, information gathering actions, even when they are critical in the optimal policy, will be ignored by existing solutions, leading to sub-optimal decisions by the agent. In this research, we develop a novel solution …

Algorithmic Robot Design: Label Maps, Procrustean Graphs, And The Boundary Of Non-Destructiveness, Shervin Ghasemlou

Theses and Dissertations

This dissertation is focused on the problem of algorithmic robot design. The process of designing a robot or a team of robots that can reliably accomplish a task in an environment requires several key elements. How the problem is formulated can play a big role in the design process. The ability of the model to correctly reflect the environment, the events, and different pieces of the problem is crucial. Another key element is the ability of the model to show the relationship between different designs of a single system. These two elements can enable design algorithms to navigate through the …

Multi-Agent Narrative Experience Management As Story Graph Pruning, Edward T. Garcia

University of New Orleans Theses and Dissertations

In this thesis I describe a method where an experience manager chooses actions for non-player characters (NPCs) in intelligent interactive narratives through story graph representation and pruning. The space of all stories can be represented as a story graph where nodes are states and edges are actions. By shaping the domain as a story graph, experience manager decisions can be made by pruning edges. Starting with a full graph, I apply a set of pruning strategies that will allow the narrative to be finishable, NPCs to act believably, and the player to be responsible for how the story unfolds. By …

Online Learning And Planning For Crowd-Aware Service Robot Navigation, Anoop Aroor

Dissertations, Theses, and Capstone Projects

Mobile service robots are increasingly used in indoor environments (e.g., shopping malls or museums) among large crowds of people. To efficiently navigate in these environments, such a robot should be able to exhibit a variety of behaviors. It should avoid crowded areas, and not oppose the flow of the crowd. It should be able to identify and avoid specific crowds that result in additional delays (e.g., children in a particular area might slow down the robot). and to seek out a crowd if its task requires it to interact with as many people as possible. These behaviors require the ability …

Probabilistic Programming For Theory Of Mind For Autonomous Decision Making, Iris Rubi Seaman

Theses and Dissertations

As autonomous agents (such as unmanned aerial vehicles, or UAVs) become more ubiquitous, they are being used for increasingly complex tasks. Eventually, they will have to reason about the mental state of other agents, including those agents' beliefs, desires and goals – so-called Theory of Mind – and make decisions based on that reasoning. We describe increasingly complex theory of mind models of a UAV pursuing an intruder, and show that (1) there is a natural Bayesian formulation to reasoning about the uncertainty inherent in our estimate of another agent's mental state, and that (2) probabilistic programming is a natural …

Generating Plans In Concurrent, Probabilistic, Over-Subscribed Domains, Li Li

Dissertations, Master's Theses and Master's Reports - Open

Planning in realistic domains typically involves reasoning under uncertainty, operating under time and resource constraints, and finding the optimal subset of goals to work on. Creating optimal plans that consider all of these features is a computationally complex, challenging problem. This dissertation develops an AO* search based planner named CPOAO* (Concurrent, Probabilistic, Over-subscription AO*) which incorporates durative actions, time and resource constraints, concurrent execution, over-subscribed goals, and probabilistic actions. To handle concurrent actions, action combinations rather than individual actions are taken as plan steps. Plan optimization is explored by adding two novel aspects to plans. First, parallel steps that serve …

Generalizing Agent Plans And Behaviors With Automated Staged Observation In The Real-Time Strategy Game Starcraft, Zackary A. Gill

Theses and Dissertations - UTB/UTPA

In this thesis we investigate the processes involved in learning to play a game. It was inspired by two observations about how human players learn to play. First, learning the domain is intertwined with goal pursuit. Second, games are designed to ramp up in complexity, walking players through a gradual cycle of acquiring, refining, and generalizing knowledge about the domain. This approach does not rely on traces of expert play. We created an integrated planning, learning and execution system that uses StarCraft as its domain. The planning module creates command/event groupings based on the data received. Observations of unit behavior …

Planning, Acting, And Learning In Incomplete Domains, Christopher H. Weber

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

The engineering of complete planning domain descriptions is often very costly because of human error or lack of domain knowledge. Learning complete domain descriptions is also very challenging because many features are irrelevant to achieving the goals and data may be scarce. Given incomplete knowledge of their actions, agents can ignore the incompleteness, plan around it, ask questions of a domain expert, or learn through trial and error.

Our agent Goalie learns about the preconditions and effects of its incompletely-specified actions by monitoring the environment state. In conjunction with the plan failure explanations generated by its planner DeFault, Goalie diagnoses …

Planning And Scheduling For Large-Scaledistributed Systems, Han Yu

Electronic Theses and Dissertations

Many applications require computing resources well beyond those available on any single system. Simulations of atomic and subatomic systems with application to material science, computations related to study of natural sciences, and computer-aided design are examples of applications that can benefit from the resource-rich environment provided by a large collection of autonomous systems interconnected by high-speed networks. To transform such a collection of systems into a user's virtual machine, we have to develop new algorithms for coordination, planning, scheduling, resource discovery, and other functions that can be automated. Then we can develop societal services based upon these algorithms, which hide …