arXiv:2605.02366cs.AI2026-05中稿 · as demo submission…

用复合AI助手整合分散资助信息,对话式查询10分钟内完成原本需半小时的找项目工作。

A Compound AI Agent for Conversational Grant Discovery

论文配图:A Compound AI Agent for Conversational Grant Discovery
图 1 · 摘自论文原文
  • 分两层构建:自动采集1.2万+项目数据并统一索引,再通过对话式搜索精准匹配研究需求
  • 实测将找资助时间从30-45分钟缩短至10分钟内,支持多轮交互持续优化结果
  • 适合科研人员快速发现匹配项目,尤其适合跨机构、跨领域研究者使用

科研资助发现仍高度碎片化:研究人员需在不同机构门户(如美国的NSF、NIH、DARPA、Grants.gov等)间穿梭,面对异构界面、搜索能力与数据结构。我们提出一个复合型AI系统,由两个紧密耦合组件构成:(1) 聚合层,通过配备大模型的浏览器代理,自主收集、归一化并索引近12,000项联邦及非营利资助机会,维护双周更新的统一数据库;(2) 基于ReAct的智能查询处理层,理解研究背景(包括来自PDF文档的信息),结合结构化索引与选择性网络搜索,检索相关项目,同时避免大模型幻觉。对话接口支持多轮迭代优化,研究者可逐步添加约束而无需重述核心研究内容。结果实时返回,中间推理过程全程透明,有助于建立用户信任。目前已有近3,000名用户使用,验证了该方法可行性——将资助发现时间从手动碎片化搜索的30–45分钟缩短至10分钟以内。

原文摘要 · Abstract (English)

Research funding discovery remains fundamentally fragmented: researchers navigate disparate agency portals (e.g., in the United States, NSF, NIH, DARPA, Grants.gov, and many others) with heterogeneous interfaces, search capabilities, and data schemas. We present a compound AI system that unifies this landscape through two tightly coupled components: (1) an aggregation layer that autonomously collects, normalizes, and indexes almost 12,000 federal and nonprofit opportunities from fragmented sources via LLM-equipped browser agents, maintaining a biweekly-updated unified database; and (2) an agentic ReAct-based query processing layer that interprets research context (including from PDF documents) and employs hybrid search combining a structured index with selective web search to retrieve relevant opportunities - while avoiding LLM hallucination. The conversational interface supports iterative refinement through multi-turn interactions, allowing researchers to progressively apply constraints without reformulating their core research description. Results stream in real time with full transparency of intermediate reasoning, enabling appropriate calibration of user trust. Currently used by almost 3,000+ users, our approach demonstrates the feasibility of compound AI in reducing grant discovery time from 30--45 minutes (manual, fragmented portal searches) to under 10 minutes (unified, conversational search).

AI助研资助发现对话系统自动化

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。