In recent years, model-free Deep Reinforcement Learning (RL) has become an increasingly popular alternative to more traditional model-based or optimization-based control methods in solving robotic legged locomotion. However, deploying RL in the real world can be a significant undertaking. Constructing reward functions which compel controllers to learn the desired behavior...
Learning latent space representations of high-dimensional world states has been at the core of recent rapid growth in reinforcement learning(RL). At the same time, RL algo- rithms have suffered from ignored uncertainties in the predicted estimates of model-free or model-based methods. In our work, we investigate both of these aspects...
Reinforcement learning has emerged as a popular tool for solving control tasks, with multiple works focusing on the complex and dynamic task of locomotion. However, the naive application of reinforcement learning to this problem often produces maladaptive policies that exploit the model or reward function. This results in behavior that...
This thesis focuses on the problem of object tracking. Given a video, the general objective of tracking is to track the location over time of one or more targets in the image sequence. This is a very challenging task as algorithms need to deal with problems such as appearance variations,...
Legged robots have consistently captured our collective imagination through various forms of media, from Hollywood films, anime, and viral Youtube videos of robots accomplishing incredible feats of acrobatics. These robots have the potential to navigate our environments, capable of completing tasks that would otherwise require human intervention. However, developing controls...
We consider the problem of tactical assault planning in real-time strategy games where a team of friendly agents must launch an assault on an enemy. This problem offers many challenges including a highly dynamic and uncertain environment, multiple agents, durative actions, numeric attributes, and different optimization objectives. While the dynamics...
Dynamic bipedal locomotion is among the most difficult and yet relevant problems in modern robotics. While a multitude of classical control methods for bipedal locomotion exist, they are often brittle or limited in capability. In recent years, work in applying reinforcement learning to robotics has lead to superior performance across...
Automatic analysis of American football videos can help teams develop strategies and extract patterns with less human effort. In this work, we focus on the problem of automatically determining which team is on offense/defense, which is an important subproblem for higher-level analysis. While seemingly mundane, this problem is quite challenging...
Monte-Carlo Tree Search (MCTS) is an online-planning algorithm for decision-theoretic planning in domains with stochastic and combinatorial structure. The general applicability of MCTS makes it an ideal first choice to investigate when developing planners for complex applications requiring automated control and planning. The first contribution of this thesis is to...
Monte-Carlo planning algorithms such as UCT make decisions at each step by
intelligently expanding a single search tree given the available time and then
selecting the best root action. Recent work has provided evidence that it can be
advantageous to instead construct an ensemble of search trees and make a...