{"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}
引用次数: 1
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.