移动机器人群体的时空协调

Daniel Graff, R. Karnapke
{"title":"移动机器人群体的时空协调","authors":"Daniel Graff, R. Karnapke","doi":"10.1109/LCN.2016.81","DOIUrl":null,"url":null,"abstract":"Context-aware applications that require access to physical space and time are a necessity in cyber-physical systems. We focus on the design of a cyber-physical operating system in which a space-time scheduler is the core-component responsible for resource management. Given a set of space-time tasks and a set of mobile robots that move through physical space, a main objective remains in finding a mapping of tasks to robots. In this paper, we address the problem of scheduling a set of tasks with spatio-temporal constraints in space and time. We present an online-scheduler that computes collision-free spatio-temporal trajectories for the robots in order to execute the space-time tasks. As side condition, collisions with static as well as dynamic obstacles must be avoided at all times. The scheduler consists of two components: a job scheduler that uses a heuristic and performs a coarse-grained scheduling and a trajectory planner that takes the output of the job scheduler and computes spatio-temporal trajectories.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"24 1","pages":"515-518"},"PeriodicalIF":0.0000,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Spatio-Temporal Coordination of Mobile Robot Swarms\",\"authors\":\"Daniel Graff, R. Karnapke\",\"doi\":\"10.1109/LCN.2016.81\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Context-aware applications that require access to physical space and time are a necessity in cyber-physical systems. We focus on the design of a cyber-physical operating system in which a space-time scheduler is the core-component responsible for resource management. Given a set of space-time tasks and a set of mobile robots that move through physical space, a main objective remains in finding a mapping of tasks to robots. In this paper, we address the problem of scheduling a set of tasks with spatio-temporal constraints in space and time. We present an online-scheduler that computes collision-free spatio-temporal trajectories for the robots in order to execute the space-time tasks. As side condition, collisions with static as well as dynamic obstacles must be avoided at all times. The scheduler consists of two components: a job scheduler that uses a heuristic and performs a coarse-grained scheduling and a trajectory planner that takes the output of the job scheduler and computes spatio-temporal trajectories.\",\"PeriodicalId\":6864,\"journal\":{\"name\":\"2016 IEEE 41st Conference on Local Computer Networks (LCN)\",\"volume\":\"24 1\",\"pages\":\"515-518\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE 41st Conference on Local Computer Networks (LCN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LCN.2016.81\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.2016.81","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

需要访问物理空间和时间的上下文感知应用程序在网络物理系统中是必要的。我们着重于设计一个网络物理操作系统,其中一个时空调度程序是负责资源管理的核心组件。给定一组时空任务和一组在物理空间中移动的移动机器人,一个主要目标仍然是找到任务到机器人的映射。在本文中,我们讨论了在空间和时间上具有时空约束的一组任务的调度问题。我们提出了一个在线调度程序,为机器人计算无碰撞的时空轨迹,以执行时空任务。作为侧面条件,必须始终避免与静态和动态障碍物发生碰撞。调度器由两个组件组成:使用启发式方法并执行粗粒度调度的作业调度器和接受作业调度器输出并计算时空轨迹的轨迹规划器。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Spatio-Temporal Coordination of Mobile Robot Swarms
Context-aware applications that require access to physical space and time are a necessity in cyber-physical systems. We focus on the design of a cyber-physical operating system in which a space-time scheduler is the core-component responsible for resource management. Given a set of space-time tasks and a set of mobile robots that move through physical space, a main objective remains in finding a mapping of tasks to robots. In this paper, we address the problem of scheduling a set of tasks with spatio-temporal constraints in space and time. We present an online-scheduler that computes collision-free spatio-temporal trajectories for the robots in order to execute the space-time tasks. As side condition, collisions with static as well as dynamic obstacles must be avoided at all times. The scheduler consists of two components: a job scheduler that uses a heuristic and performs a coarse-grained scheduling and a trajectory planner that takes the output of the job scheduler and computes spatio-temporal trajectories.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信