An exact solution approach for the mobile multi‐agent sensing problem
From MaRDI portal
Publication:6194842
DOI10.1002/rnc.6510OpenAlexW4310207314MaRDI QIDQ6194842
No author found.
Publication date: 12 March 2024
Published in: International Journal of Robust and Nonlinear Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rnc.6510
conditional value-at-riskvalid inequalitysubmodular functionscutting-plane algorithmmobile multi-agent systems
Cites Work
- Unnamed Item
- Adaptive second-order consensus of networked mobile agents with nonlinear dynamics
- Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
- Submodularity and greedy algorithms in sensor scheduling for linear dynamical systems
- Exploiting submodularity to quantify near-optimality in multi-agent coverage problems
- Risk averse submodular utility maximization
- An analysis of the greedy algorithm for the submodular set covering problem
- An exact method for constrained maximization of the conditional value-at-risk of a class of stochastic submodular functions
- Distributed greedy algorithm for multi-agent task assignment problem with submodular utility functions
- A mobile multi-agent sensing problem with submodular functions under a partition matroid
- Coherent Measures of Risk
- A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- An analysis of approximations for maximizing submodular set functions—I
- An Exact Algorithm for Maximum Entropy Sampling
- Distributed Subgradient Methods for Multi-Agent Optimization
- An efficient method for stochastic optimal control with joint chance constraints for nonlinear systems
- Distributed Algorithms for Environment Partitioning in Mobile Robotic Networks
This page was built for publication: An exact solution approach for the mobile multi‐agent sensing problem
