Отрывок: .. . n nL l l L l l Then the average time of the optimal n-step search is 1 . n n opt n L (11) Now (from the expression (11)) we can find the opti- mal number of steps n minimizes the average search time. Since the function xa1/x for a > 1 has only one minimum point (x = ln a), the optimal value nopt is always eit...
Полная запись метаданных
Поле DC | Значение | Язык |
---|---|---|
dc.contributor.author | Reznik, A.L. | - |
dc.contributor.author | Tuzikov, A.V. | - |
dc.contributor.author | Soloviev, A.A. | - |
dc.contributor.author | Torgov, A.V. | - |
dc.contributor.author | Kovalev, V.A. | - |
dc.date.accessioned | 2019-10-15 10:03:35 | - |
dc.date.available | 2019-10-15 10:03:35 | - |
dc.date.issued | 2019-08 | - |
dc.identifier | Dspace\SGAU\20190924\78785 | ru |
dc.identifier.citation | Reznik AL, Tuzikov AV, Soloviev AA, Torgov AV, Kovalev VA. Time-optimal algorithms focused on the search for random pulsed-point sources. Computer Optics 2019; 43(4): 605-610. DOI: 10.18287/2412-6179-2019-43-4-605-610. | ru |
dc.identifier.uri | https://dx.doi.org/10.18287/2412-6179-2019-43-4-605-610 | - |
dc.identifier.uri | http://repo.ssau.ru/handle/Zhurnal-Komputernaya-optika/Timeoptimal-algorithms-focused-on-the-search-for-random-pulsedpoint-sources-78785 | - |
dc.description.abstract | The article describes methods and algorithms related to the analysis of dynamically changing discrete random fields. Time-optimal strategies for the localization of pulsed-point sources having a random spatial distribution and indicating themselves by generating instant delta pulses at random times are proposed. An optimal strategy is a procedure that has a minimum (statistically) average localization time. The search is performed in accordance with the requirements for localization accuracy and is carried out by a system with one or several receiving devices. Along with the predetermined accuracy of localization of a random pulsed-point source, a significant complicating factor of the formulated problem is that the choice of the optimal search procedure is not limited to one-step algorithms that end at the moment of first pulse generation. Moreover, the article shows that even with relatively low requirements for localization accuracy, the time-optimal procedure consists of several steps, and the transition from one step to another occurs at the time of registration of the next pulse by the receiving system. In this case, the situation is acceptable when during the process of optimal search some of the generated pulses are not fixed by the receiving system. The parameters of the optimal search depending on the number of receiving devices and the required accuracy of localization are calculated and described in the paper. | ru |
dc.description.sponsorship | This work was supported in part by the Russian Foundation for Basic Research (projects no 18-51-00001 and 19-01-00128), and Ministry of Science and Higher Education of the Russian Federation (project no. № AAA-A17-117052410034-6). | ru |
dc.language.iso | en_US | ru |
dc.publisher | Новая техника | ru |
dc.relation.ispartofseries | 43;4 | - |
dc.subject | optimal search | ru |
dc.subject | pulsed-point source | ru |
dc.subject | localization accuracy | ru |
dc.subject | receiver | ru |
dc.title | Time-optimal algorithms focused on the search for random pulsed-point sources | ru |
dc.type | Article | ru |
dc.textpart | .. . n nL l l L l l Then the average time of the optimal n-step search is 1 . n n opt n L (11) Now (from the expression (11)) we can find the opti- mal number of steps n minimizes the average search time. Since the function xa1/x for a > 1 has only one minimum point (x = ln a), the optimal value nopt is always eit... | - |
dc.classindex.scsti | 28.23.15 | - |
Располагается в коллекциях: | Журнал "Компьютерная оптика" |
Файлы этого ресурса:
Файл | Описание | Размер | Формат | |
---|---|---|---|---|
430412.pdf | Основная статья | 631.47 kB | Adobe PDF | Просмотреть/Открыть |
Показать базовое описание ресурса
Просмотр статистики
Поделиться:
Все ресурсы в архиве электронных ресурсов защищены авторским правом, все права сохранены.