Skip to content
Book Open access

DualLane: Fast and Reliable LLM Agents for Interactive AIOps via Dual-Path Planning

Aug 2026 · Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2 · 0 citations · 30 references

TL;DR

DualLane, a novel parallel dual-path planning architecture designed for AI agents, adaptively manages the highly skewed frequency distribution characteristic of real-world user queries and underscores the practical viability and effectiveness of adaptive dual-path planning in large-scale, interactive AIOps systems.

Abstract

Ticket support in cloud services involves technical engineers using expert tools to resolve customer queries—% a process closely resembling information integration. To enhance both operational efficiency and resolution accuracy, we propose DualLane, a novel parallel dual-path planning architecture designed for AI agents. This framework adaptively manages the highly skewed frequency distribution characteristic of real-world user queries. For low-frequency long-tail scenarios, the slow path employs a two-stage planning mechanism that decouples task decomposition from parameter generation, effectively optimizing dependency propagation and reducing context complexity. In contrast, for high-frequency routine scenarios, the fast path bypasses expensive LLM-based full-plan generation by utilizing pre-validated execution templates, thereby improving response accuracy and reducing latency. After more than one year of extensive deployment in Alibaba Cloud's ECS production environment, DualLane has demonstrated remarkable robustness and stability. Offline benchmarks indicate a high accuracy rate of 96.5%, accompanied by superior latency performance. Crucially, online metrics reveal a median plan-execution latency of merely 4.2 seconds, with an agent-induced error rate maintained at a low 7.1%. These results underscore the practical viability and effectiveness of adaptive dual-path planning in large-scale, interactive AIOps systems.

Read PDF

Similar papers

#artificial intelligence Preprint Sep 2026

Design and Evaluation of LLM Chaining-Based Task Planning for General Purpose Service Robots

This work proposes an LLM chaining architecture that separates instruction classification and action generation into two specialized stages, reducing per-inference prompt length by approximately 45% while improving planning consistency.

Lucas Da Mota Bruno, Jiahao Sim, Y. Hagiwara · 0 citations
#machine learning Preprint Sep 2026

TRIAGE: Three-level Routing and Intelligent Agent Guidance for Efficient Execution

TRIAGE, a three-level routing framework that reduces token consumption by reusing historical execution trajectories, and proposes an automatic Skill extraction mechanism that distills high-frequency trajectory patterns into deterministic Skills, creating a positive feedback loop of the more you use it, the more efficie...

R. Wei · 1 citation
Preprint Aug 2026

MobilePA-Bench: Benchmarking Mobile Planner Agents on Complex Real-World Tasks

By pairing an interactive function-calling sandbox with evidence-based verification, MobilePA-Bench serves as both a practical diagnostic benchmark and an interactive foundation for agentic reinforcement learning---accelerating the development of dependable mobile agents.

Yi Zhu, Xiong-Wei Wu, Qiyi Wang et al. · 1 citation
#artificial intelligence Preprint Sep 2026

MAPLE: Memory-Augmented Planning with Language and Evolution

This work introduces MAPLE (Memory-Augmented Planning with Language and Evolution), an agent for maintaining optimization problems through successive natural-language requests and introduces NLDO, a benchmark of 15 trajectories and 180 updates spanning selection, scheduling, rostering, routing, and cloud-resource place...

Ke-Sheng Chen, Yamin Hu, Wen-Jian Luo · 0 citations
#artificial intelligence Preprint Sep 2026

OptiCom : A Unified Framework for State-Conditioned Composition in LLM-Driven Optimization

OptiCom is proposed, a unified framework that represents LLM-driven optimizers within a shared configuration space: C=(A,Q,O,E,M,S), corresponding to artifact, query, operator, evaluation, memory, and strategy, corresponding to artifact, query, operator, evaluation, memory, and strategy.

Chen-Xing Wei, Si-Chen Liu, Lizzie Liu et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Occamy-1.0: Open Pareto-frontier 35B Intelligence for Co-work

Occamy-1.0, a cost-efficient co-work model obtained by further training the post-trained Qwen3.6-35B-A3B checkpoint, is presented and placed at the low-cost knee of the observed cost--performance Pareto frontier.

Wen-Hui Chen, Shi-Wen Cheng, Hao Dong et al. · 3 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.