Search Constraints

Start Over
Filtering by: Creator Schreiber, Alan S. Remove constraint Creator: Schreiber, Alan S. Advisor Tadepalli, Prasad Remove constraint Advisor: Tadepalli, Prasad Rights Statement In Copyright Remove constraint Rights Statement: In Copyright

Search Results

  • Monte-Carlo planning for probabilistic domains

    Creator:
    Bjarnason, Ronald V.
    Abstract:
    This thesis presents a progression of novel planning algorithms that culminates in a new family of diverse Monte-Carlo methods for probabilistic planning domains. We provide a proof for performance guarantees and analyze how these algorithms can resolve some of the shortcomings of traditional probabilistic planning methods. The direct policy search...
    Resource Type:
    Dissertation
    Full Text:
    , 2009. Title: Monte-Carlo Planning for Probabilistic Domains Abstract approved: Prasad Tadepalli Alan

  • Bayesian methods for knowledge transfer and policy search in reinforcement learning

    Creator:
    Wilson, Aaron
    Abstract:
    How can an agent generalize its knowledge to new circumstances? To learn effectively an agent acting in a sequential decision problem must make intelligent action selection choices based on its available knowledge. This dissertation focuses on Bayesian methods of representing learned knowledge and develops novel algorithms that exploit the represented...
    Resource Type:
    Dissertation
    Full Text:
    Tadepalli Alan Fern How can an agent generalize its knowledge to new circumstances? To learn effectively

  • Coactive learning for multi-robot search and coverage

    Creator:
    Potanapalli, Kranti Kumar
    Abstract:
    We investigate a search and coverage planning problem, where an area of interest has to be explored by a number of vehicles, given a fixed time budget. A good coverage plan has a low probability of a target remaining unobserved. We introduce a formal problem statement, suggest a greedy algorithm...
    Resource Type:
    Masters Thesis
    Full Text:
    : Coactive Learning for Multi-robot Search and Coverage. Abstract approved: Prasad Tadepalli Alan

  • Integrating learning and search for structured prediction

    Creator:
    Doppa, Janardhan Rao
    Abstract:
    We are witnessing the rise of the data-driven science paradigm, in which massive amounts of data - much of it collected as a side-effect of ordinary human activity - can be analyzed to make sense of the data and to make useful predictions. To fully realize the promise of this...
    Resource Type:
    Dissertation
    Full Text:
    : Integrating Learning and Search for Structured Prediction Abstract approved: Prasad Tadepalli Alan P. Fern

  • 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:
    _____________________________________________________________________ Alan Fern, Committee Member, representing Department of Computer Science

  • 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:
    grateful for the opportunities that he gave me to travel, and attend the conferences. Professor Alan Fern

  • 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:
    \<>�9I_<"��� D\� -2:s<"��� �!/K')�+ \-0/�HJ�!/K���9/_�quG�q3 8!1�<>�!D &E/v&289<"�+-0/sQ

  • 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:
    committee members, Dr. Thomas Dietterich, Dr. Alan Fern and Dr. Weng-Keen Wong for the innumerable

  • 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:
    completed. In addition I would like to thank the members of my committee: Tom Dietterich, Alan Fern, Ron

  • 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:
    together with Alan Fern on a few projects and he has been an inspiring collaborator and advisor. His