日本フィジカルAI新聞

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

週刊ニュースレター購読
群制御arXiv:2507.07074

マルチエージェントカリキュラム学習のためのグラフベース複雑度指標:協調環境におけるタスク順序付けの検証済み手法

Graph-Based Complexity Metrics for Multi-Agent Curriculum Learning: A Validated Approach to Task Ordering in Cooperative Coordination Environments

シェア:XThreadsFacebookLINEはてブBluesky

エージェント間の依存関係や空間干渉、目標重複をグラフで解析して協調タスクの難易度を予測する複雑度指標を提案し、MADDPGのカリキュラム学習で性能向上を実証した。

著者: Farhaan Ebadulla, Dharini Hindlatti, Srinivaasan NS, Apoorva VH, Ayman Aftab

分類: cs.MA, cs.RO

原文アブストラクト

Multi-agent reinforcement learning (MARL) faces significant challenges in task sequencing and curriculum design, particularly for cooperative coordination scenarios. While curriculum learning has demonstrated success in single-agent domains, principled approaches for multi-agent coordination remain limited due to the absence of validated task complexity metrics. This approach presents a graph-based coordination complexity metric that integrates agent dependency entropy, spatial interference patterns, and goal overlap analysis to predict task difficulty in multi-agent environments. The complexity metric achieves strong empirical validation with rho = 0.952 correlation (p < 0.001) between predicted complexity and empirical difficulty determined by random agent performance evaluation. This approach evaluates the curriculum learning framework using MADDPG across two distinct coordination environments: achieving 56x performance improvement in tight coordination tasks (MultiWalker) and demonstrating systematic task progression in cooperative navigation (Simple Spread). Through systematic analysis, coordination tightness emerges as a predictor of curriculum learning effectiveness, where environments requiring strict agent interdependence benefit substantially from structured progression. This approach provides a validated complexity metric for multi-agent curriculum design and establishes empirical guidelines for multi-robot coordination applications.

関連論文

PR本紙発行元 EmplifAI