.png){kind=icon}
返回
Robust scheduling in team-robotics
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jss.2003.12.035.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Mobile robots interact with a dynamically changing, physical environment. All tasks controlling such interactions must be performed reliably and in real-time. Information from the local sensors often is incomplete or inconsistent. Distributed sensor fusion is a technique that enables a team to get a more complete view of the world with a better quality of the provided information. In this paper we address the problem of scheduling the local processing tasks that are part of the overall fusion process. The particular problem to be addressed lies in the unpredictable execution times of these tasks, which do not allow for scheduling using worst-case execution times. The Time-Aware Fault-Tolerant (TAFT) scheduler allows working with expected-case execution times instead, and still achieves a predictable timing behavior. The paper details an efficient scheduling strategy for TAFT based on Earliest Deadline algorithms, formalizing the adopted task model and the underlying scheduling mechanism. Results are presented showing the achieved real-time behavior with an increased acceptance rate, a higher throughput, and a graceful degradation in transient overload Situations compared to standard schedulers. Additionally, it describes the implementation of TAFT in the real-time platform that is embedded in our robot team. (c) 2004 Elsevier Inc. All rights reserved.
Keyword:
team-robotics
sensor fusion
robust scheduling
unpredictable execution times
over load
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.1
论文数:
5.5K
被引数:
8.4K
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏分享收藏 没有更多内容
没有更多内容