Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
Energy-Efficient Regular Strip Covering with Fixed-Size Identical Sectors. / Erzin, Adil; Anikeev, Maxim.
Communications in Computer and Information Science. Springer Science and Business Media Deutschland GmbH, 2024. p. 161-171 11 (Communications in Computer and Information Science; Vol. 2239 CCIS).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
}
TY - GEN
T1 - Energy-Efficient Regular Strip Covering with Fixed-Size Identical Sectors
AU - Erzin, Adil
AU - Anikeev, Maxim
N1 - Conference code: 23
PY - 2024/12/20
Y1 - 2024/12/20
N2 - We consider the problem of covering a strip with identical sectors of given size in order to minimize the coverage density. Early in the literature, researchers considered the problems of constructing strip covers with circles, ellipses, and sectors of minimum density by proposing various covering models and determining the optimal values of the parameters of the covering figures for each model. In this paper, we consider identical sectors as covering figures and specify their parameters instead of optimizing them. We propose several new covering models and found a formula for calculating density for each model. Unfortunately, these formulas are quite cumbersome, which did not allow us to compare the densities of all covers analytically. Therefore, we defined some properties programmatically. As a result, a minimum density coverage model was determined for different values of the sector’s parameters.
AB - We consider the problem of covering a strip with identical sectors of given size in order to minimize the coverage density. Early in the literature, researchers considered the problems of constructing strip covers with circles, ellipses, and sectors of minimum density by proposing various covering models and determining the optimal values of the parameters of the covering figures for each model. In this paper, we consider identical sectors as covering figures and specify their parameters instead of optimizing them. We propose several new covering models and found a formula for calculating density for each model. Unfortunately, these formulas are quite cumbersome, which did not allow us to compare the densities of all covers analytically. Therefore, we defined some properties programmatically. As a result, a minimum density coverage model was determined for different values of the sector’s parameters.
KW - Density minimization
KW - Regular strip covering
UR - https://www.scopus.com/record/display.uri?eid=2-s2.0-85214230840&origin=inward&txGid=9302c9f27394e8c94d5366437576232d
UR - https://www.mendeley.com/catalogue/a49012cd-d116-3108-ba10-33defb93e44e/
U2 - 10.1007/978-3-031-73365-9_11
DO - 10.1007/978-3-031-73365-9_11
M3 - Conference contribution
SN - 978-303173364-2
T3 - Communications in Computer and Information Science
SP - 161
EP - 171
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: 61412758