Wideband autonomous SDR analysis engine forked from sdr-visual-suite
您最多选择25个主题 主题必须以字母或数字开头,可以包含连字符 (-),并且长度不得超过35个字符

387 行
13KB

  1. package pipeline
  2. import (
  3. "sort"
  4. "strings"
  5. )
  6. type ScheduledCandidate struct {
  7. Candidate Candidate `json:"candidate"`
  8. Priority float64 `json:"priority"`
  9. Tier string `json:"tier,omitempty"`
  10. TierFloor string `json:"tier_floor,omitempty"`
  11. Family string `json:"family,omitempty"`
  12. FamilyRank int `json:"family_rank,omitempty"`
  13. Score *RefinementScore `json:"score,omitempty"`
  14. Breakdown *RefinementScoreDetails `json:"breakdown,omitempty"`
  15. }
  16. type RefinementScoreModel struct {
  17. SNRWeight float64 `json:"snr_weight"`
  18. BandwidthWeight float64 `json:"bandwidth_weight"`
  19. PeakWeight float64 `json:"peak_weight"`
  20. EvidenceWeight float64 `json:"evidence_weight"`
  21. }
  22. type RefinementScoreDetails struct {
  23. SNRScore float64 `json:"snr_score"`
  24. BandwidthScore float64 `json:"bandwidth_score"`
  25. PeakScore float64 `json:"peak_score"`
  26. PolicyBoost float64 `json:"policy_boost"`
  27. EvidenceScore float64 `json:"evidence_score"`
  28. EvidenceDetail *EvidenceScoreDetails `json:"evidence_detail,omitempty"`
  29. }
  30. type RefinementScore struct {
  31. Total float64 `json:"total"`
  32. Breakdown RefinementScoreDetails `json:"breakdown"`
  33. Weights *RefinementScoreModel `json:"weights,omitempty"`
  34. }
  35. type RefinementWorkItem struct {
  36. Candidate Candidate `json:"candidate"`
  37. Window RefinementWindow `json:"window,omitempty"`
  38. Execution *RefinementExecution `json:"execution,omitempty"`
  39. Priority float64 `json:"priority,omitempty"`
  40. Score *RefinementScore `json:"score,omitempty"`
  41. Breakdown *RefinementScoreDetails `json:"breakdown,omitempty"`
  42. Status string `json:"status,omitempty"`
  43. Reason string `json:"reason,omitempty"`
  44. Admission *PriorityAdmission `json:"admission,omitempty"`
  45. }
  46. type RefinementExecution struct {
  47. Stage string `json:"stage,omitempty"`
  48. SampleRate int `json:"sample_rate,omitempty"`
  49. FFTSize int `json:"fft_size,omitempty"`
  50. CenterHz float64 `json:"center_hz,omitempty"`
  51. SpanHz float64 `json:"span_hz,omitempty"`
  52. Source string `json:"source,omitempty"`
  53. }
  54. const (
  55. RefinementStatusPlanned = "planned"
  56. RefinementStatusAdmitted = "admitted"
  57. RefinementStatusRunning = "running"
  58. RefinementStatusCompleted = "completed"
  59. RefinementStatusDropped = "dropped"
  60. RefinementStatusSkipped = "skipped"
  61. RefinementStatusDisplaced = "displaced"
  62. )
  63. const (
  64. RefinementReasonPlanned = "refinement:planned"
  65. RefinementReasonAdmitted = "refinement:admitted"
  66. RefinementReasonRunning = "refinement:running"
  67. RefinementReasonCompleted = "refinement:completed"
  68. RefinementReasonMonitorGate = "refinement:drop:monitor"
  69. RefinementReasonBelowSNR = "refinement:drop:snr"
  70. RefinementReasonBudget = "refinement:skip:budget"
  71. RefinementReasonDisabled = "refinement:drop:disabled"
  72. RefinementReasonUnclassified = "refinement:drop:unclassified"
  73. RefinementReasonDisplaced = "refinement:skip:displaced"
  74. )
  75. // BuildRefinementPlan scores and ranks candidates for costly local refinement.
  76. // Admission/budget enforcement is handled by arbitration to keep refinement/record/decode consistent.
  77. // Current heuristic is intentionally simple and deterministic; later phases can add
  78. // richer scoring (novelty, persistence, profile-aware band priorities, decoder value).
  79. func BuildRefinementPlan(candidates []Candidate, policy Policy) RefinementPlan {
  80. return BuildRefinementPlanWithBudget(candidates, policy, BudgetModelFromPolicy(policy))
  81. }
  82. func BuildRefinementPlanWithBudget(candidates []Candidate, policy Policy, budgetModel BudgetModel) RefinementPlan {
  83. strategy, strategyReason := refinementStrategy(policy)
  84. budget := budgetQueueLimit(budgetModel.Refinement)
  85. holdPolicy := HoldPolicyFromPolicy(policy)
  86. plan := RefinementPlan{
  87. TotalCandidates: len(candidates),
  88. MinCandidateSNRDb: policy.MinCandidateSNRDb,
  89. Budget: budget,
  90. BudgetSource: budgetModel.Refinement.Source,
  91. Strategy: strategy,
  92. StrategyReason: strategyReason,
  93. }
  94. if start, end, ok := monitorBounds(policy); ok {
  95. plan.MonitorStartHz = start
  96. plan.MonitorEndHz = end
  97. if end > start {
  98. plan.MonitorSpanHz = end - start
  99. }
  100. }
  101. if len(candidates) == 0 {
  102. return plan
  103. }
  104. snrWeight, bwWeight, peakWeight := refinementIntentWeights(policy.Intent)
  105. scoreModel := RefinementScoreModel{
  106. SNRWeight: snrWeight,
  107. BandwidthWeight: bwWeight,
  108. PeakWeight: peakWeight,
  109. EvidenceWeight: 0.6,
  110. }
  111. scoreModel = applyStrategyWeights(strategy, scoreModel)
  112. plan.ScoreModel = scoreModel
  113. scored := make([]ScheduledCandidate, 0, len(candidates))
  114. workItems := make([]RefinementWorkItem, 0, len(candidates))
  115. for _, c := range candidates {
  116. candidate := c
  117. RefreshCandidateEvidenceState(&candidate)
  118. family, familyRank := signalPriorityMatch(policy, candidate.Hint, "")
  119. familyFloor := signalPriorityTierFloor(familyRank)
  120. familyRankOut := familyRankForOutput(familyRank)
  121. if !candidateInMonitor(policy, candidate) {
  122. plan.DroppedByMonitor++
  123. workItems = append(workItems, RefinementWorkItem{
  124. Candidate: candidate,
  125. Status: RefinementStatusDropped,
  126. Reason: RefinementReasonMonitorGate,
  127. Admission: &PriorityAdmission{
  128. Tier: PriorityTierBackground,
  129. TierFloor: familyFloor,
  130. Family: family,
  131. FamilyRank: familyRankOut,
  132. Class: AdmissionClassDrop,
  133. Basis: "refinement",
  134. Reason: admissionReason(RefinementReasonMonitorGate, policy, holdPolicy),
  135. },
  136. })
  137. continue
  138. }
  139. if candidate.SNRDb < policy.MinCandidateSNRDb {
  140. plan.DroppedBySNR++
  141. workItems = append(workItems, RefinementWorkItem{
  142. Candidate: candidate,
  143. Status: RefinementStatusDropped,
  144. Reason: RefinementReasonBelowSNR,
  145. Admission: &PriorityAdmission{
  146. Tier: PriorityTierBackground,
  147. TierFloor: familyFloor,
  148. Family: family,
  149. FamilyRank: familyRankOut,
  150. Class: AdmissionClassDrop,
  151. Basis: "refinement",
  152. Reason: admissionReason(RefinementReasonBelowSNR, policy, holdPolicy),
  153. },
  154. })
  155. continue
  156. }
  157. snrScore := candidate.SNRDb * scoreModel.SNRWeight
  158. bwScore := 0.0
  159. peakScore := 0.0
  160. policyBoost := CandidatePriorityBoost(policy, candidate.Hint)
  161. if candidate.BandwidthHz > 0 {
  162. bwScore = minFloat64(candidate.BandwidthHz/25000.0, 6) * scoreModel.BandwidthWeight
  163. }
  164. if candidate.PeakDb > 0 {
  165. peakScore = (candidate.PeakDb / 20.0) * scoreModel.PeakWeight
  166. }
  167. rawEvidenceScore, evidenceDetail := candidateEvidenceScore(candidate, strategy)
  168. evidenceDetail.Weight = scoreModel.EvidenceWeight
  169. evidenceDetail.RawScore = rawEvidenceScore
  170. evidenceDetail.WeightedScore = rawEvidenceScore * scoreModel.EvidenceWeight
  171. evidenceScore := evidenceDetail.WeightedScore
  172. priority := snrScore + bwScore + peakScore + policyBoost
  173. priority += evidenceScore
  174. score := &RefinementScore{
  175. Total: priority,
  176. Breakdown: RefinementScoreDetails{
  177. SNRScore: snrScore,
  178. BandwidthScore: bwScore,
  179. PeakScore: peakScore,
  180. PolicyBoost: policyBoost,
  181. EvidenceScore: evidenceScore,
  182. EvidenceDetail: &evidenceDetail,
  183. },
  184. Weights: &scoreModel,
  185. }
  186. scored = append(scored, ScheduledCandidate{
  187. Candidate: candidate,
  188. Priority: priority,
  189. TierFloor: familyFloor,
  190. Family: family,
  191. FamilyRank: familyRankOut,
  192. Score: score,
  193. Breakdown: &score.Breakdown,
  194. })
  195. workItems = append(workItems, RefinementWorkItem{
  196. Candidate: candidate,
  197. Priority: priority,
  198. Score: score,
  199. Breakdown: &score.Breakdown,
  200. Status: RefinementStatusPlanned,
  201. Reason: RefinementReasonPlanned,
  202. Admission: &PriorityAdmission{
  203. Class: AdmissionClassPlanned,
  204. TierFloor: familyFloor,
  205. Family: family,
  206. FamilyRank: familyRankOut,
  207. Score: priority,
  208. Basis: "refinement",
  209. Reason: admissionReason(RefinementReasonPlanned, policy, holdPolicy),
  210. },
  211. })
  212. }
  213. sort.Slice(scored, func(i, j int) bool {
  214. if scored[i].Priority == scored[j].Priority {
  215. return scored[i].Candidate.CenterHz < scored[j].Candidate.CenterHz
  216. }
  217. return scored[i].Priority > scored[j].Priority
  218. })
  219. if len(scored) > 0 {
  220. minPriority := scored[0].Priority
  221. maxPriority := scored[0].Priority
  222. sumPriority := 0.0
  223. for _, s := range scored {
  224. if s.Priority < minPriority {
  225. minPriority = s.Priority
  226. }
  227. if s.Priority > maxPriority {
  228. maxPriority = s.Priority
  229. }
  230. sumPriority += s.Priority
  231. }
  232. plan.PriorityMin = minPriority
  233. plan.PriorityMax = maxPriority
  234. plan.PriorityAvg = sumPriority / float64(len(scored))
  235. for i := range scored {
  236. baseTier := PriorityTierFromRange(scored[i].Priority, minPriority, maxPriority)
  237. scored[i].Tier = applyTierFloor(baseTier, scored[i].TierFloor)
  238. }
  239. for i := range workItems {
  240. if workItems[i].Admission == nil {
  241. continue
  242. }
  243. if workItems[i].Status != RefinementStatusPlanned {
  244. continue
  245. }
  246. baseTier := PriorityTierFromRange(workItems[i].Priority, minPriority, maxPriority)
  247. workItems[i].Admission.Tier = applyTierFloor(baseTier, workItems[i].Admission.TierFloor)
  248. }
  249. }
  250. plan.Ranked = append(plan.Ranked, scored...)
  251. plan.WorkItems = workItems
  252. return plan
  253. }
  254. func ScheduleCandidates(candidates []Candidate, policy Policy) []ScheduledCandidate {
  255. plan := BuildRefinementPlan(candidates, policy)
  256. if len(plan.Ranked) > 0 {
  257. return plan.Ranked
  258. }
  259. return plan.Selected
  260. }
  261. func refinementStrategy(policy Policy) (string, string) {
  262. intent := strings.ToLower(strings.TrimSpace(policy.Intent))
  263. profile := strings.ToLower(strings.TrimSpace(policy.Profile))
  264. switch {
  265. case strings.Contains(profile, "digital"):
  266. return "digital-hunting", "profile"
  267. case strings.Contains(profile, "archive"):
  268. return "archive-oriented", "profile"
  269. case strings.Contains(profile, "aggressive"):
  270. return "multi-resolution", "profile"
  271. case strings.Contains(intent, "digital") || strings.Contains(intent, "hunt") || strings.Contains(intent, "decode"):
  272. return "digital-hunting", "intent"
  273. case strings.Contains(intent, "archive") || strings.Contains(intent, "triage") || strings.Contains(policy.Mode, "archive"):
  274. return "archive-oriented", "intent"
  275. case strings.Contains(strings.ToLower(policy.SurveillanceStrategy), "multi"):
  276. return "multi-resolution", "surveillance-strategy"
  277. default:
  278. return "single-resolution", "default"
  279. }
  280. }
  281. func applyStrategyWeights(strategy string, model RefinementScoreModel) RefinementScoreModel {
  282. switch strings.ToLower(strings.TrimSpace(strategy)) {
  283. case "digital-hunting":
  284. model.SNRWeight *= 1.4
  285. model.BandwidthWeight *= 0.75
  286. model.PeakWeight *= 1.2
  287. case "archive-oriented":
  288. model.SNRWeight *= 1.1
  289. model.BandwidthWeight *= 1.6
  290. model.PeakWeight *= 1.05
  291. case "multi-resolution", "multi", "multi-res", "multi_res":
  292. model.SNRWeight *= 1.15
  293. model.BandwidthWeight *= 1.1
  294. model.PeakWeight *= 1.15
  295. case "single-resolution":
  296. model.SNRWeight *= 1.1
  297. model.BandwidthWeight *= 1.0
  298. model.PeakWeight *= 1.0
  299. }
  300. return model
  301. }
  302. func candidateEvidenceScore(candidate Candidate, strategy string) (float64, EvidenceScoreDetails) {
  303. state := CandidateEvidenceStateFor(candidate)
  304. details := EvidenceScoreDetails{
  305. DetectionLevels: state.DetectionLevelCount,
  306. PrimaryLevels: state.PrimaryLevelCount,
  307. DerivedLevels: state.DerivedLevelCount,
  308. SupportLevels: state.SupportLevelCount,
  309. ProvenanceCount: len(state.Provenance),
  310. DerivedOnly: state.DerivedOnly,
  311. MultiLevelConfirmed: state.MultiLevelConfirmed,
  312. }
  313. score := 0.0
  314. if state.MultiLevelConfirmed && state.DetectionLevelCount > 1 {
  315. bonus := 0.85 * float64(state.DetectionLevelCount-1)
  316. score += bonus
  317. details.MultiLevelBonus = bonus
  318. }
  319. if len(state.Provenance) > 1 {
  320. bonus := 0.15 * float64(len(state.Provenance)-1)
  321. score += bonus
  322. details.ProvenanceBonus = bonus
  323. }
  324. if state.DerivedOnly {
  325. penalty := 0.35
  326. score -= penalty
  327. details.DerivedPenalty = -penalty
  328. }
  329. switch strings.ToLower(strings.TrimSpace(strategy)) {
  330. case "multi-resolution", "multi", "multi-res", "multi_res":
  331. if state.DerivedOnly {
  332. bias := 0.2
  333. score += bias
  334. details.StrategyBias = bias
  335. } else if state.MultiLevelConfirmed {
  336. bias := 0.1
  337. score += bias
  338. details.StrategyBias = bias
  339. }
  340. case "digital-hunting":
  341. if state.DerivedOnly {
  342. bias := -0.15
  343. score += bias
  344. details.StrategyBias = bias
  345. } else if state.MultiLevelConfirmed {
  346. bias := 0.05
  347. score += bias
  348. details.StrategyBias = bias
  349. }
  350. case "archive-oriented":
  351. if state.DerivedOnly {
  352. bias := -0.1
  353. score += bias
  354. details.StrategyBias = bias
  355. }
  356. case "single-resolution":
  357. if state.MultiLevelConfirmed {
  358. bias := 0.05
  359. score += bias
  360. details.StrategyBias = bias
  361. }
  362. }
  363. return score, details
  364. }
  365. func minFloat64(a, b float64) float64 {
  366. if a < b {
  367. return a
  368. }
  369. return b
  370. }