Regional surveillance of disjoint rectangles: a travelling salesman formulation
From MaRDI portal
(Redirected from Publication:3394064)
Recommendations
- Minisum and maximin aerial surveillance over disjoint rectangles
- Distributed region following and perimeter surveillance tasks in star-shaped sets
- Region-based approximation algorithms for visibility between imprecise locations
- LOCAL SOLUTIONS OF SURVEILLANCE ROUTING PROBLEM BY PARTITIONING THE OBJECTIVE SHIPS
- Curvature-constrained traveling salesman tours for aerial surveillance in scenarios with obstacles
- GENERALIZED WATCHMAN ROUTE PROBLEM WITH DISCRETE VIEW COST
- EFFICIENT ALGORITHMS FOR THE OPTIMAL-RATIO REGION DETECTION PROBLEMS IN DISCRETE GEOMETRY WITH APPLICATIONS
- Efficient Algorithms for the Optimal-Ratio Region Detection Problems in Discrete Geometry with Applications
- Adaptive policies for perimeter surveillance problems
Cited in
(9)- Mission planning for regional surveillance
- Routing of platforms in a maritime surface surveillance operation
- A Markov decision process model on dynamic routing for target surveillance
- ROUTING PROBLEM IN SURVEILLANCE OPERATION AT SEA
- LOCAL SOLUTIONS OF SURVEILLANCE ROUTING PROBLEM BY PARTITIONING THE OBJECTIVE SHIPS
- Minisum and maximin aerial surveillance over disjoint rectangles
- A multiobjective hybrid ant colony optimization approach applied to the assignment and scheduling problem
- Distributed region following and perimeter surveillance tasks in star-shaped sets
- Optimization of fleet search on network of regions
This page was built for publication: Regional surveillance of disjoint rectangles: a travelling salesman formulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3394064)
