MSR Thesis Defense
MSR Student
Robotics Institute,
Carnegie Mellon University

Learning for Perception and Strategy: Adaptive Omnidirectional Stereo Vision and Tactical Reinforcement Learning

Newell-Simon Hall 4305

Abstract: Multi-view stereo omnidirectional distance estimation usually needs to build a cost volume with many hypothetical distance candidates. The cost volume building process is often computationally heavy considering the limited resources a mobile robot has. We propose a new geometry-informed way of distance candidates selection method which enables the use of a very small number [...]

MSR Thesis Defense
MSR Student
Robotics Institute,
Carnegie Mellon University

Online-Adaptive Self-Supervised Learning with Visual Foundation Models for Autonomous Off-Road Driving

3305 Newell-Simon Hall

Abstract: Autonomous robot navigation in off-road environments currently presents a number of challenges. The lack of structure makes it difficult to handcraft geometry-based heuristics that are robust to the diverse set of scenarios the robot might encounter. Many of the learned methods that work well in urban scenarios require massive amounts of hand-labeled data, but [...]

PhD Thesis Proposal
PhD Student
Robotics Institute,
Carnegie Mellon University

Multimodal Representations for Adaptable Robot Policies in Human-Inhabited Spaces

NSH 4305

Abstract:  Human beings sense and express themselves through multiple modalities. To capture multimodal ways of human communication, I want to build adaptable robot policies that infer task pragmatics from video and language prompts, reason about sounds and other sensors, take actions, and learn mannerisms of interacting with people and objects. Existing solutions for robot policies [...]

PhD Thesis Defense
PhD Student
Robotics Institute,
Carnegie Mellon University

Interleaving Discrete Search and Continuous Optimization for Kinodynamic Motion Planning

NSH 4305

Abstract: Motion planning for dynamically complex robotic tasks requires explicit reasoning within constraints on velocity, acceleration, force/torque, and kinematics such as avoiding obstacles. To meet these constraints, planning algorithms must simultaneously make high-level discrete decisions and low-level continuous decisions. For example, pushing a heavy object involves making discrete decisions about contact locations and continuous decisions [...]