日本フィジカルAI新聞

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

群制御arXiv:2207.06155

総完了時間最小化を目的とした複数拠点・複数トリップ車両ルーティング

Multi-Depot Multi-Trip Vehicle Routing with Total Completion Time Minimization

シェア:XThreadsFacebookLINEはてブBluesky

災害救助のためのUAV群の経路計画を、総完了時間を最小化する複数拠点・複数トリップ車両ルーティング問題として定式化し、MILPとマトヒューリスティックを提案した。

著者: Tiziana Calamoneri, Federico Corò, Simona Mancini

分類: math.OC, cs.RO

原文アブストラクト

Unmanned aerial vehicles (UAVs) are aircraft whose flights can be fully autonomous without any provision for human intervention. One of the most useful and promising domains where UAVs can be employed is natural disaster management. In this paper, we focus on an emergency scenario and propose the use of a fleet of UAVs that help rescue teams to individuate people needing help inside an affected area. We model this situation as an original graph theoretical problem called Multi-Depot Multi-Trip Vehicle Routing Problem with Total Completion Times minimization (MDMT-VRP-TCT); we go through some problems already studied in the literature that appear somehow similar to it and highlight the differences, propose a mathematical formulation for our problem as a MILP, design a matheuristic framework to quickly solve large instances, and experimentally test its performance. Beyond the proposed application, our solution works in any case in which a multi-depot multi-trip vehicle routing problem must be solved.

関連論文

  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・アフィリエイト広告

FRONTIER(GPU搭載BTOパソコン)

FRONTIER(GPU搭載BTOパソコン)の公式広告バナーFRONTIERでGPU搭載PCを見る ↗
PR本紙発行元 EmplifAI