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 · pp. 8124-8134 · 0 citations · 13 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

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
Conference Jul 2026

Utility-Guided Orchestration for Cost-Efficient Tool-Augmented LLM Services

Tool-augmented large language model (LLM) services can solve complex tasks through retrieval and external tools, but current execution paradigms often trade adaptability for efficiency. Fixed workflows are predictable but rigid, while freeform reasoning loops such as ReAct may over-execute and issue redundant tool call...

Bo-Yang Liu, Gongming Zhao, Hongliu Xu et al. · 0 citations
Open access Jul 2026

AI-Powered Multi-Agent Personalized Trip Planning Platform Using LLMs, RAG, and Cloud Services

This paper presents an AI-Powered Personalized Trip Planner—a full-stack intelligent system that dynamically generates end-to-end itineraries tailored to individual preferences, budget constraints, and live environmental conditions.

Aryan Kumar Gupta, B. S, C. Kumar et al. · 0 citations
Jul 2026

Mosaic: Runtime-Efficient Multi-Agent Embodied Planning

Mosaic is introduced, a runtime-efficient multi-agent planning framework that maintains accurate yet lightweight state tracking through agent-centric semantic memory that stores objects in relative coordinates, enabling geometric transformations and coordination.

Kunjal Panchal, Saayan Mitra, Sunav Choudhary et al. · 0 citations
Jul 2026

Otap:Structure-Aware Optimal Transport for Evaluating Planning and Execution in Agent Trajectories

This work reframe trajectory evaluation as a distance between the agent's execution graph and a set of valid solution graphs, and instantiates OTAP via an unbalanced fused Gromov-Wasserstein transport problem over attributed dependency graphs, which is a pseudo-metric that is provably invariant to dependency-preserving...

Babak Barazandeh, Subhabrata Majumdar, G. Michailidis · 0 citations

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