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"

20 / 20 papers shown
Title
Resource-Aware Distributed Submodular Maximization: A Paradigm for
  Multi-Robot Decision-Making
Resource-Aware Distributed Submodular Maximization: A Paradigm for Multi-Robot Decision-Making
Zirui Xu
Vasileios Tzoumas
40
16
0
15 Apr 2022
Submodularity In Machine Learning and Artificial Intelligence
Submodularity In Machine Learning and Artificial Intelligence
J. Bilmes
40
56
0
31 Jan 2022
Execution Order Matters in Greedy Algorithms with Limited Information
Execution Order Matters in Greedy Algorithms with Limited Information
Rohit Konda
David Grimsman
Jason R. Marden
33
11
0
02 Nov 2021
On Optimal Robustness to Adversarial Corruption in Online Decision
  Problems
On Optimal Robustness to Adversarial Corruption in Online Decision Problems
Shinji Ito
59
22
0
22 Sep 2021
Distributed Strategy Selection: A Submodular Set Function Maximization
  Approach
Distributed Strategy Selection: A Submodular Set Function Maximization Approach
Navid Rezazadeh
Solmaz S. Kia
28
19
0
29 Jul 2021
Scalable Distributed Planning for Multi-Robot, Multi-Target Tracking
Scalable Distributed Planning for Multi-Robot, Multi-Target Tracking
Micah Corah
Nathan Michael
26
14
0
18 Jul 2021
Improved Regret Bounds for Tracking Experts with Memory
Improved Regret Bounds for Tracking Experts with Memory
James Robinson
Mark Herbster
25
3
0
24 Jun 2021
Distributed Resilient Submodular Action Selection in Adversarial
  Environments
Distributed Resilient Submodular Action Selection in Adversarial Environments
Jun Liu
Lifeng Zhou
Pratap Tokekar
Ryan K. Williams
34
26
0
15 May 2021
Resilient Active Information Acquisition with Teams of Robots
Resilient Active Information Acquisition with Teams of Robots
Brent Schlotfeldt
Vasileios Tzoumas
George J. Pappas
AAML
43
27
0
03 Mar 2021
Robust Multiple-Path Orienteering Problem: Securing Against Adversarial
  Attacks
Robust Multiple-Path Orienteering Problem: Securing Against Adversarial Attacks
Guan-Yu Shi
Lifeng Zhou
Pratap Tokekar
23
25
0
31 Mar 2020
Online Continuous Submodular Maximization: From Full-Information to
  Bandit Feedback
Online Continuous Submodular Maximization: From Full-Information to Bandit Feedback
Mingrui Zhang
Lin Chen
Hamed Hassani
Amin Karbasi
25
51
0
28 Oct 2019
Optimal Algorithms for Submodular Maximization with Distributed
  Constraints
Optimal Algorithms for Submodular Maximization with Distributed Constraints
Alexander Robey
Arman Adibi
Brent Schlotfeldt
George J. Pappas
Hamed Hassani
39
23
0
30 Sep 2019
Competitive ratio versus regret minimization: achieving the best of both
  worlds
Competitive ratio versus regret minimization: achieving the best of both worlds
Amit Daniely
Yishay Mansour
20
2
0
07 Apr 2019
Adaptive Online Learning in Dynamic Environments
Adaptive Online Learning in Dynamic Environments
Lijun Zhang
Shiyin Lu
Zhi Zhou
50
185
0
25 Oct 2018
Resilient Active Target Tracking with Multiple Robots
Resilient Active Target Tracking with Multiple Robots
Lifeng Zhou
Vasileios Tzoumas
George J. Pappas
Pratap Tokekar
33
80
0
11 Sep 2018
Online Continuous Submodular Maximization
Online Continuous Submodular Maximization
Lin Chen
Hamed Hassani
Amin Karbasi
68
86
0
16 Feb 2018
Improved Dynamic Regret for Non-degenerate Functions
Improved Dynamic Regret for Non-degenerate Functions
Lijun Zhang
Tianbao Yang
Jinfeng Yi
Jing Rong
Zhi Zhou
219
127
0
13 Aug 2016
Online Submodular Maximization under a Matroid Constraint with
  Application to Learning Assignments
Online Submodular Maximization under a Matroid Constraint with Application to Learning Assignments
Daniel Golovin
Andreas Krause
Matthew J. Streeter
44
47
0
03 Jul 2014
Efficient Informative Sensing using Multiple Robots
Efficient Informative Sensing using Multiple Robots
Amarjeet Singh
Andreas Krause
Carlos Guestrin
W. Kaiser
76
366
0
15 Jan 2014
The on-line shortest path problem under partial monitoring
The on-line shortest path problem under partial monitoring
Pál Benkö
T. Várady
L. Andor
Ralph Robert Martin
532
355
0
08 Apr 2007
1