본문으로 건너뛰기
cccskills

'graph-traversal' 검색 결과

1건 · 관련도순

An innate exploratory drive that guarantees no graph node remains permanently invisible to an agent population. After a warm-up period (step > 3), each agent fires a coverage scan with probability |unseen_nodes| / |all_nodes|. When triggered, the agent teleports directly to the globally unseen node with the highest belief uncertainty, works it, and returns control to the normal action-selection loop. Probability is self-annealing: it starts near 1.0 when almost everything is unseen and decays toward 0.0 as coverage saturates, requiring no manual schedule. The mechanism is "innate" (hard-coded into the agent step loop) as distinct from the "adaptive" EFE path, which requires local neighbors and learned precision weights. Together they form a two-layer exploration architecture: adaptive for locally-guided foraging, innate for topological completeness.

한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.

curiositech/port-daddy32026년 10월 19일 업데이트