
Isochrone
io.github.capan由 GitHub 账号 capan 发布v0.1.4更新于 Oct 24, 2026
Berlin pedestrian isochrones: streets reachable on foot in N minutes (walk/stroller/wheelchair).
概览
回答柏林步行可达性问题:在 N 分钟内步行、推婴儿车或坐轮椅能到达哪些街道。
- 可以做什么
- 只提供一个工具 reachable_area,输入起点、时间预算(分钟)和出行方式(walk、stroller、wheelchair),还可选填目标地点以判断能否按时到达。它查询柏林的街道网络等时圈 API,返回一段文字说明和地图链接,而不是原始坐标。可达范围基于街道图计算,因此结果沿实际可走的街道展开,而不是一个填充多边形。
- 适用场景
- 适合让助手回答柏林的日常问题,例如从某个地址步行 15 分钟能走多远,或某个目的地推婴儿车、坐轮椅能否到达。它只覆盖这一座城市,因此仅对柏林地点有添加价值。
- 运行要求
- 以 stdio 方式在本地运行,通常通过 npx 启动 isochrone-mcp 这个 npm 包,因此需要 Node.js 以及访问托管 API 的网络连接。未声明任何账号、API 密钥、环境变量或请求头。
安装
在 SourceWeft 中
- 打开 控制台中的 Isochrone,将其添加到工作区。
- 为需要使用其工具的对话启用该服务。
Desktop only,通过 STDIO。 STDIO 服务会启动本地进程,因此需要 SourceWeft 桌面宿主。
其他 MCP 客户端
参照 仓库 中的启动说明。
README
isochrone
Live: iso.huseyincapan.dev
Click anywhere on the map and see the street network you can actually reach on foot within 15 minutes — coloured by arrival time, with mobility profiles that account for stairs and unpaved paths.
OSM data → PostGIS + pgRouting → Express → Leaflet.
[Same corner, same 15 minutes, drawn two ways: the reachable street network against the hull drawn around it]Why not a polygon?
Every isochrone map I could find answers with a filled polygon. That is wrong unless you are a pigeon: a polygon claims you can reach the middle of a block, cross a rail cutting, walk through a building. On the corner above, the same 15 minutes gives you 107.6 km of reachable streets; the hull drawn around them covers 3.28 km² and claims 30.4 km of street the walk cannot actually reach. This map draws the network.
How it works
pgr_drivingDistance walks the street graph from the vertex nearest your click
until the time budget runs out, and returns every reachable edge with its
arrival time. Those edges are grouped into 10 equal time bands and drawn
directly.
Edge cost is length / speed in seconds, computed per request from the
selected profile, so a profile is a few numbers rather than a schema change:
These factors are estimates, not measurements — see Known gaps.
Where should I live?
Answer a short questionnaire weighting seven everyday layers (dining, green space, playgrounds, groceries, health, kindergartens, schools) and the whole Berlin map re-ranks to show where your weighted 15-minute city actually is, as walk, bike or wheelchair.
The trick is that nothing is routed at question time: 21 full-city reachability surfaces (7 layers × 3 profiles, ~134,000 grid cells each) are precomputed offline, so re-ranking the city is one aggregate query. Stroller is deliberately absent here: its speed factors are uncalibrated estimates and must not be published as if measured.
Ask Claude about it (MCP)
The isochrone-mcp package lets
any MCP client answer reachability questions against this API:
One tool, reachable_area: origin + minutes + profile, optional target
("can I get there in time?"). Returns a prose summary and a map link, not
coordinate soup. Details in mcp/.
Known gaps
- Graph islands. The vertex nearest a click can sit on a disconnected
fragment —
52.515,13.400reaches 13 nodes. Fix is a one-timepgr_connectedComponentstable for the vertex lookup to join against. - Calibration. The speeds above are guesses. Google's Isochrones API
(Preview) supports
WALKand returns GeoJSON, so thewalkprofile could be calibrated against it. It has no stroller/wheelchair mode, so those stay unvalidated. - Stranded origins render as a tiny blob rather than saying "unreachable with this profile".
Running it yourself
Dev setup, deployment, city import and the ops notes live in docs/OPERATIONS.md.
来源:README.md,提交 776e893
工具
0版本历史
1- v0.1.4最新Sep 16, 2026
评分
已满足适用检查项的 50%
该评分衡量此收录条目的完整程度,依据注册中心条目、端点与公开来源计算得出。它不是对服务器本身的评价,也不表示服务器安全或当前可用:可连通性是带日期的检查结果,评分也不包含安装量或用户评价。
- 近 30 天内可连通25 分
请保持端点能够响应 MCP 握手;SourceWeft 每 30 天探测一次。
- 已声明认证方式10 分
请在注册中心条目中声明凭据请求头,或保持端点能够响应探测,以便判定其认证方式。
- 已列出工具15 分
请让服务器在无凭据时响应 tools/list,或发布可在沙箱中无凭据启动的软件包。
- 描述必需15 分
- 图标10 分
- 文档15 分
- 许可证10 分