{"title":"网络车辆组内卸载安全关键应用的调度","authors":"John B. Mains, Thanakorn Khamvilai, E. Feron","doi":"10.1109/DASC50938.2020.9256820","DOIUrl":null,"url":null,"abstract":"This paper presents a combined scheduling and path planning scheme for offloading of safety-critical applications in a group of networked vehicles. Due to the dynamic nature of such systems, a scheduler for applications to be offloaded needs to account for the changes of the network parameters. Such a scheduling scheme based on a mixed-integer program (MIP) is detailed with attention to the time-varying duration of message passing operations. Given knowledge of the scheduling requirements of applications to be offloaded, a path planner for a group of networked vehicles can ensure the resulting path will yield a feasible schedule for offloading. An method for generating such a path is described, utilizing the scheduling scheme and a mixed-integer program for path planning with integral communication capacity constraints. The combined scheme is demonstrated in a case study consisting of a pair of UAS equipped with a line-of-sight inter-vehicle a communication link and onboard processors. We show how the scheme can be used to make individual vehicles of the group fault-tolerant to processor failures.","PeriodicalId":112045,"journal":{"name":"2020 AIAA/IEEE 39th Digital Avionics Systems Conference (DASC)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Scheduling for Offloading Safety-Critical Applications Within Networked Groups of Vehicles\",\"authors\":\"John B. Mains, Thanakorn Khamvilai, E. Feron\",\"doi\":\"10.1109/DASC50938.2020.9256820\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a combined scheduling and path planning scheme for offloading of safety-critical applications in a group of networked vehicles. Due to the dynamic nature of such systems, a scheduler for applications to be offloaded needs to account for the changes of the network parameters. Such a scheduling scheme based on a mixed-integer program (MIP) is detailed with attention to the time-varying duration of message passing operations. Given knowledge of the scheduling requirements of applications to be offloaded, a path planner for a group of networked vehicles can ensure the resulting path will yield a feasible schedule for offloading. An method for generating such a path is described, utilizing the scheduling scheme and a mixed-integer program for path planning with integral communication capacity constraints. The combined scheme is demonstrated in a case study consisting of a pair of UAS equipped with a line-of-sight inter-vehicle a communication link and onboard processors. We show how the scheme can be used to make individual vehicles of the group fault-tolerant to processor failures.\",\"PeriodicalId\":112045,\"journal\":{\"name\":\"2020 AIAA/IEEE 39th Digital Avionics Systems Conference (DASC)\",\"volume\":\"60 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-10-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 AIAA/IEEE 39th Digital Avionics Systems Conference (DASC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DASC50938.2020.9256820\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 AIAA/IEEE 39th Digital Avionics Systems Conference (DASC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DASC50938.2020.9256820","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Scheduling for Offloading Safety-Critical Applications Within Networked Groups of Vehicles
This paper presents a combined scheduling and path planning scheme for offloading of safety-critical applications in a group of networked vehicles. Due to the dynamic nature of such systems, a scheduler for applications to be offloaded needs to account for the changes of the network parameters. Such a scheduling scheme based on a mixed-integer program (MIP) is detailed with attention to the time-varying duration of message passing operations. Given knowledge of the scheduling requirements of applications to be offloaded, a path planner for a group of networked vehicles can ensure the resulting path will yield a feasible schedule for offloading. An method for generating such a path is described, utilizing the scheduling scheme and a mixed-integer program for path planning with integral communication capacity constraints. The combined scheme is demonstrated in a case study consisting of a pair of UAS equipped with a line-of-sight inter-vehicle a communication link and onboard processors. We show how the scheme can be used to make individual vehicles of the group fault-tolerant to processor failures.