paper-with-me

홈 › Papers

MagicAgent: Towards Generalized Agent Planning

2026-02-22 · Xuhui Ren, Shaokang Dong, Chen Yang, Qing Gao, Yunbin Zhao, Yongsheng Liu, Xinwei Geng, Xiang Li, Demei Yan, Yanqing Li, Chenhao Huang, Dingwei Zhu, Junjie Ye, Boxuan Yue, Yingnan Fu, Mengzhe Lv, Zezeng Feng, Boshen Zhou, Bocheng Wang, Xuanjing Huang, Yu-Gang Jiang, Tao Gui, Qi Zhang, Yunke Zhang arxiv

The evolution of Large Language Models (LLMs) from passive text processors to autonomous agents has established planning as a core component of modern intelligence. However, achieving generalized planning remains elusive, not only by the scarcity of high-quality interaction data but also by inherent conflicts across heterogeneous planning tasks. These challenges result in models that excel at isolated tasks yet struggle to generalize, while existing multi-task training attempts suffer from gradient interference. In this paper, we present \textbf{MagicAgent}, a series of foundation models specifically designed for generalized agent planning. We introduce a lightweight and scalable synthetic data framework that generates high-quality trajectories across diverse planning tasks, including hierarchical task decomposition, tool-augmented planning, multi-constraint scheduling, procedural logic orchestration, and long-horizon tool execution. To mitigate training conflicts, we propose a two-stage training paradigm comprising supervised fine-tuning followed by multi-objective reinforcement learning over both static datasets and dynamic environments. Empirical results show that MagicAgent-32B and MagicAgent-30B-A3B achieve superior performance across diverse open-source benchmarks (\emph{e.g.}, $75.1\%$ on Worfbench and $86.9\%$ on BFCL-v3), as well as strong results on our in-house MagicEval benchmarks, substantially outperforming existing sub-100B models and surpassing leading ultra-scale models, including GPT-5.2, Kimi-K2 and GLM-4.7.

📄 PDF Abstract BibTeX arXiv:2602.19000

Code (0)

등록된 구현이 없습니다.

Tasks

Reinforcement Learning

Similar Papers 제목 키워드 기반

A Study of Belief Revision Postulates in Multi-Agent Systems (Extended Version)

2026-05-04 · Michael Thielscher, Tran Cao Son arxiv

We investigate the belief revision problem in epistemic planning, i.e., what will be the beliefs of all agents in a multi-agent system after an agent gains the belief in some state property. Based on the standard represe…

Epistemic Reasoning

Learning and Reusing Policy Decompositions for Hierarchical Generalized Planning with LLM Agents

2026-05-07 · Shirin Sohrabi, Haritha Ananthakrishnan, Harsha Kokel, Kavitha Srinivas 외 arxiv

We present a dynamic policy-learning approach that combines generalized planning and hierarchical task decomposition for LLM-based agents. Our method, Hierarchical Component Learning for Generalized Policies (HCL-GP ), l…

Energy Efficient Automated Driving as a GNEP: Vehicle-in-the-loop Experiments

2024-11-21 · Viranjan Bhattacharyya, Tyler Ard, Rongyao Wang, Ardalan Vahidi 외

In this paper, a multi-agent motion planning problem is studied aiming to minimize energy consumption of connected automated vehicles (CAVs) in lane change scenarios. We model this interactive motion planning as a genera…

Model Predictive ControlMotion Planning

PoAct: Policy and Action Dual-Control Agent for Generalized Applications

2025-01-13 · Guozhi Yuan, Youfeng Liu, Jingli Yang, Wei Jia 외

Based on their superior comprehension and reasoning capabilities, Large Language Model (LLM) driven agent frameworks have achieved significant success in numerous complex reasoning tasks. ReAct-like agents can solve vari…

Large Language Model

Compositional planning in Markov decision processes: Temporal abstraction meets generalized logic composition

2018-10-05 · Xuan Liu, Jie Fu

In hierarchical planning for Markov decision processes (MDPs), temporal abstraction allows planning with macro-actions that take place at different time scale in form of sequential composition. In this paper, we propose …