二、GitHub 当日热点:Agent 与机器人方向的热门仓库与方法
Part 2 · GitHub: popular agent and robotics repositories
本期仓库围绕「Agent 的安全与可见性」:MCP 配置审计、Agent 树侧栏、本地优先多 Agent 平台、主控—子 Agent 上下文隔离,以及开源具身小鸭与四足跑酷策略。
These repos focus on agent security and visibility: MCP config auditing, agent-tree sidebars, a local-first multi-agent platform, controller/subagent context isolation, plus an open embodied duck and a quadruped parkour policy.
01
graygnatconsole/mcp-audit-tool
graygnatconsole/mcp-audit-tool
⭐ 612 · Python · CI 就绪⭐ 612 · Python · CI-ready
这是给 MCP(Model Context Protocol)服务器做安全审计的命令行工具:扫描 Agent 配置中的工具投毒、rug pull、硬编码密钥、命令注入与供应链风险,纯 Python,支持 SARIF 与 CI[22]。它要解决的是MCP 生态缺少安全基线:Agent 通过 MCP 接入的工具由第三方提供,描述与实现可能在更新中被替换,而使用者很难逐个人工审计。值得借鉴的是把 Agent 的工具配置纳入 CI 扫描,与代码同等对待;限制是静态扫描难以发现运行时行为变化,规则覆盖也取决于维护者更新。
This is a command-line security auditor for MCP (Model Context Protocol) servers: it scans agent configs for tool poisoning, rug pulls, hardcoded secrets, command injection and supply-chain risks, in pure Python with SARIF and CI support[22]. It addresses the missing security baseline in the MCP ecosystem: agents connect to third-party tools whose descriptions and implementations can change on update, and users cannot audit each one by hand. Worth borrowing is putting agent tool configuration into CI scanning, treating it like code; the limitation is that static scanning struggles with runtime behaviour changes, and rule coverage depends on maintainers.
02
Zafer-Liu/claude-super-sidebar
Zafer-Liu/claude-super-sidebar
⭐ 133 · JavaScript · 可视化⭐ 133 · JavaScript · visualisation
claude-super-sidebar 给 Claude Code 与 Codex 加了一个可视化侧栏:显示 Agent 树、实时状态与对话任务流[23]。它要解决的是多 Agent 并行时的「看不见」:用户只能看到当前会话,不知道其它 Agent 在做什么、卡在哪一步。把 Agent 树与任务流可视化,是把「人在环」落到界面上的前提。值得借鉴的是状态可视化要先于自动化;限制是依赖各客户端接口,版本升级可能导致失效。
claude-super-sidebar adds a visual sidebar to Claude Code and Codex: agent trees, live status and conversation task flows[23]. It addresses invisibility when several agents run in parallel: users see only the current session and cannot tell what other agents are doing or where they are stuck. Visualising agent trees and task flows is the precondition for real human-in-the-loop. Worth borrowing is making state visible before automating more; the limitation is dependence on client interfaces, which may break across versions.
03
lmliheng/Adelie
lmliheng/Adelie
⭐ 123 · TypeScript · 本地优先⭐ 123 · TypeScript · local-first
Adelie 是一个本地优先的多 Agent 应用开发平台,构建在 PenguinHarness 之上[24]。它要解决的是多 Agent 应用从原型到可部署产品的落差:演示里几个 Agent 协作很容易,但要让它们在本地可靠运行、管理状态与工具,需要一套运行时与开发框架。本地优先也意味着代码与数据不必上传。值得借鉴的是把「多 Agent 应用」当成一个完整的工程问题,而不是提示词编排;限制是项目 2026-10-04 才创建、生态与文档成熟度有限。
Adelie is a local-first multi-agent application development platform built on PenguinHarness[24]. It addresses the gap between multi-agent prototypes and deployable products: a few agents collaborating in a demo is easy, but running them reliably locally with managed state and tools needs a runtime and framework. Local-first also means code and data need not be uploaded. Worth borrowing is treating multi-agent apps as a full engineering problem rather than prompt orchestration; the limitation is that the project dates from 2026-10-04 with limited ecosystem and documentation maturity.
04
TencentARC/Looking-Ahead
TencentARC/Looking-Ahead
⭐ 56 · Python · 视频世界模型⭐ 56 · Python · video world model
Looking-Ahead 研究自回归视频生成中的「未来演化建模」,关注物理合理性与世界模型能力[25]。它要解决的是长视频生成中的误差累积:自回归逐帧生成会放大细微错误,导致物体漂移与物理不合理。做法上让模型显式预测未来演化,而非仅拟合下一帧。值得借鉴的是把「预测未来」作为训练目标,而不只是下一帧重建;限制是项目 2026-10-21 才创建,效果与算力开销需论文级验证。
Looking-Ahead studies modelling future evolution in autoregressive video generation, focusing on physical plausibility and world-model capability[25]. It addresses error accumulation in long video generation: frame-by-frame autoregression amplifies small errors, causing object drift and implausible physics. The approach has the model predict future evolution explicitly rather than only fitting the next frame. Worth borrowing is using future prediction as a training objective rather than next-frame reconstruction alone; the limitation is that the project dates from 2026-10-21, and effectiveness and compute cost need paper-level validation.
05
Senguk520/dsh-multitask
Senguk520/dsh-multitask
⭐ 37 · JavaScript · DSH 插件⭐ 37 · JavaScript · DSH plugin
dsh-multitask 是 DeepSeek Harness 的「冲击吸收器」插件与 Agent 预设:主对话只负责规划、给子 Agent 下任务与汇总结果,而文件读取、命令执行、搜索与构建都在子 Agent 上下文中运行,含四种 worker、审批门,且无需修改 DSH 源码[26]。它要解决的是长会话上下文被工具输出淹没:把重活放到子上下文,主线程保持简洁。值得借鉴的是用「主控 + 一次性子 Agent」隔离上下文;限制是子 Agent 结果汇总可能丢失细节,插件依赖 DSH 的扩展点。
dsh-multitask is a 'shock absorber' plugin and agent preset for DeepSeek Harness: the main chat only plans, briefs subagents and summarises results, while file reads, commands, search and builds run in subagent contexts, with four worker types, an approval gate and no DSH source changes[26]. It addresses long sessions drowning in tool output: heavy work moves to sub-contexts while the main thread stays lean. Worth borrowing is isolating context with a controller plus disposable subagents; the limitation is that summarisation may lose detail, and the plugin depends on DSH extension points.
06
Animan-AI/DuckBuddy
Animan-AI/DuckBuddy
⭐ 37 · Rust · 开源硬件⭐ 37 · Rust · open hardware
DuckBuddy 是一只开源的具身智能机器人小鸭:能走、能听、能看,运动/语音/视觉与「生命层」全部跑在机器人本体上,硬件为 Feetech 舵机 + Orange Pi Zero 3W,基于 Pollen Robotics 的 Microduck[27]。它要解决的是具身 AI 缺少低成本可复现平台:多数四足/人形平台昂贵,而小鸭提供了完整的软硬件栈。值得借鉴的是把感知—决策—运动全部放在本体,验证端侧可行性;限制是项目较新、负载与续航有限,复杂地形能力需实测。
DuckBuddy is an open-source embodied robot duck: it walks, hears and sees, with motion, speech, vision and a 'life layer' all running on the robot itself, on Feetech servos plus an Orange Pi Zero 3W and based on Pollen Robotics' Microduck[27]. It addresses the lack of a low-cost, reproducible embodied platform: most quadruped and humanoid platforms are expensive, whereas the duck ships a full hardware and software stack. Worth borrowing is running perception, decision and motion entirely on-device to test edge feasibility; the limitation is that the project is new, payload and battery are limited, and complex terrain needs testing.
07
rugbedbugg/Person
rugbedbugg/Person
⭐ 13 · Python · 长期一致性⭐ 13 · Python · long-term consistency
Person 是一个「持续存在的 Minecraft 居民」:它有记忆、功能性情绪、习惯、目标,并在长期运行中学习如何生活,主题覆盖认知架构与具身 AI[28]。它要解决的是Agent 的长期一致性:多数 Agent 每次会话重置,而「同一个角色连续生活数周」需要记忆、动机与习惯的共同作用。值得借鉴的是把长期记忆与情绪作为可观测状态,而不是隐藏在提示词里;限制是项目较新、评测以定性观察为主,难以横向比较。
Person is a persistent Minecraft inhabitant: it remembers, has functional emotions, forms habits, pursues goals and learns how to live over long runs, tagged for cognitive architecture and embodied AI[28]. It addresses long-term consistency for agents: most reset every session, whereas 'the same character living for weeks' needs memory, motivation and habits together. Worth borrowing is making long-term memory and affect observable state rather than something hidden in prompts; the limitation is that the project is new with mostly qualitative evaluation, making comparison difficult.
08
DocyNoah/dawn-parkour
DocyNoah/dawn-parkour
⭐ 11 · Python · IROS 2026⭐ 11 · Python · IROS 2026
DAWN 是 IROS 2026 论文的官方实现:用深度去噪世界模型实现抗噪声的四足跑酷[29]。它要解决的是真实感知噪声下的四足运动:深度相机数据有缺失与噪声,直接喂给策略会导致失稳;用世界模型先去噪再规划,可以提升鲁棒性。值得借鉴的是把感知去噪交给学习到的世界模型,而不是手工滤波;限制是依赖特定仿真与硬件配置,迁移到其它平台需要重新训练。
DAWN is the official implementation of an IROS 2026 paper on noise-robust quadruped parkour via depth-denoising world models[29]. It addresses quadruped locomotion under real sensing noise: depth data is noisy and incomplete, and feeding it directly to a policy destabilises control, whereas a world model denoises before planning. Worth borrowing is delegating perception denoising to a learned world model instead of hand-tuned filters; the limitation is dependence on a specific simulator and hardware, requiring retraining to port.
三、每日论文:arXiv 上的 Agent 研究
Part 3 · Daily Papers: agent research on arXiv
本期 8 篇取自 10-22 窗口(arxiv_window 共 120 篇,其中 67 篇 published 落在北京时间 10-22 00:00–23:00):agentic 世界动作模型、harness 进化、自进化框架、行为地图、文档摄取线索丢失、多模态来源保留记忆、多轮编码评测与并行 Agent 合并理论。
These eight come from the 10-22 window (arxiv_window returned 120 papers, 67 of them published inside 10-22 00:00–23:00 Beijing time): agentic world action models, harness evolution, a self-evolving framework, behaviour maps, cue loss in document ingestion, provenance-preserving multimodal memory, multi-turn coding evaluation and a theory of parallel-agent merging.
01
Agentic World Action Models
Agentic World Action Models
2610.30136 · cs.RO · 2026-10-222610.30136 · cs.RO · 2026-10-22
AW-0 针对世界动作模型与 Agent 式机器人各缺一半的问题:前者能预测未来视觉状态,却缺少可复用的组合式技能;后者用代码做规划与推理,却缺少物理动力学的预测依据。作者提出 AW-0,把代码、未来视频与机器人动作作为三条耦合的生成流联合建模在统一的 mixture-of-transformers 架构中:代码专家生成参数化技能例程与控制逻辑,视频与动作专家分别生成未来视觉状态与低层动作指令;代码同时承担结构化的多步预测与控制。它要解决的是「规划」与「物理预测」的整合。限制是三条流的联合训练成本高,代码生成错误会传播到动作层,真机泛化仍需验证。
AW-0 targets world action models and agentic robotics each missing half: the former predicts future visual states but lacks reusable compositional skills, the latter plans and reasons in code but lacks predictive grounding in physical dynamics. The authors propose AW-0, jointly modelling code, future video and robot actions as three coupled generative streams in a unified mixture-of-transformers architecture: a code expert generates parameterised skill routines and control logic while video and action experts generate future visual states and low-level motor commands, with code structuring multi-step prediction and control. It addresses integrating planning with physical prediction. The limitation is the cost of joint training across three streams, code errors propagating into the action layer, and real-robot generalisation still unverified.
02
HGM-Dual: Lineage-Aware Guided Agent Harness Optimization for Long-Horizon Planning
HGM-Dual: Lineage-Aware Guided Agent Harness Optimization for Long-Horizon Planning
2610.30042 · cs.AI, cs.LG, cs.NE · 2026-10-222610.30042 · cs.AI, cs.LG, cs.NE · 2026-10-22
HGM-Dual 针对递归自改进 harness 在规划任务上效率低下的问题:Darwin–Gödel Machine 与 HGM 这类方法在编码任务上有效,因为「改进 Agent 所需的能力」与「被改进的能力」重合;而规划任务要求产出一串满足相互约束的工具调用,这种对齐被打破,开放式自修改会反复探索无效变更、消耗大量评测预算。HGM-Dual 因此提出诊断引导的、带谱系感知的 harness 进化:把 Agent 演化表示为带血统的结构,用诊断信息引导变更方向。它要解决的是自进化系统的预算效率。限制是诊断信号依赖任务设计,跨任务族的迁移性仍需验证。
HGM-Dual targets inefficient recursive harness self-improvement on planning tasks: methods such as the Darwin-Gödel Machine and HGM work well for coding because the competence needed to improve the agent coincides with the competence being improved, but planning requires emitting a sequence of tool calls satisfying interacting constraints, breaking that alignment, so open-ended self-modification keeps exploring ineffective changes and burns evaluation budget. HGM-Dual proposes diagnostic-guided, lineage-aware harness evolution, representing agent evolution with lineage and using diagnostics to steer changes. It addresses budget efficiency in self-evolving systems. The limitation is that diagnostic signals depend on task design, and transfer across task families remains to be verified.
03
GuideEvolve: Self-Evolving Agent Framework with Expert Guidance and 3Ts Mechanisms
GuideEvolve: Self-Evolving Agent Framework with Expert Guidance and 3Ts Mechanisms
2610.30017 · cs.AI · 2026-10-222610.30017 · cs.AI · 2026-10-22
论文针对的是自进化 Agent 缺少稳定控制机制:现有方法容易在探索中漂移或无限循环。GuideEvolve 结合专家引导与三种自主调节机制(合称 3Ts):快慢思考(Think Fast and Slow)、回滚(Throwback)、主动终止(Termination by choice);同时引入任务特定的专家评估驱动进化流程。它要解决的是自我改进过程中的认知优化、性能恢复与适时停止。在 MGSM 与 MMLU 上,GuideEvolve 达到与当前 SOTA 相当的水平(MGSM 89.8% vs Gödel Agent 90.6%;MMLU 89.1% vs 87.9%),但方差显著更小。限制是专家评估依赖领域知识,3Ts 的阈值需要按任务调整。
The paper targets self-evolving agents lacking stable control: existing methods drift during exploration or loop indefinitely. GuideEvolve combines expert guidance with three autonomous regulatory mechanisms (the 3Ts): Think Fast and Slow, Throwback, and Termination by choice, plus a task-specific expert-evaluation-driven evolution pipeline. It addresses cognitive optimisation, performance recovery and timely stopping during self-improvement. On MGSM and MMLU, GuideEvolve matches current state of the art (89.8% versus Gödel Agent's 90.6% on MGSM; 89.1% versus 87.9% on MMLU) with notably lower variance. The limitation is that expert evaluation needs domain knowledge and the 3Ts thresholds must be tuned per task.
04
Agent Behavior Maps: Locating Agents by What They Would Do, Without Running Them
Agent Behavior Maps: Locating Agents by What They Would Do, Without Running Them
2610.30014 · cs.LG, cs.AI, cs.CL · 2026-10-222610.30014 · cs.LG, cs.AI, cs.CL · 2026-10-22
论文针对的是成功率相同但行为不同的 Agent 难以区分:两个 Agent 可能成功率相近,却遵循完全不同的动作序列,而这在部署与审计时非常关键。作者提出 Agent Behavior Map:用共享参考轨迹上的中心化动作对数似然来表征「LLM—harness 组合」,无需对目标 Agent 做新的环境 rollout。他们推导了坐标距离与轨迹 KL 的误差界,并在 8 个交叉评分模型中验证距离与实测 KL 的秩相关;在 100 个 LLM、4 个环境中,基于 ALFWorld 的坐标可预测性能并识别行为相似性,且在控制成功率与模型规模后依然存在。它要解决的是「不运行也能定位行为」。限制是表征依赖参考轨迹的选取,跨环境迁移需要重建参考集。
The paper targets agents with similar success rates but different behaviour: two agents may score alike while following entirely different action sequences, which matters for deployment and auditing. The authors propose Agent Behavior Maps, representing LLM-harness combinations by centred action log-likelihoods on shared reference trajectories, without new environment rollouts for the target agent. They derive error bounds linking coordinate distance to trajectory KL and validate rank correlation across eight cross-scored models; across 100 LLMs and four environments, ALFWorld-based coordinates predict performance and identify behavioural similarity, persisting after controlling for success rate and model size. It addresses locating behaviour without running it. The limitation is dependence on the chosen reference trajectories, and cross-environment transfer requires rebuilding the reference set.
05
What the Author Wrote, What the Agent Reads: Silent Cue Loss in Enterprise Document Ingestion
What the Author Wrote, What the Agent Reads: Silent Cue Loss in Enterprise Document Ingestion
2610.30026 · cs.CL, cs.AI, cs.IR · 2026-10-222610.30026 · cs.CL, cs.AI, cs.IR · 2026-10-22
论文针对的是企业文档摄取层的无声信息丢失:Agent 执行政策、回答合规问题之前,必须先由摄取层把 Word/PDF 转成 token,而这一层会丢掉作者通过排版编码的含义(加粗、标题层级、修订标记等)。作者用 76 份真实政策文档构建任务,用文件自身的 OOXML 属性做确定性匹配(不用 LLM 评判):忽略格式的摄取会让 micro F1 从 0.690 跌到 0.150(docling)与 0.075(纯文本),该差距在来自两家厂商的六个回答模型上复现。它要解决的是「Agent 自信地答错」而非明显缺失。限制是任务集中在政策文档,其他文档类型的格式线索权重可能不同。
The paper targets silent information loss in enterprise document ingestion: before an agent can follow a policy or answer a compliance question, an ingestion layer must turn Word or PDF into tokens, and that layer drops meaning the author encoded through formatting (bold, heading levels, revision marks). The authors build a task from 76 real policy documents and score with a deterministic matcher against the file's own OOXML properties, no LLM judge: formatting-blind ingestion collapses micro F1 from 0.690 to 0.150 (docling) and 0.075 (plain text), replicating across six answering models from two vendors. It addresses agents being confidently wrong rather than visibly incomplete. The limitation is that the task centres on policy documents, where formatting cues may weigh differently than in other document types.
06
Remembering Through Change: Provenance-Preserving Hypergraph Memory for Multimodal Agents
Remembering Through Change: Provenance-Preserving Hypergraph Memory for Multimodal Agents
2610.29995 · cs.CL · 2026-10-222610.29995 · cs.CL · 2026-10-22
论文针对的是多模态 Agent 的长期记忆难题:既要保留细粒度视觉证据,又要追踪实体在多次会话中的演化。现有做法两难——抽象式记忆把图像压成文字,丢掉有区分度的视觉细节;像素式记忆保留原始观察,却难以把不同观察关联到同一实体并追踪其状态变化。作者提出 MHG-Mem:用多模态超图同时组织实体身份、状态演化与指向视觉证据的来源(provenance),把不同实体提及与观察事实作为节点,用共现超边把身份一致的提及与事实归组,再综合出方面特定的演化状态。它要解决的是记忆的「身份一致性 + 可追溯」。限制是超图维护成本随会话增长,跨模态检索延迟仍需评估。
The paper targets long-term memory for multimodal agents: preserving fine-grained visual evidence while tracking how entities evolve across sessions. Existing approaches face a dilemma — abstraction-based memory compresses images into text and loses discriminative visual detail, while pixel-preserving memory keeps raw observations but struggles to associate them with persistent entity identities and track state changes. The authors propose MHG-Mem, a multimodal hypergraph organising entity identity, state evolution and provenance to visual evidence: entity mentions and observed facts become nodes, occurrence hyperedges group identity-consistent mentions and facts, and aspect-specific evolving states are synthesised. It addresses identity consistency plus traceability in memory. The limitation is that hypergraph maintenance grows with sessions, and cross-modal retrieval latency needs evaluation.
07
SWE-DIVE: Multi-Turn Coding Agent Evaluation with Dynamic User Simulation
SWE-DIVE: Multi-Turn Coding Agent Evaluation with Dynamic User Simulation
2610.30047 · cs.SE, cs.AI · 2026-10-222610.30047 · cs.SE, cs.AI · 2026-10-22
论文针对的是编码 Agent 评测与真实使用脱节:SWE-bench 这类基准用格式良好的 GitHub issue 做一次性输入,而真实场景里用户需求往往表述不清,且会话是多轮的——用户会不断追加新任务与要求。作者提出 SWE-DIVE:一个动态、交互式的多轮评测框架,内置用户模拟器,可模拟不同行为模式与编码 Agent 沟通。它要解决的是「一次成型」评测无法反映多轮澄清与需求变更下的能力。限制是用户模拟器本身的行为分布会塑造评测结果,模拟质量与真实用户仍有差距。
The paper targets the gap between coding-agent evaluation and real usage: benchmarks like SWE-bench feed a well-formed GitHub issue as a one-shot input, whereas real requests are often vague and sessions are multi-turn, with users adding tasks and requirements iteratively. The authors propose SWE-DIVE, a dynamic interactive multi-turn evaluation framework with a built-in user simulator that can mimic different behavioural patterns when talking to a coding agent. It addresses the inability of one-shot benchmarks to reflect capability under clarification and changing requirements. The limitation is that the simulator's behaviour distribution shapes results, and simulated users still differ from real ones.
08
Parallel AI Agent Collaboration as Graph-Structured Distributed Block Optimization
Parallel AI Agent Collaboration as Graph-Structured Distributed Block Optimization
2610.30074 · cs.MA, cs.AI, math.OC · 2026-10-222610.30074 · cs.MA, cs.AI, math.OC · 2026-10-22
论文针对的是并行 Agent 各自的局部修改合并后反而破坏整体解的问题:每个 Agent 都能做出有用的局部编辑,但合到一起就互相冲突。作者把这一协调问题建模为离散块优化:目标可精确评估、依赖关系图已知;独立集(independent set)可证明互相兼容的编辑,其对同一当前解的验证增益可精确相加;协调器据此构造安全的兼容候选,也能评估相互作用的编辑以捕捉正向协同。论文证明最优分数着色(fractional coloring)得到的合并能保留总验证局部改进的至少 1/χ_f(G)(χ_f(G) 为图的分数色数),且该保证在同类合并中紧致。它要解决的是多 Agent 合并的理论保证。限制是依赖已知依赖图与可精确评估的目标,现实任务中两者都难满足。
The paper targets parallel agents whose locally useful edits degrade the shared solution when merged. It models coordination as discrete block optimisation with an exactly evaluable objective and a known dependency graph: independent sets certify compatible edits whose verified gains against the same current solution add exactly, a coordinator builds a safe compatible candidate and can also evaluate interacting edits to capture favourable synergies. The authors prove the merge from an optimal fractional colouring preserves at least a 1/χ_f(G) fraction of total verified local improvement (χ_f(G) the fractional chromatic number), and that the guarantee is tight among such mergers. It addresses theoretical guarantees for multi-agent merging. The limitation is reliance on a known dependency graph and an exactly evaluable objective, both hard in real tasks.
📅 覆盖口径
📅 Coverage
覆盖口径:北京时间 2026-10-22 00:00–23:00。
Coverage window: 2026-10-22 00:00–23:00 (UTC+8).
本文由自动化「AI资讯速递」工作流抓取公开信息后整理,评价与分析部分为个人观点,不构成投资或技术选型建议。
Compiled by an automated daily-trends workflow from public sources; the analysis reflects the author's personal views only.