Title:
Robots with Privacy Stipulations

dc.contributor.author Shell, Dylan
dc.contributor.corporatename Georgia Institute of Technology. Institute for Robotics and Intelligent Machines en_US
dc.contributor.corporatename Texas A & M University en_US
dc.date.accessioned 2018-03-08T18:12:30Z
dc.date.available 2018-03-08T18:12:30Z
dc.date.issued 2018-02-14
dc.description Presented on February 14, 2018 from 12:15 p.m.-1:15 p.m. in the Marcus Nanotechnology Building, Rooms 1116-1118, Georgia Tech. en_US
dc.description Dylan Shell is an associate professor in the Department of Computer Science and Engineering at Texas A&M University. His research focuses on systems that exploit their physical embedding to interact with the world, working to understand, design, and build such systems. He has published papers on multi-robot task allocation, biologically inspired multiple-robot systems, estimation of group-level swarm properties, minimalist- and multi-robot manipulation, rigid-body simulation and contact models, human-robot interaction, and robotic theatre. The National Science Foundation, the Department of Energy, and DARPA have funded Shell’s work. He has been the recipient of an NSF Career award, the Montague Teaching award, the George Bekey Service award, and multiple best reviewer awards. en_US
dc.description Runtime: 61:46 minutes en_US
dc.description.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 furor 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 line of research that is concerned with this question, starting by showing that cryptography doesn’t solve the problem. I’ll begin by examining a privacy-preserving tracking task, then look at how one might think about estimators that are constrained to ensure they never know too much. Finally, I’ll talk about planning subject to information disclosure constraints and introduce a useful structure that we call a “plan closure.” en_US
dc.format.extent 61:46 minutes
dc.identifier.uri http://hdl.handle.net/1853/59405
dc.language.iso en_US en_US
dc.publisher Georgia Institute of Technology en_US
dc.relation.ispartofseries IRIM Seminar Series
dc.subject Cryptography en_US
dc.subject Robotics en_US
dc.subject Robotics privacy en_US
dc.subject Robots en_US
dc.title Robots with Privacy Stipulations en_US
dc.type Moving Image
dc.type.genre Lecture
dspace.entity.type Publication
local.contributor.corporatename Institute for Robotics and Intelligent Machines (IRIM)
local.relation.ispartofseries IRIM Seminar Series
relation.isOrgUnitOfPublication 66259949-abfd-45c2-9dcc-5a6f2c013bcf
relation.isSeriesOfPublication 9bcc24f0-cb07-4df8-9acb-94b7b80c1e46
Files
Original bundle
Now showing 1 - 3 of 3
No Thumbnail Available
Name:
shell.mp4
Size:
496.09 MB
Format:
MP4 Video file
Description:
Download Video
No Thumbnail Available
Name:
shell_videostream.html
Size:
985 B
Format:
Hypertext Markup Language
Description:
Streaming Video
No Thumbnail Available
Name:
transcription.txt
Size:
62.29 KB
Format:
Plain Text
Description:
Transcription Text
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
3.13 KB
Format:
Item-specific license agreed upon to submission
Description:
Collections