Logo image
Distributed Attack-Robust Submodular Maximization for Multirobot Planning
Journal article   Open access   Peer reviewed

Distributed Attack-Robust Submodular Maximization for Multirobot Planning

Lifeng Zhou, Vasileios Tzoumas, George J. Pappas and Pratap Tokekar
IEEE transactions on robotics, v 38(5), pp 3097-3112
Oct 2022
url
https://doi.org/10.1109/tro.2022.3161765View
Accepted (AM)Open Access (Publisher-Specific) Open

Abstract

Adversarial attacks approximation algorithm Approximation algorithms distributed optimization Multi-robot systems multirobot planning Planning Robot kinematics Robot sensing systems robust optimization submodular optimization Target tracking Task analysis
In this article, we design algorithms to protect swarm-robotics applications against sensor denial-of-service attacks on robots. We focus on applications requiring the robots to jointly select actions, e.g., which trajectory to follow, among a set of available actions. Such applications are central in large-scale robotic applications, such as multirobot motion planning for target tracking. But the current attack-robust algorithms are centralized. In this article, we propose a general-purpose distributed algorithm toward robust optimization at scale, with local communications only. We name it distributed robust maximization ( DRM ). DRM proposes a divide-and-conquer approach that distributively partitions the problem among cliques of robots. Then, the cliques optimize in parallel, independently of each other. We prove DRM achieves a close-to-optimal performance. We demonstrate DRM 's performance in Gazebo and MATLAB simulations, in scenarios of active target tracking with swarms of robots . In the simulations, DRM achieves computational speed-ups, being 1 to 2 orders faster than the centralized algorithms. Yet , it nearly matches the tracking performance of the centralized counterparts. Since, DRM overestimates the number of attacks in each clique, in this article, we also introduce an improved distributed robust maximization ( IDRM ) algorithm. IDRM infers the number of attacks in each clique less conservatively than DRM by leveraging three-hop neighboring communications. We verify IDRM improves DRM 's performance in simulations.

Metrics

5 Record Views
15 citations in Scopus

Details

UN Sustainable Development Goals (SDGs)

This publication has contributed to the advancement of the following goals:

#11 Sustainable Cities and Communities

InCites Highlights

Data related to this publication, from InCites Benchmarking & Analytics tool:

Collaboration types
Domestic collaboration
Web of Science research areas
Robotics
Logo image