Online submodular coordination with bounded tracking regret: Theory, algorithm, and applications to multi-robot coordination

Z Xu, H Zhou, V Tzoumas - IEEE Robotics and Automation …, 2023 - ieeexplore.ieee.org
We enable efficient and effective coordination in unpredictable environments, ie, in
environments whose future evolution is unknown a priori and even adversarial. We are …

Resource-aware distributed submodular maximization: A paradigm for multi-robot decision-making

Z Xu, V Tzoumas - 2022 IEEE 61st Conference on Decision …, 2022 - ieeexplore.ieee.org
Multi-robot decision-making is the process where multiple robots coordinate actions. In this
paper, we aim for efficient and effective multi-robot decision-making despite the robots' …

Bandit submodular maximization for multi-robot coordination in unpredictable and partially observable environments

Z Xu, X Lin, V Tzoumas - arXiv preprint arXiv:2305.12795, 2023 - arxiv.org
We study the problem of multi-agent coordination in unpredictable and partially observable
environments, that is, environments whose future evolution is unknown a priori and that can …

Performance-Aware Self-Configurable Multi-Agent Networks: A Distributed Submodular Approach for Simultaneous Coordination and Network Design

Z Xu, V Tzoumas - arXiv preprint arXiv:2409.01411, 2024 - arxiv.org
We introduce the first, to our knowledge, rigorous approach that enables multi-agent
networks to self-configure their communication topology to balance the trade-off between …

Distributed strategy selection: A submodular set function maximization approach

N Rezazadeh, SS Kia - Automatica, 2023 - Elsevier
Joint utility-maximization problems for multi-agent systems often should be addressed by
distributed strategy-selection formulation. Constrained by discrete feasible strategy sets …

Leveraging untrustworthy commands for multi-robot coordination in unpredictable environments: A bandit submodular maximization approach

Z Xu, X Lin, V Tzoumas - 2024 American Control Conference …, 2024 - ieeexplore.ieee.org
We study the problem of multi-agent coordination in unpredictable and partially-observable
environments with untrustworthy external commands. The commands are actions suggested …

Communication-and Computation-Efficient Distributed Decision-Making in Multi-Robot Networks

Z Xu, SS Garimella, V Tzoumas - arXiv preprint arXiv:2407.10382, 2024 - arxiv.org
We provide a distributed coordination paradigm that enables scalable and near-optimal joint
motion planning among multiple robots. Our coordination paradigm contrasts with current …

Sensor Set Decomposition for Enhanced Distributed Sensor Fault Isolability of Marine Propulsion Systems

N Kougiatsos, V Reppa - IFAC-PapersOnLine, 2024 - Elsevier
This paper proposes a greedy stochastic optimization algorithm for the sensor set
decomposition used in the sensor fault monitoring of marine propulsion systems, based on …

Submodular Maximization Subject to Uniform and Partition Matroids: From Theory to Practical Applications and Distributed Solutions

SS Kia - arXiv preprint arXiv:2501.01071, 2025 - arxiv.org
This article provides a comprehensive exploration of submodular maximization problems,
focusing on those subject to uniform and partition matroids. Crucial for a wide array of …

Distributed submodular maximization: trading performance for privacy

N Rezazadeh, SS Kia - … IEEE 61st Conference on Decision and …, 2022 - ieeexplore.ieee.org
This paper considers a multi-agent submodular set function maximization problem subject to
partition matroid in which the utility is shared, but the agents' policy choices are constrained …