{"title":"Stochastic Movement Swarm Performing a Coverage Task with Physical Parameters","authors":"K. Falkowski, Michał Duda","doi":"10.5604/01.3001.0016.0047","DOIUrl":null,"url":null,"abstract":"This paper describes an attempt of implementing physical parameters into a virtual swarm algorithm solution. It defines which physical parameters of the single object need to be known to properly transfer a virtual algorithm into a physical system. Considerations have been based on a stochastic movement swarm performing \na coverage task. Time to finish the task and energy consumptions were measured for different numbers of drones in a swarm allowing to designate an optimal size of the swarm. Additional tests for changing variables allowed us to determine their impact on the swarm performance. The presented algorithm is a discrete-time solution and every test is divided into steps. Positions of the drones are calculated only in time corresponding to these steps. Their position is unknown between these steps and the algorithm does not check if the paths of two drones cross between subsequent positions. The lower the time interval, the more precise results, but simulating the test requires more computing power. Further work should consider the smallest possible time intervals or additional feature to check if the paths of the drones do not cross.\n\n","PeriodicalId":52820,"journal":{"name":"Problemy Mechatroniki","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2022-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Problemy Mechatroniki","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5604/01.3001.0016.0047","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
This paper describes an attempt of implementing physical parameters into a virtual swarm algorithm solution. It defines which physical parameters of the single object need to be known to properly transfer a virtual algorithm into a physical system. Considerations have been based on a stochastic movement swarm performing
a coverage task. Time to finish the task and energy consumptions were measured for different numbers of drones in a swarm allowing to designate an optimal size of the swarm. Additional tests for changing variables allowed us to determine their impact on the swarm performance. The presented algorithm is a discrete-time solution and every test is divided into steps. Positions of the drones are calculated only in time corresponding to these steps. Their position is unknown between these steps and the algorithm does not check if the paths of two drones cross between subsequent positions. The lower the time interval, the more precise results, but simulating the test requires more computing power. Further work should consider the smallest possible time intervals or additional feature to check if the paths of the drones do not cross.