Αναζήτηση
Αποτελέσματα 1-5 από 5
Safe Optimistic Path Planning for Autonomous Drones under Dynamic Energy Costs
(2021)
Unmanned aerial vehicles or so-called drones are already used in several applications to perform different sensing and monitoring missions. A central problem is to plan these missions so as to minimize the completion time. ...
Dynamic Multiple Vehicle Routing under Energy Capacity Constraints
(2020)
The multiple vehicle routing problem (mVRP) concerns the scheduling of multiple vehicles so as to visit some locations of interest. We study a dynamic version of mVRP where the travel costs are not a priori known and may ...
Planning Computation Offloading on Shared Edge Infrastructure for Multiple Drones
(2022)
Drones are used in a wide range of applications, which may involve computationally-demanding data processing tasks during the missions. While such heavy tasks can be offloaded to nearby edge-servers, this may not always ...
Tournament selection algorithm for the multiple travelling salesman problem
(2020)
The multiple Travelling Salesman Problem (mTSP) is a generalization of the classic TSP problem, where the cities in question are visited using a team of salesmen, each one following a different, complementary route. Several ...
Dynamic Vehicle Routing Under Uncertain Energy Consumption and Energy Gain Opportunities
(2021)
The amount of energy that needs to be spent by a vehicle to travel between different locations, and the amount of energy that can be regained at certain locations, may not always be known in advance with certainty. In this ...