Optimizing the planning of the observation of a catalog of objects by a mobile observer, taking the implicated limitations into account

DOI10.1134/S1064230722020137zbMath1498.93274OpenAlexW4224219948MaRDI QIDQ2171276

D. N. Rulev

Publication date: 23 September 2022

Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1064230722020137

Mathematics Subject Classification ID

Automated systems (robots, etc.) in control theory (93C85) Observers (93B53)

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
• Formulations and exact algorithms for the vehicle routing problem with time windows
• The Vehicle Routing Problem
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Optimal Routing under Capacity and Distance Restrictions
• A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows
• An Algorithm for the Traveling Salesman Problem