Coordinated multi-robot planning while preserving individual privacy

People

Li Li,Alfredo Bayuelo, Leonardo Bobadilla,Tauhidul Alam, and Dylan A. Shell

Motivation

Multiple robots operating concurrently often can achieve their ends more efficiently by cooperating to mediate their use of shared resources. But, as the information that the robots possess is sensitive or restricted, this poses the question of how to preserve individual privacy whilst coordinating. To show the practical feasibility of Secure Multi-Party Computation in Robotics and Autonomous Systems, we examine several particular scenarios where we envision it being relevant to the context of coordination among robots, and propose three secure path intersection protocols: For more details, you can check our paper

Details

The below videos demonstrate, using a physical environment and a virtual simulator, how privacy preserving coordination can be used to:

Simulation of Privacy-Preserving 2D Paths

   
  Two paths consisting of 12 segments each. Four segments from Alice (Red) are securely compared to four segments from Bob(Blue) we call this a round. At time 0:20 they securely determine that no collision exists, so they can move simultaneously. At time 0:40 they securely determine that collision do exists for next round, so they randomly takes turns to move.  


Privacy-Preserving Persistent Monitoring

   
  An experimental evaluation of the privacy-preserving persistent monitoring task for two parties Alice and Bob using two iRobot Create 2.0.  


Simulation of Privacy-Preserving Collision Detection in 3D

   
  A privacy-preserving persistent monitoring task in a 3D space (2D workspace and time as a dimension). Two paths might collide in different time stamps in 2D, these collisions are discarded by adding time as a 3rd coordinate.  


Privacy-Preserving Collision Detection

   
  An experimental evaluation of the privacy-preserving collision detection in 2D using time as a third coordinate.