Metraipolis › archive › dc_3873ce1ffb3f
CLIPPER Beyond Shortlisting: Auditable Decision Support for Changing Municipal Micromobility Policies — arXiv:2609.39054
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.39054
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T15:11:52.711Z
- SHA-256 of the archived text
9561d5cbfe06b26eb79e969359c0bc2832035c585e96a13503c8469a5387acae- Stable URL of this page
https://metraipolis.com/documento/dc_3873ce1ffb3f
How to cite
CLIPPER Beyond Shortlisting: Auditable Decision Support for Changing Municipal Micromobility Policies — arXiv:2609.39054 — arXiv (en), https://arxiv.org/abs/2609.39054 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_3873ce1ffb3f (Metraipolis archive dc_3873ce1ffb3f, sha256 9561d5cbfe06b26eb79e969359c0bc2832035c585e96a13503c8469a5387acae)
BibTeX
@misc{dc3873ce1ffb3f,
title = {CLIPPER Beyond Shortlisting: Auditable Decision Support for Changing Municipal Micromobility Policies — arXiv:2609.39054},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.39054},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_3873ce1ffb3f; sha256 9561d5cbfe06b26eb79e969359c0bc2832035c585e96a13503c8469a5387acae},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.39054. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In municipal planning workshops, planners and other stakeholders compare shared-micromobility parking policies by varying no-parking zones, retained sites, spacing, or area allocations. Each edit changes feasible sites and how much demand they cover, so the alternative must be reoptimized on the same spatial data. Full-set greedy, the transparent reference for this task, takes tens of seconds per alternative at city scale. We present Constraint-exact Low-latency Iterative Planning with Pooled Evaluation and Replay (CLIPPER), an optimizer with audit functions developed for requirements elicited with the City of Braunschweig. In each greedy round, it forms a deterministic candidate pool of bounded size, computes how much still-uncovered demand each candidate would add, and rejects candidates that violate an active constraint. An optional offline audit scans every remaining feasible candidate and records what the restricted pool omitted. We evaluate these functions on complete eleven-state edit chains ($E_0,\ldots,E_{10}$) in Braunschweig, Munich, and Berlin. With $K=1024$ candidates per group, the fixed-width mode CLIPPER-F has mean coverage gaps to full-set greedy under the same policy of 0.245, 0.003, and 0.001 percentage points in Braunschweig, Munich, and Berlin, respectively, while mean rollout time falls by factors of 13.6--28.9; no audited run terminates while a candidate outside the pool could still increase coverage. Plans computed from two checksummed versions of Braunschweig's official no-parking-zone data differ in 30 of about 540 selected sites although coverage moves by only about 0.1 percentage points. These changes still require municipal assessment and implementation. The findings inform a proposed municipal process that versions policy inputs, reports site changes beside coverage, and scans the full candidate set before a final decision.
Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-10-01 in cs.RO).
Categorie arXiv: Robotics (cs.RO).
Pagina del lavoro: https://arxiv.org/abs/2609.39054 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T14:44:47.410Z dalla pagina https://arxiv.org/catchup/cs.RO/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).