ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1708.04201
  4. Cited By
A Submodularity-Based Approach for Multi-Agent Optimal Coverage Problems

A Submodularity-Based Approach for Multi-Agent Optimal Coverage Problems

IEEE Conference on Decision and Control (CDC), 2017
14 August 2017
Xinmiao Sun
Christos G. Cassandras
Xiangyu Meng
ArXiv (abs)PDFHTML

Papers citing "A Submodularity-Based Approach for Multi-Agent Optimal Coverage Problems"

2 / 2 papers shown
Human-in-the-Loop Multi-Robot Information Gathering with Inverse Submodular Maximization
Human-in-the-Loop Multi-Robot Information Gathering with Inverse Submodular Maximization
Guangyao Shi
Gaurav Sukhatme
Ellen Novoseller
Feifei Qian
Gaurav S. Sukhatme
291
3
0
16 Mar 2024
Cooperative Multi-Agent Graph Bandits: UCB Algorithm and Regret Analysis
Cooperative Multi-Agent Graph Bandits: UCB Algorithm and Regret Analysis
Phevos Paschalidis
Runyu Zhang
Na Li
356
1
0
18 Jan 2024
1
Page 1 of 1