为大型宗教集会设计低耗高效的智能助手,用语义检索替代盲目调用大模型。
KumbhDoot: A Scale-Ready, LLM-Bounded Architecture for Mass-Gathering Public-Service Assistants
- 先用语义相似度匹配答案,仅在必要时才调用生成模型,降低延迟与成本。
- 构建嵌入索引的语义缓存,支持离线查询、多智能体协同和答案缓存。
- 适合高风险、低网络环境下的公共信息服务,如大型集会或应急场景。
大规模宗教集会如那西克狮首圣会(Nashik Simhastha Kumbh Mela)在数周内将数千万人聚集于单一区域,带来高强度、重复性、多语言且关乎安全的信息需求。传统依赖大语言模型(LLM)的对话系统在此场景下表现不佳:扩展成本高、紧急情况响应慢、易产生误导性幻觉并可能造成人身伤害,且在无网络时完全失效。本文提出KumbhDoot,一种基于语义优先原则的智能朝圣助手架构。系统以语义相似度匹配为核心,仅当检索无法准确回答时才调用生成模型。其核心是“语义缓存”——一个嵌入索引的统一检索存储,用于意图路由、答案缓存、离线查询及多智能体检索。采用定制三层级代理架构,直接操作该缓存,确保决策路径可追溯,避免通用多智能体框架带来的隐式每步大模型调用。我们展示该架构设计、单次查询经济分析模型,并坦诚说明语义匹配适用边界与生成推理仍需介入的场景。我们认为,在边界明确、高风险、低连通性的公共服务领域,语义优先、大模型受限的设计不仅更经济,更在架构上优于默认使用大模型的方案。
原文摘要 · Abstract (English)
Mass religious gatherings such as the Kumbh Mela concentrate tens of millions of people into a single region over a few weeks, producing intense, repetitive, multilingual, and safety-critical demand for information. The default response, a conversational assistant that routes every query to a large language model (LLM), is poorly matched to this setting: it is costly at scale, slow on emergency paths, prone to hallucination on facts that can cause physical harm, and unusable when connectivity fails. We describe KumbhDoot, an agentic pilgrim assistant for the Nashik Simhastha Kumbh Mela built on a different principle. It operates on a foundational design principle that prioritizes semantic similarity over starting with an LLM. Generative models are invoked only in instances where similarity-based retrieval is insufficient to produce a correct answer. The system utilizes a "semantic cache": an embedding-indexed store as a single retrieval primitive, which handles intent routing, answer caching, offline lookups, and multi-agent retrieval. A custom three-tier agent architecture operates directly on this store, ensuring decision paths remain inspectable and avoiding the use of generic multi-agent frameworks that would trigger implicit per-step LLM calls. We present the architecture, an analytical cost model for its per-query economics, and an honest account of where similarity is sufficient and where generative reasoning remains necessary. We argue that for bounded, high-stakes, low-connectivity public-service domains, a similarity-first and LLM-bounded design is not merely cheaper but architecturally more appropriate than an LLM-default one.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。