An exact solution approach for the mobile multi‐agent sensing problem

DOI10.1002/RNC.6510MaRDI QIDQ6194842zbMATH OpenOpenAlexFDO

Authors

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

zbMATH Keywords

conditional value-at-riskcutting-plane algorithmmobile multi-agent systemssubmodular functionsvalid inequality

Mathematics Subject Classification ID

Risk models (general) (91B05) Multi-agent systems (93A16)

Recommendations

• A mobile multi-agent sensing problem with submodular functions under a partition matroid
• A sub-modular receding horizon solution for mobile multi-agent persistent monitoring
• Policies for risk-aware sensor data collection by mobile agents
• Distributed strategy selection: a submodular set function maximization approach
• Exploiting submodularity to quantify near-optimality in multi-agent coverage problems

Cites work

• A mobile multi-agent sensing problem with submodular functions under a partition matroid
• A tight linear time (1/2)-approximation for unconstrained submodular maximization
• Adaptive second-order consensus of networked mobile agents with nonlinear dynamics
• An analysis of approximations for maximizing submodular set functions—I
• An analysis of the greedy algorithm for the submodular set covering problem
• An efficient method for stochastic optimal control with joint chance constraints for nonlinear systems
• An Exact Algorithm for Maximum Entropy Sampling
• An exact method for constrained maximization of the conditional value-at-risk of a class of stochastic submodular functions
• Coherent measures of risk
• Distributed Algorithms for Environment Partitioning in Mobile Robotic Networks
• Distributed greedy algorithm for multi-agent task assignment problem with submodular utility functions
• Distributed Subgradient Methods for Multi-Agent Optimization
• Exploiting submodularity to quantify near-optimality in multi-agent coverage problems
• scientific article; zbMATH DE number 3635849 (Why is no real title available?)
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Risk averse submodular utility maximization
• 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

This page was built for publication: An exact solution approach for the mobile multi‐agent sensing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6194842)