{"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}
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.