Distributed Online Task Assignment via Inexact ADMM for unplanned online tasks and its Applications to Security
Ziqi Yang, Roberto Tron

TL;DR
This paper introduces a distributed, optimization-based task assignment method for multi-robot systems that handles unplanned online tasks securely using inexact ADMM, security analysis, and control barrier functions.
Contribution
It presents a novel inexact ADMM-based distributed algorithm for dynamic task assignment with security considerations in multi-robot systems.
Findings
Effective online task handling demonstrated in simulations.
Maintains security guarantees during task reallocation.
Enables secure response to unplanned tasks in multi-robot systems.
Abstract
In multi-robot system (MRS) applications, efficient task assignment is essential not only for coordinating agents and ensuring mission success but also for maintaining overall system security. In this work, we first propose an optimization-based distributed task assignment algorithm that dynamically assigns mandatory security-critical tasks and optional tasks among teams. Leveraging an inexact Alternating Direction Method of Multipliers (ADMM)-based approach, we decompose the task assignment problem into separable and non-separable subproblems. The non-separable subproblems are transformed into an inexact ADMM update by projected gradient descent, which can be performed through several communication steps within the team. In the second part of this paper, we formulate a comprehensive framework that enables MRS under plan-deviation attacks to handle online tasks without compromising…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed Control Multi-Agent Systems · Teleoperation and Haptic Systems · Robotic Path Planning Algorithms
