TY - GEN
T1 - Deployment of Battery Swapping Stations for Unmanned Aerial Vehicles Subject to Cyclic Production Flow Constraints
AU - Bocewicz, G.
AU - Nielsen, P.
AU - Banaszak, Z.
AU - Thibbotuwawa, A.
PY - 2018/1/1
Y1 - 2018/1/1
N2 - Given is a production system in which material handling operations are carried out by a fleet of UAVs. A problem has been formulated for this case of cyclic multi-product batch production flow, which combines the problems of split delivery-vehicle routing with time windows and deployment of battery swapping depots. It is assumed that the times of execution of pickup and delivery operations are known. During these operations, workpieces following different production routes reach and leave workstations cyclically. Given is the number of battery swapping depots and their potential arrangement. Given is also the rate of power consumption by an UAV in hovering mode or flying at a constant speed as well as during take-off and landing. The goal is to find the number of UAVs and the routes they fly to serve all the workstations periodically, within a given takt time, without violating constraints imposed by the due-time pickup/delivery operations and collision-free movement of UAVs. A declarative model of the analysed case allows to view the problem under consideration as a constraint satisfaction problem and solve it in the Oz Mozart programming environment.
AB - Given is a production system in which material handling operations are carried out by a fleet of UAVs. A problem has been formulated for this case of cyclic multi-product batch production flow, which combines the problems of split delivery-vehicle routing with time windows and deployment of battery swapping depots. It is assumed that the times of execution of pickup and delivery operations are known. During these operations, workpieces following different production routes reach and leave workstations cyclically. Given is the number of battery swapping depots and their potential arrangement. Given is also the rate of power consumption by an UAV in hovering mode or flying at a constant speed as well as during take-off and landing. The goal is to find the number of UAVs and the routes they fly to serve all the workstations periodically, within a given takt time, without violating constraints imposed by the due-time pickup/delivery operations and collision-free movement of UAVs. A declarative model of the analysed case allows to view the problem under consideration as a constraint satisfaction problem and solve it in the Oz Mozart programming environment.
KW - Battery swapping
KW - Routing problem
KW - Unmanned aerial vehicles
UR - http://www.scopus.com/inward/record.url?scp=85051799027&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-99972-2_6
DO - 10.1007/978-3-319-99972-2_6
M3 - Article in proceeding
AN - SCOPUS:85051799027
SN - 978-3-319-99971-5
T3 - Communications in Computer and Information Science
SP - 73
EP - 87
BT - Information and Software Technologies - 24th International Conference, ICIST 2018, Proceedings
A2 - Damasevicius, Robertas
A2 - Vasiljeviene, Giedre
PB - Springer
T2 - 24th International Conference on Information and Software Technologies, ICIST 2018
Y2 - 4 October 2018 through 6 October 2018
ER -