日本フィジカルAI新聞

世界のフィジカルAIを、日本語で。

スケジューリングarXiv:2012.03555

時間窓制約付きクラウドロボティクスにおける動的タスクスケジューリングのメイクスパン改善

Improving Makespan in Dynamic Task Scheduling for Cloud Robotic Systems with Time Window Constraints

シェア:XThreadsFacebookLINEはてブBluesky

ロボットネットワークのクラウドシステムで、タスクの時間窓制約を満たしつつ全タスク完了までの最大時間(メイクスパン)を最小化するグリッドベースの負荷分散スケジューリングアルゴリズムを提案し、理論的正しさとシミュレーションで示した論文。

著者: Saeid Alirezazadeh, Luís A. Alexandre

分類: cs.RO

原文アブストラクト

A scheduling method in a robotic network cloud system with minimal makespan is beneficial as the system can complete all the tasks assigned to it in the fastest way. Robotic network cloud systems can be translated into graphs where nodes represent hardware with independent computing power and edges represent data transmissions between nodes. Time window constraints on tasks are a natural way to order tasks. The makespan is the maximum amount of time between when the first node to receive a task starts executing its first scheduled task and when all nodes have completed their last scheduled task. Load balancing allocation and scheduling ensures that the time between when the first node completes its scheduled tasks and when all other nodes complete their scheduled tasks is as short as possible. We propose a grid of all tasks to ensure that the time window constraints for tasks are met. We propose grid of all tasks balancing algorithm for distributing and scheduling tasks with minimum makespan. We theoretically prove the correctness of the proposed algorithm and present simulations illustrating the obtained results.

関連論文

  1. 1Boston Dynamics、車輪付きAtlasの研究試作機を紹介研究・技術
  2. 2newmoとKDDIが資本業務提携 2028年に堺市で自動運転タクシー商用化目指す提携・買収
  3. 3GXOとApptronik、Apolloの物流現場試験を拡大 最大1,000台の展開を構想量産・展開
  4. 4NVIDIA、CoRLでGR00T 2とIsaac Lab 3.0を発表新製品・発表
  5. 5UC BerkeleyとNVIDIAの研究者、AIエージェントでロボット制御コードを仮想環境で改善研究・技術

PR・アフィリエイト広告

MINISFORUM(ミニPC)

MINISFORUM(ミニPC)の公式広告バナーMINISFORUM公式ストアを見る ↗
PR本紙発行元 EmplifAI