{"title":"A real-time heterogeneous distributed computing environment for multi-robot system","authors":"Khaja Qutubudin, D. Pease","doi":"10.1109/ISORC.2000.839554","DOIUrl":null,"url":null,"abstract":"Proposes a distributed computing framework for the real-time management of a large number of robots in an industrial setting. The primary design objective of this framework is to allow a centralized heterogeneous multiprocessor controller to perform real-time scheduling and evaluation of Newton-Euler equations for manipulating the robot motion. The real-time scheduling of tasks in such an environment is shown to be an NP-hard problem, for which we propose a deadline-based heuristic. A detailed simulation reveals that the proposed heuristic can achieve near-optimal performance.","PeriodicalId":127761,"journal":{"name":"Proceedings Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2000) (Cat. No. PR00607)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2000) (Cat. No. PR00607)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISORC.2000.839554","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
Proposes a distributed computing framework for the real-time management of a large number of robots in an industrial setting. The primary design objective of this framework is to allow a centralized heterogeneous multiprocessor controller to perform real-time scheduling and evaluation of Newton-Euler equations for manipulating the robot motion. The real-time scheduling of tasks in such an environment is shown to be an NP-hard problem, for which we propose a deadline-based heuristic. A detailed simulation reveals that the proposed heuristic can achieve near-optimal performance.