TwoStep: 古典的プランナと大規模言語モデルを組み合わせたマルチエージェントタスク計画
TwoStep: Multi-agent Task Planning using Classical Planners and Large Language Models
LLMで目標をサブゴールに分解し、古典的プランナで各サブゴールを解くことで、マルチエージェント計画を高速かつ実行成功を保証しつつ効率的に行う手法を提案。
著者: David Bai, Ishika Singh, David Traum, Jesse Thomason
分類: cs.AI, cs.CL, cs.MA, cs.RO
原文アブストラクト
Classical planning formulations like the Planning Domain Definition Language (PDDL) admit action sequences guaranteed to achieve a goal state given an initial state if any are possible. However, reasoning problems defined in PDDL do not capture temporal aspects of action taking, such as concurrent actions between two agents when there are no conflicting conditions, without significant modification and definition to existing PDDL domains. A human expert aware of such constraints can decompose a goal into subgoals, each reachable through single agent planning, to take advantage of simultaneous actions. In contrast to classical planning, large language models (LLMs) directly used for inferring plan steps rarely guarantee execution success, but are capable of leveraging commonsense reasoning to assemble action sequences. We combine the strengths of both classical planning and LLMs by approximating human intuitions for multi-agent planning goal decomposition. We demonstrate that LLM-based goal decomposition leads to faster planning times than solving multi-agent PDDL problems directly while simultaneously achieving fewer plan execution steps than a single agent plan alone, as well as most multiagent plans, while guaranteeing execution success. Additionally, we find that LLM-based approximations of subgoals result in similar multi-agent execution lengths to those specified by human experts. Website and resources at https://glamor-usc.github.io/twostep
関連論文
- 人協調倉庫における混雑考慮型オンライン多エージェント集配アルゴリズムCARVSマルチエージェント計画
- 法的ガイドラインに基づく順序ゲームによる監査可能で展開可能なマルチエージェント動作計画マルチエージェント計画
- 多分岐コンティンジェンシーゲームのためのカスケード合意分割マルチエージェント計画
- SAFE-MA-RRT: データ駆動型安全証明を用いたマルチエージェント動作計画マルチエージェント計画
- ELHPlan:マルチエージェント協調のための効率的な長期タスクプランニングマルチエージェント計画
- 制約環境におけるマルチエージェント動作計画と衝突回避のためのMILPベース解法マルチエージェント計画
