PhD Thesis Defense
Benjamin Stephens
Carnegie Mellon University

Push Recovery Control for Force-Controlled Humanoid Robots

Event Location: GHC 6115Abstract: Humanoid robots represent the state of the art in complex robot systems, but the design of controllers can be challenging and tedious. High performance controllers that can handle unknown perturbations will be required if complex robots are to one day interact safely with people in everyday environments. The high degree of [...]

PhD Thesis Defense
Anton Chechetka
Carnegie Mellon University

Query-Specific Learning and Inference for Probabilistic Graphical Models

Event Location: GHC 4405Abstract: In numerous real world applications, from sensor networks to computer vision to natural text processing, one needs to reason about the system in question in the face of uncertainty. A key problem in all those settings is to compute the probability distribution over the variables of interest (the query) given the [...]

PhD Thesis Defense
Ross A. Knepper
Carnegie Mellon University

On the Fundamental Relationships Among Path Planning Alternatives

Event Location: NSH 1305Abstract: Robotic motion planning aspires to match the ease and efficiency with which humans move through and interact with their environment. Yet state of the art robotic planners fall short of human abilities; they are slower in computation, and the results are often of lower quality. One stumbling block in traditional motion [...]

PhD Thesis Defense
Nik A. Melchior
Carnegie Mellon University

Graph-based Trajectory Planning through Programming by Demonstration

Event Location: NSH 1507Abstract: Autonomous robots are becoming increasingly commonplace in industry, space exploration, and even domestic applications. These diverse fields share the need for robots to perform increasingly complex motion behaviors for interacting with the world. As the robots' tasks become more varied and sophisticated, though, the challenge of programming them becomes more difficult [...]

PhD Thesis Defense
Gregory John Barlow
Carnegie Mellon University

Improving Memory for Optimization and Learning in Dynamic Environments

Event Location: NSH 1507Abstract: Many problems considered in optimization and artificial intelligence research are static: information about the problem is known a priori, and little to no uncertainty about this information is presumed to exist. Most real problems, however, are dynamic: information about the problem is released over time, uncertain events may occur, or the [...]

PhD Thesis Defense
Ling Xu
Carnegie Mellon University

Graph Planning for Environmental Coverage

Event Location: NSH 1305Abstract: Tasks such as street mapping and security surveillance seek a route that traverses a given space to perform a function. These task functions may involve mapping the space for accurate modeling, sensing the space for unusual activity, or searching the space for objects. When these tasks are performed autonomously by robots, [...]

PhD Thesis Defense
Samuel T. Clanton
Carnegie Mellon University

Brain-Computer Interface Control of an Anthropomorphic Robotic Arm

Event Location: NSH 1305Abstract: This thesis describes a brain-computer interface (BCI) system that was developed to allow direct cortical control of 7 active degrees of freedom in a robotic arm. Two monkeys with chronic microelectrode implants in their motor cortices were able to use the arm to complete an oriented grasping task under brain control. [...]

PhD Thesis Defense
Matthew McNaughton
Carnegie Mellon University

Parallel Algorithms for Real-time Motion Planning

Event Location: NSH 1305Abstract: For decades, humans have dreamed of making cars that could drive themselves, so that travel would be less taxing, and the roads safer for everyone. Toward this goal, we have made strides in motion planning algorithms for autonomous cars, using a powerful new computing tool, the parallel graphics processing unit (GPU). [...]

PhD Thesis Defense
Jonathan Chung-Kuan Huang
Carnegie Mellon University

Probabilistic Reasoning and Learning on Permutations: Exploiting Structural Decompositions of the Symmetric Group

Event Location: NSH 1305Abstract: Probabilistic reasoning and learning with permutation data arises as a fundamental problem in myriad applications such as modeling preference rankings over objects (such as webpages), tracking multiple moving objects, reconstructing the temporal ordering of events from multiple imperfect accounts, and more. Since the number of permutations scales factorially with the number [...]

PhD Thesis Defense
Tomasz Malisiewicz
Carnegie Mellon University

Recognizing and Interpreting Objects With the Visual Memex

Event Location: NSH 1305Abstract: Recognizing and reasoning about the objects found in an image is one of the key problems in computer vision. This thesis is based on the idea that in order to understand a novel object, it is often not enough to recognize the object category it belongs to (i.e., answering “What is [...]