ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2209.12429
  4. Cited By
Online Submodular Coordination with Bounded Tracking Regret: Theory,
  Algorithm, and Applications to Multi-Robot Coordination

Online Submodular Coordination with Bounded Tracking Regret: Theory, Algorithm, and Applications to Multi-Robot Coordination

26 September 2022
Zirui Xu
Hongyu Zhou
Vasileios Tzoumas
ArXivPDFHTML

Papers citing "Online Submodular Coordination with Bounded Tracking Regret: Theory, Algorithm, and Applications to Multi-Robot Coordination"

4 / 4 papers shown
Title
Inverse Submodular Maximization with Application to Human-in-the-Loop
  Multi-Robot Multi-Objective Coverage Control
Inverse Submodular Maximization with Application to Human-in-the-Loop Multi-Robot Multi-Objective Coverage Control
Guangyao Shi
Gaurav Sukhatme
26
3
0
16 Mar 2024
Leveraging Untrustworthy Commands for Multi-Robot Coordination in
  Unpredictable Environments: A Bandit Submodular Maximization Approach
Leveraging Untrustworthy Commands for Multi-Robot Coordination in Unpredictable Environments: A Bandit Submodular Maximization Approach
Satvik Garg
Xiaodong Lin
Somya Garg
22
1
0
28 Sep 2023
Efficient Online Learning with Memory via Frank-Wolfe Optimization:
  Algorithms with Bounded Dynamic Regret and Applications to Control
Efficient Online Learning with Memory via Frank-Wolfe Optimization: Algorithms with Bounded Dynamic Regret and Applications to Control
Hongyu Zhou
Zirui Xu
Vasileios Tzoumas
71
13
0
02 Jan 2023
On Optimal Robustness to Adversarial Corruption in Online Decision
  Problems
On Optimal Robustness to Adversarial Corruption in Online Decision Problems
Shinji Ito
42
22
0
22 Sep 2021
1