Search Constraints

Start Over
Filtering by: Creator Webb, Jonathan K. Remove constraint Creator: Webb, Jonathan K. Committee Member Fern, Alan Remove constraint Committee Member: Fern, Alan

Search Results

  • Agile Bipedal Locomotion via Hierarchical Control by Incorporating Physical Principles, Learning, and Optimization

    Creator:
    Green, Kevin
    Abstract:
    Robotic Bipedal locomotion holds the potential for efficient, robust traversal of difficult terrain. The difficulty lies in the dynamics of locomotion which complicate control and motion planning. Bipedal locomotion dynamics are dimensionally large problems, extremely nonlinear, and operate on the limits of actuator capabilities, which limit the performance of generic...
    Resource Type:
    Dissertation
    Full Text:
    Optimization Abstract approved: Jonathan Hurst Ross L. Hatton Robotic Bipedal locomotion holds the potential

  • Agile Bipedal Maneuvers Optimized then Learned from Single Rigid-Body Model Dynamics

    Creator:
    Batke, Ryan
    Abstract:
    As bipedal robots move ever closer to being integrated into all manner of real world envi-ronments there is a necessity to push their dynamic capabilities to meet or exceed those of humans and animals. Advancements must be made to address ordinary challenges that arise everyday in the same environments that...
    Resource Type:
    Masters Thesis
    Full Text:
    Maneuvers Optimized then Learned from Single Rigid-Body Model Dynamics Abstract approved: Jonathan Hurst

  • Activity recognition in desktop environments

    Creator:
    Shen, Jianqiang
    Abstract:
    Knowledge workers are struggling in the information flood. There is a growing interest in intelligent desktop environments that help knowledge workers organize their daily life. Intelligent desktop environments allow the desktop user to define a set of “activities” that characterize the user’s desktop work. These environments then attempt to identify...
    Resource Type:
    Dissertation
    Full Text:
    TaskPredictor for FA as a function of the number of selected features K. Error bars denote 95% confidence

  • Decentralized Multi-Robot Exploration with Sparse Communication through Deep Imitation Learning

    Creator:
    Senewiratne, Yomal K.
    Abstract:
    We present a method for decentralized, multi-robot exploration in adverse environments where communication is minimal. A key conceptual feature of our method is enabling implicit coordination between robots by training a Convolutional Neural Network (CNN) as a heuristic for planning using Monte Carlo Tree Search (MCTS). Our method consists of...
    Resource Type:
    Masters Thesis

  • Statistical Properties and Guarantees for Certain Anomaly Detection Relevant Problems

    Creator:
    Liu, Si
    Abstract:
    Anomaly detection aims at detecting the points that appear different than the majority of the data, such that they are suspected to be generated from a different distribution. Anomaly detectors have been applied in many different fields, such as detecting fraudulent behaviors in bank transaction, finding broken sensors in a...
    Resource Type:
    Dissertation
    Full Text:
    detector iForest, for the purpose of outputting the top k most anomalous points as early as possible. The

  • Enhancing Search-Based Techniques with Information Control Dependencies

    Creator:
    Aburas, Ali
    Abstract:
    Software testing is a very important task during software development and it can be used to improve the quality and reliability of the software system. One potential way to reduce the cost and increase the efficiency of software testing is to generate test data automatically. Search-based approaches successfully generate unit...
    Resource Type:
    Dissertation

  • Fine-Grained Object Recognition Under Limited Training Data

    Creator:
    Lam, Michael Q.
    Abstract:
    This dissertation addresses object recognition in challenging settings, where distinct object classes are visually very similar (e.g., species of birds and insects) and/or access to training examples of object classes is limited (e.g., due to the associated high costs of data annotation). In this dissertation, we present a variety of...
    Resource Type:
    Dissertation
    Full Text:
    1...K: ψunary(x,y)= [ ∑ni=1 I(yi = 1)φ(xi) , . . . , ∑ni=1 I(yi =K)φ(xi) ] . In the Nematocyst

  • Toward Disentangling the Activations of the Deep Networks via Low-dimensional Embedding and Non-negative Factorization

    Creator:
    Khorram, Saeed
    Abstract:
    In this thesis, we introduce a novel Explanation Neural Network (XNN) to explain the predictions made by a deep network. The XNN works by embedding a high-dimensional activation vector of a deep network layer non-linearly into a low-dimensional explanation space while retaining faithfulness i.e., the original deep learning predictions can...
    Resource Type:
    Masters Thesis
    Full Text:
    feature is viEi, the product of the weight of the x-feature in the approxi- mation of ŷ(k) timed by the

  • Counterfactual States for Atari Agents via Generative Deep Learning

    Creator:
    Olson, Matthew L.
    Abstract:
    Although deep reinforcement learning agents have produced impressive results in many domains, their decision making is difficult to explain to humans. To address this problem, past work has mainly focused on explaining why an action was chosen in a given state. A different type of explanation that is useful is...
    Resource Type:
    Masters Thesis
    Full Text:
    ) = || ∫ Z k(z, ·)dDZ(z)− ∫ Z k(z, ·)dEZ(z)||Hk (3.5) and Hk is a reproducing kernel Hilbert space, and an

  • Action Segmentation with Limited Supervision

    Creator:
    Li, Jun
    Abstract:
    In this dissertation, we address action segmentation in videos under limited supervision. The goal of action segmentation is to predict an action class for each frame of a video. The limited supervision means ground truth labels of video frames are not available in training. We focus on three types of...
    Resource Type:
    Dissertation
    Full Text:
    c1:N that belongs to the set ofK action classes, i.e. cn ∈ C = {1, 2, ...,K}. Its ground-truth set