Pages that link to "Item:Q1737663"
From MaRDI portal
The following pages link to Exploiting submodularity to quantify near-optimality in multi-agent coverage problems (Q1737663):
Displaying 11 items.
- A new performance bound for submodular maximization problems and its application to multi-agent optimal coverage problems (Q2166001) (← links)
- Optimal composition of heterogeneous multi-agent teams for coverage problems with performance bound guarantees (Q2184512) (← links)
- Coverage control for heterogeneous mobile sensor networks with bounded position measurement errors (Q2203056) (← links)
- Coverage control for mobile sensor networks with time-varying communication delays on a closed curve (Q2217556) (← links)
- A mobile multi-agent sensing problem with submodular functions under a partition matroid (Q2668714) (← links)
- Does Adding More Agents Make a Difference? A Case Study of Cover Time for the Rotor-Router (Q5167868) (← links)
- Sectorial coverage control with load balancing in non-convex hollow environments (Q6049099) (← links)
- Optimal coverage control of stationary and moving agents under effective coverage constraints (Q6073037) (← links)
- An exact solution approach for the mobile multi‐agent sensing problem (Q6194842) (← links)
- A branch-and-bound based globally optimal solution to 2D multi-robot relative pose estimation problems (Q6550249) (← links)
- Voronoi-based adaptive area optimal coverage control for multiple manipulator systems with uncertain kinematics and dynamics (Q6590991) (← links)
