Unverified50% confidenceSolutionExact time

最远点法（Farthest Landmark）迭代选择距离已有地标最远的节点，使地标分布尽可能分散

1

Sources

50%

Confidence

Long-term

Relevance

8/10/2026

First Seen

Sources

Differential Heuristics: Optimizing A* Search Efficiency with Landmark Precomputation

Related Claims

Unverified计算难抵极点是一个max-min优化问题：在区域内寻找一点使其到所有道路的最小距离达到最大值68% similar Unverified难抵极点（Pole of Inaccessibility）指某个区域内距离所有边界（如海岸线、道路、水源等）最远的点66% similar

Cite This Claim

Stable URI

https://kongchang.com/claim/722585

API

curl https://kongchang.com/api/v1/knowledge/claims/722585

MCP

get_claim(id=722585)