OGC API — Processes · process
least-cost-path
Least-cost path over the zone lattice — a web view of GET /api/processes/least-cost-path.
A* between two points at one zone-level: neighbours derived analytically (never stored), step cost = centre distance × mean zone cost, admissible straight-line heuristic. Costs and impassable barriers come from zoneSet membership; the search is bounded to a corridor around the endpoints and an expansion cap. Outputs the ordered zone path, its zoneSet, and a lon/lat LineString of zone centres.
Inputs
| Name | Type | Default | Description |
|---|---|---|---|
| start | — | ||
| end | — | ||
| zone-level | — | ||
| datetime | — | ||
| height | — | ||
| costs | — | ||
| barriers | — | ||
| default_cost | — | ||
| margin_m | — | ||
| heuristic_weight | — | ||
| vertical_margin_m | — | ||
| collectionId | — | ||
| dggrs | — |
Outputs
| Name | Type |
|---|---|
| cost | |
| costOptimalityBound | |
| straightLineDistance_m | |
| verticalMargin_m | |
| lengthZones | |
| expanded | |
| path | |
| pathZoneSet | |
| geometry | |
| collection |
API
GET /api/processes/least-cost-path
POST …/execution
Open in Swagger UI
Execution is asynchronous (returns a job to poll) and requires a token — see the documentation. Track runs under OGC API — Jobs.