Clustered coverage orienteering problem of unmanned surface vehicles for water sampling
From MaRDI portal
Publication:6072147
Recommendations
- The clustered orienteering problem
- The single robot line coverage problem: Theory, algorithms, and experiments
- A multi‐vehicle covering tour problem with speed optimization
- The clustered team orienteering problem
- Variable neighborhood search for the set orienteering problem and its application to other orienteering problem variants
Cites work
- A mixed-integer model for solving ordering problems with side constraints
- Coverage for robotics -- a survey of recent results
- scientific article; zbMATH DE number 1769325 (Why is no real title available?)
- Integer Programming Formulation of Traveling Salesman Problems
- Orienteering problem: a survey of recent variants, solution approaches and applications
- Persistent coverage control for a team of agents with collision avoidance
- Solving the Orienteering Problem through Branch-and-Cut
- The clustered orienteering problem
- The orienteering problem
- The orienteering problem: a survey
- The selective travelling salesman problem
Cited in
(3)
This page was built for publication: Clustered coverage orienteering problem of unmanned surface vehicles for water sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6072147)