29 lines
1.2 KiB
Python
29 lines
1.2 KiB
Python
"""问题三基线实现：两条不共享贝叶斯决策的对照策略。
|
||
|
||
- ``OmnidirectionalLoop``（grid）：49 点（700 m 步长）网格保证发现，
|
||
发现后就近进入定位子循环；策略简单、无信息增益选点、无任务排序优化。
|
||
- ``SevenBatch``（seven）：七点解析覆盖 + 同站批量扫频 + 最近候选服务队列，
|
||
是"覆盖证明 + 批量调度"的中间对照（官方演练 12/12 全清）。
|
||
"""
|
||
|
||
from __future__ import annotations
|
||
|
||
from mcm26b.planner import OmnidirectionalLoop
|
||
from mcm26b.planner.seven import SevenBatch
|
||
|
||
from project.common import Method
|
||
|
||
GRID = Method(key="baseline", name="49 点网格 + 就近服务 (grid)",
|
||
kind="baseline", note="历史基线，无信息增益与滚动排序")
|
||
SEVEN = Method(key="seven", name="七点解析覆盖 + 批量扫频 (seven)",
|
||
kind="baseline", note="覆盖证明与批量调度的中间对照")
|
||
|
||
def build_grid(client, config):
|
||
"""工厂：49 点网格基线闭环。"""
|
||
return OmnidirectionalLoop(client, config)
|
||
|
||
|
||
def build_seven(client, config):
|
||
"""工厂：七点批量扫频中间对照。"""
|
||
return SevenBatch(client, config)
|