日本フィジカルAI新聞

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

マルチエージェント経路計画arXiv:2306.06455

ソフト締切付き鉄道計画と再計画のスケーラブル化

Scalable Rail Planning and Replanning with Soft Deadlines

シェア:XThreadsFacebookLINEはてブBluesky

複数速度の列車と時間枠を扱う鉄道網のMAPF問題「Flatland 3」に対し、初期計画の優先順位付けと近傍選択戦略を改良し、故障時の部分再計画も可能にした手法を提案した。

著者: Zhe Chen, Jiaoyang Li, Daniel Harabor, Peter J. Stuckey

分類: cs.RO, cs.MA

原文アブストラクト

The Flatland Challenge, which was first held in 2019 and reported in NeurIPS 2020, is designed to answer the question: How to efficiently manage dense traffic on complex rail networks? Considering the significance of punctuality in real-world railway network operation and the fact that fast passenger trains share the network with slow freight trains, Flatland version 3 introduces trains with different speeds and scheduling time windows. This paper introduces the Flatland 3 problem definitions and extends an award-winning MAPF-based software, which won the NeurIPS 2020 competition, to efficiently solve Flatland 3 problems. The resulting system won the Flatland 3 competition. We designed a new priority ordering for initial planning, a new neighbourhood selection strategy for efficient solution quality improvement with Multi-Agent Path Finding via Large Neighborhood Search(MAPF-LNS), and use MAPF-LNS for partially replanning the trains influenced by malfunction.

関連論文

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

PR・アフィリエイト広告

MINISFORUM(ミニPC)

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