Tuesday, 13:45 - 14:10 h, Room: H 0111


Michal Penn
Cyclic routing of unmanned aerial vehicles

Coauthors: N. Druker, O. Strichman


Developing autonomous monitoring systems for Unmanned Aerial Vehicles (UAVs), which facilitate scanning and monitoring a set of targets on the ground is of growing interest in security applications. These monitoring systems have to support complex tasks that include multiple UAVs that should scan and monitor multiple distant predefined targets, with a known distance matrix, in cyclic routes. Each target is associated with a temporal constraint, namely, a relative deadline, that is, the maximum permitted time interval between two successive scanning of the target. Our aim is to determine the minimum number of UAVs required for suitable cyclic route that visits, under the temporal constraints all targets. We formulate the problem as MILP and as Satisfiability Modulo Theories (SMT) problem. We use several solutions methods, such as Mosek, Z3 and DFS and demonstrate their numerical results


Talk 2 of the invited session Tue.2.H 0111
"Logistics and network optimization: New problems and new approaches" [...]
Cluster 13
"Logistics, traffic, and transportation" [...]


  payday advance . All this happens in case of bad medicines and wrong way of medication. Viagra Super Force is a treatment that has unique and surpassing formula combination.