Abstract
Unmanned Aerial Vehicles (UAVs) can aid rescue workers during operational emergency response procedures in tasks such as communication delivery or aerial reconnaissance of the area. Before a UAV team starts operating in the natural environment, multiple simulations aimed at experimental verification of their paths’ effectiveness are necessary. Simulations require demanding test cases that exhibit different types of problem complexity and are easily controlled by a simple set of parameters. We develop a model of the problem adjusted to the specific requirements of the optimization algorithm. Then, we generate a set of problem-specific benchmarks using the model and available statistical information about population density levels for the entire area of Poland. The proposed generator divides the selected area into convex regions with a given population density level. Depending on the parameter settings, it generates more than one map of convex regions from a single raw data. The simulation results show the diversity of the obtained test cases and their main features.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Geostatistics Portal, https://geo.stat.gov.pl, the date of access: Dec 28, 2022.
References
Basilico, N., Carpin, S.: Deploying teams of heterogeneous UAVs in cooperative two-level surveillance missions. In: 2015 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pp. 610–615. IEEE, September 2015. https://doi.org/10.1109/iros.2015.7353435
Cabreira, T., Brisolara, L., Ferreira Jr., P.R.: Survey on coverage path planning with unmanned aerial vehicles. Drones 3(1), 4 (2019). https://doi.org/10.3390/drones3010004
Galceran, E., Carreras, M.: A survey on coverage path planning for robotics. Robot. Auton. Syst. 61(12), 1258–1276 (2013). https://doi.org/10.1016/j.robot.2013.09.004. https://linkinghub.elsevier.com/retrieve/pii/S092188901300167X
Kapanoglu, M., Alikalfa, M., Ozkan, M., Yazici, A., Parlaktuna, O.: A pattern-based genetic algorithm for multi-robot coverage path planning minimizing completion time. J. Intell. Manuf. 23(4), 1035–1045 (2010). https://doi.org/10.1007/s10845-010-0404-5
Khan, A., Noreen, I., Habib, Z.: On complete coverage path planning algorithms for non-holonomic mobile robots: survey and challenges. J. Inf. Sci. Eng. 33(1), 101–121 (2017). https://jise.iis.sinica.edu.tw/JISESearch/pages/View/PaperView.jsf?keyId=154_1997
Li, L., et al.: Complete coverage problem of multiple robots with different velocities. Int. J. Adv. Robot. Syst. 19(2), 172988062210916 (2022). https://doi.org/10.1177/17298806221091685
Lin, H.Y., Huang, Y.C.: Collaborative complete coverage and path planning for multi-robot exploration. Sensors 21(11), 3709 (2021). https://doi.org/10.3390/s21113709
Nasirian, B., Mehrandezh, M., Janabi-Sharifi, F.: Efficient coverage path planning for mobile disinfecting robots using graph-based representation of environment. Front. Robot. AI 8, 1–19 (2021). https://doi.org/10.3389/frobt.2021.624333
Tan, C.S., Mohd-Mokhtar, R., Arshad, M.R.: A comprehensive review of coverage path planning in robotics using classical and heuristic algorithms. IEEE Access 9, 119310–119342 (2021). https://doi.org/10.1109/access.2021.3108177. https://ieeexplore.ieee.org/document/9523743/
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Grzeszczak, J., Trojanowski, K., Mikitiuk, A. (2023). Test Case Generator for Problems of Complete Coverage and Path Planning for Emergency Response by UAVs. In: Rutkowski, L., Scherer, R., Korytkowski, M., Pedrycz, W., Tadeusiewicz, R., Zurada, J.M. (eds) Artificial Intelligence and Soft Computing. ICAISC 2023. Lecture Notes in Computer Science(), vol 14125. Springer, Cham. https://doi.org/10.1007/978-3-031-42505-9_42
Download citation
DOI: https://doi.org/10.1007/978-3-031-42505-9_42
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-42504-2
Online ISBN: 978-3-031-42505-9
eBook Packages: Computer ScienceComputer Science (R0)