首页> 外国专利> SYSTEMS AND METHODS FOR SCHEDULING A SET OF NON-PREEMPTIVE TASKS IN A MULTI-ROBOT ENVIRONMENT

SYSTEMS AND METHODS FOR SCHEDULING A SET OF NON-PREEMPTIVE TASKS IN A MULTI-ROBOT ENVIRONMENT

机译:在多机器人环境中安排一组非优先任务的系统和方法

摘要

Systems and methods for scheduling non-preemptive tasks in a multi-robot environment is provided. Traditional systems and methods facilitating preemptive task(s) allocation in a multi-processor environment are not applicable in the multi-robot environment since tasks are preemptive. Additionally, critical parameters like deadline and performance loss are not considered. Embodiments of the present disclosure provide for scheduling of a set of non-preemptive tasks by partitioning, the set of non-preemptive tasks either as a set of schedulable tasks or as a set of non-schedulable tasks; sorting, by a scheduling technique, the set of non-preemptive tasks partitioned; determining, by the scheduling technique, a possibility of execution of each of the set of schedulable tasks; and scheduling the set of schedulable tasks and the set of non-schedulable tasks upon determining the possibility of execution of each of the set of schedulable tasks. The present disclosure focuses on performance loss minimization when deadline miss is unavoidable.
机译:提供了用于在多机器人环境中调度非抢占任务的系统和方法。由于任务是抢先的,因此在多处理器环境中促进抢先任务分配的传统系统和方法不适用于多机器人环境。此外,不考虑关键参数,例如期限和性能损失。本公开的实施例提供了通过分区来调度一组非抢占任务的方法,该组非抢占任务可以作为一组可调度的任务或作为一组不可调度的任务进行;通过调度技术对分区的非抢占任务集进行排序;通过调度技术确定执行该组可调度任务中的每一个的可能性;在确定执行所述一组可调度任务中的每一个的可能性时,调度所述一组可调度任务和所述一组非调度任务。当不可避免地错过期限时,本公开集中于性能损失最小化。

著录项

  • 公开/公告号EP3588405A1

    专利类型

  • 公开/公告日2020-01-01

    原文格式PDF

  • 申请/专利权人 TATA CONSULTANCY SERVICES LIMITED;

    申请/专利号EP20190157194

  • 发明设计人 SARKAR CHAYAN;AGARWAL MARICHI;

    申请日2019-02-14

  • 分类号G06Q10/08;G06Q10/06;

  • 国家 EP

  • 入库时间 2022-08-21 11:38:11

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号