Construction of DAG Models for Autonomous Systems
Jing Huang, Kuan Jiang, Weijie Wang, Wei Liang, Wanli Chang
Abstract
Directed Acyclic Graphs (DAGs) are widely deployed as task models in autonomous systems, including vehicles and drones, to capture functional dependency. DAG scheduling has been extensively investigated by various communities to shorten makespan, under the common assumption that the model itself is given a priori. This work studies a rarely touched problem - construction of DAG models - and considers time-triggered blended task chains predominant in autonomous systems. We report representation semantics and a topology optimization method. Experiments show that the average end-to-end response time reduction is 4.8 times of the conventional Floyd algorithm. Our time complexity is , making it suitable for handling dynamic tasks as well.
Ask Lune
Know where this paper stands in minutes, not an afternoon.
Lune can read the top-tier papers that cite it and the ones closest to it, and tells you what it claims, what came after and where it falls short, each point cited to the paper it comes from. No skimming, no AI slop.
Related papers
- DAG Scheduling and Analysis on Multiprocessor Systems: Exploitation of Parallelism and DependencyShuai Zhao, Xiaotian Dai, Iain Bate, Alan Burns et al.RTSS 2020 · 73 citations
- Priority Optimization for Autonomous Driving Systems to Meet End-to-End Latency ConstraintsXisheng Li, Ye Ma, Yuting Chen, Jinghao Sun et al.RTSS 2024 · 3 citations
- Conditionally Optimal Parallelization of Real-Time DAG Tasks for Global EDFYoungeun Cho, Dongmin Shin, JaeSeung Park, Chang-Gun LeeRTSS 2021 · 12 citations
- Directed Graph Grammars for Sequence-based LearningMichael Sun, Orion Foo, Gang Liu, Wojciech Matusik et al.ICML 2025
- LayerDAG: A Layerwise Autoregressive Diffusion Model for Directed Acyclic Graph GenerationMufei Li, Viraj Shitole, Eli Chien, Changhai Man et al.ICLR 2025
