feat(agent): ✨ 重构智能排程分流与双通道交付,补齐周级预算并接入连续微调复用 - 🔀 通用路由升级为 action 分流(chat/quick_note_create/task_query/schedule_plan),路由失败直接返回内部错误,不再回落聊天 - 🧭 智能排程链路重构:统一图编排与节点职责,完善日级/周级调优协作与提示词约束 - 📊 周级预算改为“有效周保底 + 负载加权分配”,避免有效周零预算并提升资源利用率 - ⚙️ 日级并发优化细化:按天拆分 DayGroup 并发执行,低收益天(suggested<=2)跳过,单天失败仅回退该天结果并继续全局 - 🧵 周级并发优化细化:按周并发 worker 执行,单周“单步动作”循环(每轮仅 1 个 Move/Swap 或 done),失败周保留原方案不影响其它周 - 🛰️ 新增排程预览双通道:聊天主链路输出终审文本,结构化 candidate_plans 通过 /api/v1/agent/schedule-preview 拉取 - 🗃️ 增补 Redis 预览缓存读写与清理逻辑,新增对应 API、路由、模型与错误码支持 - ♻️ 接入连续对话微调复用:命中同会话历史预览时复用上轮 HybridEntries,避免每轮重跑粗排 - 🛡️ 增加复用保护:仅当本轮与上轮 task_class_ids 集合一致才复用;不一致回退全量粗排 - 🧰 扩展预览缓存字段(task_class_ids/hybrid_entries/allocated_items),支撑微调承接链路 - 🗺️ 更新 README 5.4 Mermaid(总分流图 + 智能排程流转图)并补充决策文档 - ⚠️ 新增“连续微调复用”链路我尚未完成测试,且文档状态目前较为混乱,待连续对话微调功能真正测试完成后再统一更新
202 lines
6.6 KiB
Go
202 lines
6.6 KiB
Go
package scheduleplan
|
||
|
||
import (
|
||
"context"
|
||
"errors"
|
||
|
||
"github.com/cloudwego/eino-ext/components/model/ark"
|
||
"github.com/cloudwego/eino/compose"
|
||
"github.com/cloudwego/eino/schema"
|
||
)
|
||
|
||
const (
|
||
// 图节点:意图识别与约束提取
|
||
schedulePlanGraphNodePlan = "schedule_plan_plan"
|
||
// 图节点:粗排构建(替代旧 preview + hybridBuild)
|
||
schedulePlanGraphNodeRoughBuild = "schedule_plan_rough_build"
|
||
// 图节点:提前退出
|
||
schedulePlanGraphNodeExit = "schedule_plan_exit"
|
||
// 图节点:按天拆分并注入上下文标签
|
||
schedulePlanGraphNodeDailySplit = "schedule_plan_daily_split"
|
||
// 图节点:并发日内优化
|
||
schedulePlanGraphNodeDailyRefine = "schedule_plan_daily_refine"
|
||
// 图节点:合并日内优化结果
|
||
schedulePlanGraphNodeMerge = "schedule_plan_merge"
|
||
// 图节点:周级配平优化(单步动作模式,输出阶段状态)
|
||
schedulePlanGraphNodeWeeklyRefine = "schedule_plan_weekly_refine"
|
||
// 图节点:终审校验
|
||
schedulePlanGraphNodeFinalCheck = "schedule_plan_final_check"
|
||
// 图节点:返回预览结果(不落库)
|
||
schedulePlanGraphNodeReturnPreview = "schedule_plan_return_preview"
|
||
)
|
||
|
||
// SchedulePlanGraphRunInput 是执行“智能排程 graph”所需输入。
|
||
//
|
||
// 字段说明:
|
||
// 1. Extra:前端附加参数(重点是 task_class_ids);
|
||
// 2. ChatHistory:支持连续对话微调;
|
||
// 3. OutChan/ModelName:保留兼容字段(当前 weekly refine 主要输出阶段状态);
|
||
// 4. DailyRefineConcurrency/WeeklyAdjustBudget:可选运行参数覆盖。
|
||
type SchedulePlanGraphRunInput struct {
|
||
Model *ark.ChatModel
|
||
State *SchedulePlanState
|
||
Deps SchedulePlanToolDeps
|
||
UserMessage string
|
||
Extra map[string]any
|
||
ChatHistory []*schema.Message
|
||
EmitStage func(stage, detail string)
|
||
|
||
OutChan chan<- string
|
||
ModelName string
|
||
|
||
DailyRefineConcurrency int
|
||
WeeklyAdjustBudget int
|
||
}
|
||
|
||
// RunSchedulePlanGraph 执行“智能排程”图编排。
|
||
//
|
||
// 当前链路:
|
||
// START
|
||
// -> plan
|
||
// -> roughBuild
|
||
// -> (len(task_class_ids)>=2 ? dailySplit -> dailyRefine -> merge : weeklyRefine)
|
||
// -> finalCheck
|
||
// -> returnPreview
|
||
// -> END
|
||
//
|
||
// 说明:
|
||
// 1. exit 分支可从 plan/roughBuild 直接提前终止;
|
||
// 2. 本文件只负责“连线与分支”,节点内业务都在 nodes/daily/weekly 文件中。
|
||
func RunSchedulePlanGraph(ctx context.Context, input SchedulePlanGraphRunInput) (*SchedulePlanState, error) {
|
||
// 1. 启动前硬校验。
|
||
if input.Model == nil {
|
||
return nil, errors.New("schedule plan graph: model is nil")
|
||
}
|
||
if input.State == nil {
|
||
return nil, errors.New("schedule plan graph: state is nil")
|
||
}
|
||
if err := input.Deps.validate(); err != nil {
|
||
return nil, err
|
||
}
|
||
|
||
// 2. 注入运行时配置(可选覆盖)。
|
||
if input.DailyRefineConcurrency > 0 {
|
||
input.State.DailyRefineConcurrency = input.DailyRefineConcurrency
|
||
}
|
||
if input.WeeklyAdjustBudget > 0 {
|
||
input.State.WeeklyAdjustBudget = input.WeeklyAdjustBudget
|
||
}
|
||
|
||
emitStage := func(stage, detail string) {
|
||
if input.EmitStage != nil {
|
||
input.EmitStage(stage, detail)
|
||
}
|
||
}
|
||
|
||
runner := newSchedulePlanRunner(
|
||
input.Model,
|
||
input.Deps,
|
||
emitStage,
|
||
input.UserMessage,
|
||
input.Extra,
|
||
input.ChatHistory,
|
||
input.OutChan,
|
||
input.ModelName,
|
||
input.State.DailyRefineConcurrency,
|
||
)
|
||
|
||
graph := compose.NewGraph[*SchedulePlanState, *SchedulePlanState]()
|
||
|
||
// 3. 注册节点。
|
||
if err := graph.AddLambdaNode(schedulePlanGraphNodePlan, compose.InvokableLambda(runner.planNode)); err != nil {
|
||
return nil, err
|
||
}
|
||
if err := graph.AddLambdaNode(schedulePlanGraphNodeRoughBuild, compose.InvokableLambda(runner.roughBuildNode)); err != nil {
|
||
return nil, err
|
||
}
|
||
if err := graph.AddLambdaNode(schedulePlanGraphNodeExit, compose.InvokableLambda(runner.exitNode)); err != nil {
|
||
return nil, err
|
||
}
|
||
if err := graph.AddLambdaNode(schedulePlanGraphNodeDailySplit, compose.InvokableLambda(runner.dailySplitNode)); err != nil {
|
||
return nil, err
|
||
}
|
||
if err := graph.AddLambdaNode(schedulePlanGraphNodeDailyRefine, compose.InvokableLambda(runner.dailyRefineNode)); err != nil {
|
||
return nil, err
|
||
}
|
||
if err := graph.AddLambdaNode(schedulePlanGraphNodeMerge, compose.InvokableLambda(runner.mergeNode)); err != nil {
|
||
return nil, err
|
||
}
|
||
if err := graph.AddLambdaNode(schedulePlanGraphNodeWeeklyRefine, compose.InvokableLambda(runner.weeklyRefineNode)); err != nil {
|
||
return nil, err
|
||
}
|
||
if err := graph.AddLambdaNode(schedulePlanGraphNodeFinalCheck, compose.InvokableLambda(runner.finalCheckNode)); err != nil {
|
||
return nil, err
|
||
}
|
||
if err := graph.AddLambdaNode(schedulePlanGraphNodeReturnPreview, compose.InvokableLambda(runner.returnPreviewNode)); err != nil {
|
||
return nil, err
|
||
}
|
||
|
||
// 4. 连线:START -> plan
|
||
if err := graph.AddEdge(compose.START, schedulePlanGraphNodePlan); err != nil {
|
||
return nil, err
|
||
}
|
||
|
||
// 5. plan 分支:roughBuild | exit
|
||
if err := graph.AddBranch(schedulePlanGraphNodePlan, compose.NewGraphBranch(
|
||
runner.nextAfterPlan,
|
||
map[string]bool{
|
||
schedulePlanGraphNodeRoughBuild: true,
|
||
schedulePlanGraphNodeExit: true,
|
||
},
|
||
)); err != nil {
|
||
return nil, err
|
||
}
|
||
|
||
// 6. roughBuild 分支:dailySplit | weeklyRefine | exit
|
||
if err := graph.AddBranch(schedulePlanGraphNodeRoughBuild, compose.NewGraphBranch(
|
||
runner.nextAfterRoughBuild,
|
||
map[string]bool{
|
||
schedulePlanGraphNodeDailySplit: true,
|
||
schedulePlanGraphNodeWeeklyRefine: true,
|
||
schedulePlanGraphNodeExit: true,
|
||
},
|
||
)); err != nil {
|
||
return nil, err
|
||
}
|
||
|
||
// 7. 固定边:dailySplit -> dailyRefine -> merge -> weeklyRefine -> finalCheck -> returnPreview -> END
|
||
if err := graph.AddEdge(schedulePlanGraphNodeDailySplit, schedulePlanGraphNodeDailyRefine); err != nil {
|
||
return nil, err
|
||
}
|
||
if err := graph.AddEdge(schedulePlanGraphNodeDailyRefine, schedulePlanGraphNodeMerge); err != nil {
|
||
return nil, err
|
||
}
|
||
if err := graph.AddEdge(schedulePlanGraphNodeMerge, schedulePlanGraphNodeWeeklyRefine); err != nil {
|
||
return nil, err
|
||
}
|
||
if err := graph.AddEdge(schedulePlanGraphNodeWeeklyRefine, schedulePlanGraphNodeFinalCheck); err != nil {
|
||
return nil, err
|
||
}
|
||
if err := graph.AddEdge(schedulePlanGraphNodeFinalCheck, schedulePlanGraphNodeReturnPreview); err != nil {
|
||
return nil, err
|
||
}
|
||
if err := graph.AddEdge(schedulePlanGraphNodeReturnPreview, compose.END); err != nil {
|
||
return nil, err
|
||
}
|
||
if err := graph.AddEdge(schedulePlanGraphNodeExit, compose.END); err != nil {
|
||
return nil, err
|
||
}
|
||
|
||
// 8. 编译并执行。
|
||
// 路径最多约 8~9 个节点,保守预留 20 步避免误判。
|
||
runnable, err := graph.Compile(ctx,
|
||
compose.WithGraphName("SchedulePlanGraph"),
|
||
compose.WithMaxRunSteps(20),
|
||
compose.WithNodeTriggerMode(compose.AnyPredecessor),
|
||
)
|
||
if err != nil {
|
||
return nil, err
|
||
}
|
||
return runnable.Invoke(ctx, input.State)
|
||
}
|