Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 5 of 5
Full-Text Articles in Entire DC Network
Metareasoning For Heuristic Search Using Uncertainty, Tianyi Gu
Metareasoning For Heuristic Search Using Uncertainty, Tianyi Gu
Doctoral Dissertations
Heuristic search methods are widely used in many real-world autonomous systems. Yet, people always want to solve search problems that are larger than time allows. To address these challenging problems, even suboptimally, a planning agent should be smart enough to intelligently allocate its computational resources, to think carefully about where in the state space it should spend time searching. For finding optimal solutions, we must examine every node that is not provably too expensive. In contrast, to find suboptimal solutions when under time pressure, we need to be very selective about which nodes to examine. In this dissertation, we will …
Learning To Act With Robustness, Reazul Hasan Russel
Learning To Act With Robustness, Reazul Hasan Russel
Doctoral Dissertations
Reinforcement Learning (RL) is learning to act in different situations to maximize a numerical reward signal. The most common approach of formalizing RL is to use the frameworkof optimal control in an inadequately known Markov Decision Process (MDP). Traditional approaches toward solving RL problems build on two common assumptions: i) exploration is allowed for the purpose of learning the MDP model and ii) optimizing for the expected objective is sufficient. These assumptions comfortably hold for many simulated domains like games (e.g. Atari, Go), but are not sufficient for many real-world problems. Consider for example the domain of precision medicine for …
Metareasoning For Heuristic Search Using Uncertainty, Tianyi Gu
Metareasoning For Heuristic Search Using Uncertainty, Tianyi Gu
Doctoral Dissertations
Heuristic search methods are widely used in many real-world autonomous systems. Yet, people always want to solve search problems that are larger than time allows. To address these challenging problems, even suboptimally, a planning agent should be smart enough to intelligently allocate its computational resources, to think carefully about where in the state space it should spend time searching. For finding optimal solutions, we must examine every node that is not provably too expensive. In contrast, to find suboptimal solutions when under time pressure, we need to be very selective about which nodes to examine. In this dissertation, we will …
Essays In Network Theory Applications For Transportation Planning, Jeremy David Auerbach
Essays In Network Theory Applications For Transportation Planning, Jeremy David Auerbach
Doctoral Dissertations
Throughout the dissertation, network methods are developed to address pressing issues in transportation science and geography. These methods are applied to case studies to highlight their use for urban planners and social scientists working in transportation, mobility, housing, and health. The first chapter introduces novel network robustness measures for multi-line networks. This work will provide transportation planners a new tool for evaluating the resilience of transportation systems with multiple lines to failures. The second chapter explores optimizing network connectivity to maximize the number of nodes within a given distance to a focal node while minimizing the number and length of …
Planning For Communication Through Rehearsal Imagined Interactions, Martijn Jos Van Kelegom
Planning For Communication Through Rehearsal Imagined Interactions, Martijn Jos Van Kelegom
Doctoral Dissertations
Imagined interactions are mental representations of conversations with significant others. One function they may serve is as a rehearsal for an anticipated encounter. The process by which this rehearsal occurs is investigated using Dillard’s (1990) Goals-Plans-Action model and Berger’s (1997) Planning Theory of Communication. A causal model is proposed for the relationships between domain knowledge, use of retroactive imagined interactions, specificity, and discrepancy of the proactive imagined interaction. This model is tested using survey data (N = 210), and additional data were collected assessing characteristics of the anticipated conversations. Results and additional analyses suggest that rehearsal occurs in many …