基于EST算法的机器学习雷达调度方法

Z. Qu, Z. Ding, P. Moo
{"title":"基于EST算法的机器学习雷达调度方法","authors":"Z. Qu, Z. Ding, P. Moo","doi":"10.1109/ICCICC46617.2019.9146101","DOIUrl":null,"url":null,"abstract":"A machine learning radar scheduling method is proposed based on the earliest start time (EST) algorithm. In this method, the EST algorithm is used to find an initial schedule, and a reinforcement learning approach is conducted to reduce the cost of the initial schedule. In search for a better starting point, the start time of all the tasks are randomly shifted within their allowed time ranges, the shifted tasks are scheduled with the EST again. Then the gradient descent algorithm is applied to further shift the tasks' start times, in order to find an enhanced solution. The procedure is repeated several times. The schedule with the minimal cost is the final solution. The performance of the proposed method is evaluated numerically, showing 1.3 to 10.5 times less cost than the EST, depending on the scenario. In addition, a full cycle of scheduling takes a few tens of milliseconds thus the method could be considered in real radar systems.","PeriodicalId":294902,"journal":{"name":"2019 IEEE 18th International Conference on Cognitive Informatics & Cognitive Computing (ICCI*CC)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"A Machine Learning Radar Scheduling Method Based on the EST Algorithm\",\"authors\":\"Z. Qu, Z. Ding, P. Moo\",\"doi\":\"10.1109/ICCICC46617.2019.9146101\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A machine learning radar scheduling method is proposed based on the earliest start time (EST) algorithm. In this method, the EST algorithm is used to find an initial schedule, and a reinforcement learning approach is conducted to reduce the cost of the initial schedule. In search for a better starting point, the start time of all the tasks are randomly shifted within their allowed time ranges, the shifted tasks are scheduled with the EST again. Then the gradient descent algorithm is applied to further shift the tasks' start times, in order to find an enhanced solution. The procedure is repeated several times. The schedule with the minimal cost is the final solution. The performance of the proposed method is evaluated numerically, showing 1.3 to 10.5 times less cost than the EST, depending on the scenario. In addition, a full cycle of scheduling takes a few tens of milliseconds thus the method could be considered in real radar systems.\",\"PeriodicalId\":294902,\"journal\":{\"name\":\"2019 IEEE 18th International Conference on Cognitive Informatics & Cognitive Computing (ICCI*CC)\",\"volume\":\"57 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE 18th International Conference on Cognitive Informatics & Cognitive Computing (ICCI*CC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCICC46617.2019.9146101\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 18th International Conference on Cognitive Informatics & Cognitive Computing (ICCI*CC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCICC46617.2019.9146101","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

提出了一种基于最早开始时间算法的机器学习雷达调度方法。该方法采用EST算法寻找初始调度,并采用强化学习方法降低初始调度的成本。为了寻找更好的起始点,所有任务的起始时间在允许的时间范围内随机移动,移动后的任务重新与EST进行调度。然后应用梯度下降算法进一步移动任务的开始时间,以寻找增强解。这个过程要重复几次。成本最低的时间表是最终的解决方案。所提出的方法的性能进行了数值评估,根据具体情况,显示成本比EST低1.3至10.5倍。此外,一个完整的调度周期需要几十毫秒,因此可以考虑在实际雷达系统中使用该方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Machine Learning Radar Scheduling Method Based on the EST Algorithm
A machine learning radar scheduling method is proposed based on the earliest start time (EST) algorithm. In this method, the EST algorithm is used to find an initial schedule, and a reinforcement learning approach is conducted to reduce the cost of the initial schedule. In search for a better starting point, the start time of all the tasks are randomly shifted within their allowed time ranges, the shifted tasks are scheduled with the EST again. Then the gradient descent algorithm is applied to further shift the tasks' start times, in order to find an enhanced solution. The procedure is repeated several times. The schedule with the minimal cost is the final solution. The performance of the proposed method is evaluated numerically, showing 1.3 to 10.5 times less cost than the EST, depending on the scenario. In addition, a full cycle of scheduling takes a few tens of milliseconds thus the method could be considered in real radar systems.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信