Performance-Guaranteed Solutions for Multi-Agent Optimal Coverage Problems using Submodularity, Curvature, and Greedy Algorithms.
Shirantha WelikalaChristos G. CassandrasPublished in: CoRR (2024)
Keyphrases
- greedy algorithms
- greedy algorithm
- multi agent
- optimal or near optimal
- dynamic programming
- optimal solution
- worst case
- efficient solutions
- submodular functions
- knapsack problem
- search space
- intelligent agents
- benchmark problems
- partial solutions
- similar problems
- global optimality
- neural network
- multiagent systems
- search methods
- upper bound
- coalition formation
- exact solution
- finding optimal
- specific problems
- multi agent systems
- search algorithm