PROJECT POLLEN

Pollen-Lite Navigator v1.0 [UK-ENG]

Data-Driven Pathfinding

Project Pollen - An experiment in using data to ease the sneeze during the hayfever season in London.

Shortest path

Calculates the absolute shortest topological distance. Timings are based on a 15mph metropolitan cycling cadence.

Pollen-Lite Path

Uses a Dijkstra engine to apply negative weights to high-density pollen clusters, penalising exposure to provide a cleaner alternative.

How to get started:

  • 1. Pick Points: Click the map to set your Start and End points.
  • 2. Audit: Click Analyse Route to trigger the dual-pass engine.
  • 3. Evidence: Explore the Journey Manifest to see point-by-point pollen exposure and topological grades.
Map Legend
TfL Cycle Infrastructure
High-Risk Tree Density

Shortest Baseline
Pollen-Lite Path
Data:Met Office | GLA Tree Map
Simulate High Pollen
Select graph nodes to set routing points
START: [51.503, -0.058]
END: near: Westminster
Met Office DataPoint | Issue: N/A
GLA Tree Map 2024 | TfL CID Full Network

No active route audit. Select nodes to begin forensic pathfinding.