- About
- Events
- Calendar
- Graduation Information
- Cornell Tech Colloquium
- Student Colloquium
- BOOM
- Spring 2024 Colloquium
- Conway-Walker Lecture Series
- Salton 2023 Lecture Series
- Seminars / Lectures
- Big Red Hacks
- Cornell University - High School Programming Contests 2024
- Game Design Initiative
- CSMore: The Rising Sophomore Summer Program in Computer Science
- Explore CS Research
- ACSU Research Night
- Cornell Junior Theorists' Workshop 2024
- People
- Courses
- Research
- Undergraduate
- M Eng
- MS
- PhD
- Admissions
- Current Students
- Computer Science Graduate Office Hours
- Business Card Policy
- Cornell Tech
- Curricular Practical Training
- Exam Scheduling Guidelines
- Fellowship Opportunities
- Field of Computer Science Ph.D. Student Handbook
- Graduate TA Handbook
- Field A Exam Summary Form
- Graduate School Forms
- Instructor / TA Application
- Ph.D. Requirements
- Ph.D. Student Financial Support
- Special Committee Selection
- Travel Funding Opportunities
- Travel Reimbursement Guide
- The Outside Minor Requirement
- Diversity and Inclusion
- Graduation Information
- CS Graduate Minor
- Outreach Opportunities
- Parental Accommodation Policy
- Special Masters
- Student Spotlights
- Contact PhD Office
Active Imperception and Robotic Privacy
Abstract: In late July last year it came to light that iRobot Corp. intended to sell the maps that modern Roomba vacuum cleaning robots build to help them navigate. This caused a public furore among consumers. This situation and several others (e.g., nuclear inspection, use of untrusted cloud computing infrastructure) suggest that we might be interested in limiting what information a robot might divulge. How should we think about robotic privacy? In this talk I'll describe a few recent ways we've been examining the foundations of robotic privacy. This will include a privacy-preserving tracking problem, where we'll look at how one might think about estimators which are constrained so as to ensure they never know too much. And also how we can solve planning problems subject to stipulations on the information divulged during plan execution. The idea is to have robots that obtain knowledge strictly on a need to know basis. I'll address the question of how to formulate and solve planning and filtering problems subject to informational constraints.
Bio: Dylan Shell is an associate professor of Computer Science and Engineering at Texas A&M University. His research aims to synthesize and analyze complex, intelligent behaviour in robotic systems. His work has been funded by the National Science Foundation, the Department of Energy, and DARPA. He has been the recipient of an NSF Career award, the Montague Teaching award, the George Bekey Service award, and multiple best reviewer awards. For academic year 2018-19 he is very fortunate to be the Mary Shepard B. Upson Visiting Professor in Engineering at Cornell University.