Search Constraints

Start Over
Filtering by: Alternative title ssim 95-80-01 Remove constraint Alternative title ssim: 95-80-01 Advisor Tadepalli, Prasad Remove constraint Advisor: Tadepalli, Prasad Committee Member Fern, Alan Remove constraint Committee Member: Fern, Alan

Search Results

  • Domain-Independent Planning for Markov Decision Processes with Factored State and Action Spaces

    Creator:
    Raghavan, Aswin
    Abstract:
    Markov Decision Processes (MDPs) are the de-facto formalism for studying sequential decision making problems with uncertainty, ranging from classical problems such as inventory control and path planning, to more complex problems such as reservoir control under rainfall uncertainty and emergency response optimization for fire and medical emergencies. Most prior research...
    Resource Type:
    Dissertation
    Full Text:
    . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 93 6.4 Learning an RDDL Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . 95 7

  • Scaling multiagent reinforcement learning

    Creator:
    Proper, Scott
    Abstract:
    Reinforcement learning in real-world domains suffers from three curses of dimensionality: explosions in state and action spaces, and high stochasticity or "outcome space" explosion. Multiagent domains are particularly susceptible to these problems. This thesis describes ways to mitigate these curses in several different multiagent domains, including real-time delivery of products...
    Resource Type:
    Dissertation
    Full Text:
    Algorithm . . . . . . . . . . . . . . . . . . . . 80 5.5.2 Dynamic Coordination

  • Effective decision-theoretic assistance through relational hierarchical models

    Creator:
    Natarajan, Sriraam
    Abstract:
    Building intelligent computer assistants has been a long-cherished goal of AI. Many intelligent assistant systems were built and fine-tuned to specific application domains. In this work, we develop a general model of assistance that combines three powerful ideas: decision theory, hierarchical task models and probabilistic relational languages. We use the...
    Resource Type:
    Dissertation
    Full Text:
    . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 79 3.7 Conclusion and Future Work . . . . . . . . . . . . . . . . . . . . . . . . . . 80 4 A

  • Planning in multi-agent partially observable domains using sparse sampling

    Creator:
    Donneau-Golencer, Thierry D.
    Abstract:
    A large number of sequential decision-making problems in uncertain environments can be modeled as Markov Decision Processes (MDPs). In such settings, an agent can observe at each time step the state of the environment and then executes an action, causing a stochastic transition to a new state of the environment...
    Resource Type:
    Masters Thesis
    Full Text:
    ?<>���9D"�+D9Qixj�v&2*^&2I�01� w&2/�*Œ��@L-0/D\I^&2 "D\� D

  • Active Learning from Examples, Queries and Explanations

    Creator:
    Hamidi-Haines, Mandana
    Abstract:
    Humans are remarkably efficient in learning by interacting with other people and observing their behavior. Children learn by watching their parents’ actions and mimic their behavior. When they are not sure about their parents demonstration, they communicate with them, ask questions, and learn from their feedback. On the other hand,...
    Resource Type:
    Dissertation
    Full Text:
    , where n ∈ {0, 1, 2, 3, 4, 5} . . . . . . . . . . . . . . . . . . . . . . . . . . 80 LIST OF FIGURES

  • Hierarchical structure discovery and transfer in sequential decision problems

    Creator:
    Mehta, Neville
    Abstract:
    Acting intelligently to efficiently solve sequential decision problems requires the ability to extract hierarchical structure from the underlying domain dynamics, exploit it for optimal or near-optimal decision-making, and transfer it to related problems instead of solving every problem in isolation. This dissertation makes three contributions toward this goal. The first...
    Resource Type:
    Dissertation
    Full Text:
    . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 95 5.5.1 Autonomous Hierarchical Decomposition . . . . . . . . . . . . . . 95 5.5.2 Transfer

  • Monte Carlo Counterfactual Regret Minimization applied to Clue

    Creator:
    Martin, Benjamin
    Abstract:
    This document analyzes the application of Monte Carlo Counterfactual Regret Minimization (MCCFR) in the game of Hasboro’s Clue. As a partially observable stochastic multiplayer game, Clue is well-suited for MCCFR methods. MCCFR has previously been shown to be effective in beating top human players around the world in No-Limit Texas...
    Resource Type:
    Honors College Thesis
    Full Text:
    played 10,000 games in 3 different positions each. The 95% confidence interval after 30,000 games played