Privacy-Preserving Multi-Robot Task Allocation via Secure Multi-Party Computation

摘要

Multi-robot task allocation is a practical way to identify synergies between robots. When all the robots within a system fall under the auspices and authority of a single organization, they can simply be compelled to share their information and participate in cooperative protocols. But when, for instance, they are rivals vying in the marketplace, their own private data may be copyrighted or sensitive, so that disclosing information may erode a competitive advantage. Yet, even limited cooperation, by offering some arbitrage of common resources (such as shared infrastructure), often reduces costs for all parties; indeed, competition and cooperation are not mutually exclusive. We examine the question of how to allocate robots to tasks optimally while ensuring that no task valuations, utilities, positions, or related data are released. We do this via an auction-based assignment algorithm implemented using secure multi-party computation operations, without requiring any trusted auctioneer. The approach offers precise and effective privacy guarantees that are stronger than present methods. We demonstrate the feasibility of the approach via tests in a case study inspired by autonomous driving. First, we tested the approach in a single-computer setup, using parties with virtual network interfaces, where we studied the effects of varying the number of parties and the associated parameters of the auction. Next, we tested the approach in a decentralized, physical test-bed using single board computers running over a WiFi LAN network. Finally, we conducted a small proof-of-concept experiment using two autonomous mobile robots performing a decentralized, private auction.