网络车辆组内卸载安全关键应用的调度

John B. Mains, Thanakorn Khamvilai, E. Feron
{"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}
引用次数: 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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信