Standard

Optimal Placement of Mobile Sensors for the Distance-Constrained Line Routing Problem. / Erzin, Adil; Shadrina, Anzhela.

Communications in Computer and Information Science. Springer Science and Business Media Deutschland GmbH, 2024. p. 172-184 12 (Communications in Computer and Information Science; Vol. 2239 CCIS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

Harvard

Erzin, A & Shadrina, A 2024, Optimal Placement of Mobile Sensors for the Distance-Constrained Line Routing Problem. in Communications in Computer and Information Science., 12, Communications in Computer and Information Science, vol. 2239 CCIS, Springer Science and Business Media Deutschland GmbH, pp. 172-184, 23rd International Conference on Mathematical Optimization Theory and Operations Research, Омск, Russian Federation, 30.06.2024. https://doi.org/10.1007/978-3-031-73365-9_12

APA

Erzin, A., & Shadrina, A. (2024). Optimal Placement of Mobile Sensors for the Distance-Constrained Line Routing Problem. In Communications in Computer and Information Science (pp. 172-184). [12] (Communications in Computer and Information Science; Vol. 2239 CCIS). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-73365-9_12

Vancouver

Erzin A, Shadrina A. Optimal Placement of Mobile Sensors for the Distance-Constrained Line Routing Problem. In Communications in Computer and Information Science. Springer Science and Business Media Deutschland GmbH. 2024. p. 172-184. 12. (Communications in Computer and Information Science). doi: 10.1007/978-3-031-73365-9_12

Author

Erzin, Adil ; Shadrina, Anzhela. / Optimal Placement of Mobile Sensors for the Distance-Constrained Line Routing Problem. Communications in Computer and Information Science. Springer Science and Business Media Deutschland GmbH, 2024. pp. 172-184 (Communications in Computer and Information Science).

BibTeX

@inproceedings{778944e1572946709f21844ef9fc0d6a,
title = "Optimal Placement of Mobile Sensors for the Distance-Constrained Line Routing Problem",
abstract = "A line segment (barrier) is specified on the plane, as well as the location of the depots. Each sensor can travel a limited-length path, starting and ending at its depot. The part of the barrier along which the sensor moved is covered by this sensor. It is necessary to determine the number of sensors (drones) in each depot in order to cover the entire barrier using a minimal number of drones (problem MinNum), or to minimize the maximum distance traveled by each drone (problem MinMax), or to minimize the total length of paths traveled by all drones (problem MinSum). Previously, the problem MinNum of covering a barrier using minimal number of drones (one drone in each depot) was considered. In the problem considered in this paper, the solution is the number of drones in each depot, as well as the trajectory of each drone. We propose algorithms for solving the problem for all three criteria mentioned above.",
keywords = "Barrier covering, Drones, Limited energy, Optimization",
author = "Adil Erzin and Anzhela Shadrina",
year = "2024",
month = dec,
day = "20",
doi = "10.1007/978-3-031-73365-9_12",
language = "English",
isbn = "978-303173364-2",
series = "Communications in Computer and Information Science",
publisher = "Springer Science and Business Media Deutschland GmbH",
pages = "172--184",
booktitle = "Communications in Computer and Information Science",
address = "Germany",
note = "23rd International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2024 ; Conference date: 30-06-2024 Through 06-07-2024",

}

RIS

TY - GEN

T1 - Optimal Placement of Mobile Sensors for the Distance-Constrained Line Routing Problem

AU - Erzin, Adil

AU - Shadrina, Anzhela

N1 - Conference code: 23

PY - 2024/12/20

Y1 - 2024/12/20

N2 - A line segment (barrier) is specified on the plane, as well as the location of the depots. Each sensor can travel a limited-length path, starting and ending at its depot. The part of the barrier along which the sensor moved is covered by this sensor. It is necessary to determine the number of sensors (drones) in each depot in order to cover the entire barrier using a minimal number of drones (problem MinNum), or to minimize the maximum distance traveled by each drone (problem MinMax), or to minimize the total length of paths traveled by all drones (problem MinSum). Previously, the problem MinNum of covering a barrier using minimal number of drones (one drone in each depot) was considered. In the problem considered in this paper, the solution is the number of drones in each depot, as well as the trajectory of each drone. We propose algorithms for solving the problem for all three criteria mentioned above.

AB - A line segment (barrier) is specified on the plane, as well as the location of the depots. Each sensor can travel a limited-length path, starting and ending at its depot. The part of the barrier along which the sensor moved is covered by this sensor. It is necessary to determine the number of sensors (drones) in each depot in order to cover the entire barrier using a minimal number of drones (problem MinNum), or to minimize the maximum distance traveled by each drone (problem MinMax), or to minimize the total length of paths traveled by all drones (problem MinSum). Previously, the problem MinNum of covering a barrier using minimal number of drones (one drone in each depot) was considered. In the problem considered in this paper, the solution is the number of drones in each depot, as well as the trajectory of each drone. We propose algorithms for solving the problem for all three criteria mentioned above.

KW - Barrier covering

KW - Drones

KW - Limited energy

KW - Optimization

UR - https://www.scopus.com/record/display.uri?eid=2-s2.0-85214278891&origin=inward&txGid=27ac14d055b654947d1ba77862498421

UR - https://www.mendeley.com/catalogue/f8594aa7-5204-30ee-a96f-616a6a0b5180/

U2 - 10.1007/978-3-031-73365-9_12

DO - 10.1007/978-3-031-73365-9_12

M3 - Conference contribution

SN - 978-303173364-2

T3 - Communications in Computer and Information Science

SP - 172

EP - 184

BT - Communications in Computer and Information Science

PB - Springer Science and Business Media Deutschland GmbH

T2 - 23rd International Conference on Mathematical Optimization Theory and Operations Research

Y2 - 30 June 2024 through 6 July 2024

ER -

ID: 61412487