pith. sign in

arxiv: 2408.02786 · v5 · submitted 2024-08-05 · 💻 cs.RO · cs.SY· eess.SY

City-Wide Low-Altitude Urban Air Mobility: A Scalable Global Path Planning Approach via Risk-Aware Multi-Scale Cell Decomposition

Josue N. Rivera , Dengfeng Sun , Chen Lv This is my paper

Pith reviewed 2026-05-23 21:52 UTC · model grok-4.3

classification 💻 cs.RO cs.SYeess.SY
keywords urban air mobilitypath planningrisk-aware planningcell decompositionmulti-scale decompositionglobal path planningairspace partitioningdrone navigation
0
0 comments X

The pith

A multi-scale cell decomposition method plans safer urban air mobility paths faster than A* or sampling algorithms by bounding risk in variable airspace sectors.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper aims to establish that a hierarchical decomposition of city airspace into sectors of varying size, each carrying an analytically computed risk score, can deliver global paths for low-altitude vehicles that are both safer and far quicker to compute than uniform grids or sampling planners. A sympathetic reader would care because current methods either become too slow or too coarse when the environment spans an entire city with many buildings and no-fly zones. The approach claims to achieve this balance by using Mahalanobis distance projections to set upper bounds on cell risk, removing the need to sample the full risk field at every point. Experiments on five different urban layouts are presented as evidence that the resulting paths accumulate less risk while cutting runtime by orders of magnitude relative to A*, artificial potential fields, and Informed RRT*.

Core claim

The authors state that their risk-aware multi-scale cell decomposition partitions city-scale airspace into variable-granularity sectors, assigns each cell an analytically estimated risk value based on obstacle proximity, and uses Mahalanobis distance projections to bound that risk without exhaustive sampling, thereby generating paths with lower cumulative risk and orders-of-magnitude lower computation time than A*, APF, or Informed RRT* across five diverse urban topologies.

What carries the argument

Risk-aware multi-scale cell decomposition, which partitions airspace into sectors of adjustable size and bounds each sector's risk via Mahalanobis distance projections to obstacles.

If this is right

  • Paths exhibit lower cumulative risk than those from A*, APF, or Informed RRT* in tested city layouts.
  • Computation time drops by orders of magnitude relative to the baselines.
  • The method scales to full city extents while remaining compatible with standard map providers through a modified GeoJSON format.
  • Open-sourced implementation allows direct reproduction on OpenStreetMap data for any city.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • If the analytical risk bounds remain reliable under changing conditions, the planner could support periodic re-computation when new obstacles appear.
  • Variable cell sizes may permit straightforward coupling with finer local avoidance controllers to create a complete navigation pipeline.
  • The same bounding technique could be tested on three-dimensional volumes rather than projected 2D sectors to address vertical separation rules.

Load-bearing premise

Risk values estimated from obstacle proximity and Mahalanobis distance projections accurately represent actual navigation risk without needing exhaustive sampling of the risk field.

What would settle it

Running the planner on a sixth urban map where either the computation time reduction falls below an order of magnitude or the produced paths show higher actual collision or risk exposure in simulation than the compared baselines would falsify the performance claims.

Figures

Figures reproduced from arXiv: 2408.02786 by Chen Lv, Dengfeng Sun, Josue N. Rivera.

Figure 1
Figure 1. Figure 1: Illustration of the repulsion vectors with respect to [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Stages of Larp for a walled room scene It consists of three main stages: first, a core algorithm that decomposes a field into distinct multi-scale cells; secondly, the formation of a routing network using the cells and their adjacency; lastly, the search for a feasible, suitable, and safe route. The stages can be observed in [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Quad tree for a simple potential field. Algorithm 1 Larp – Quad Tree Cell Decomposition 1: function BUILD(x, n, U) 2: quad ← QuadNode(x, n) 3: zones ← map with default farthest zone 4: if |U| > 0 then 5: zones ← APPROXOBSTACLESZONES(x, n, U) 6: end if 7: quad.zone ← min(zones) ▷ Farthest zone if empty 8: if n ≤ nmax then 9: if n ≤ nmin or quad.zone is farthest zone then 10: Mark quad as leaf 11: return qua… view at source ↗
Figure 4
Figure 4. Figure 4: Estimating the maximum potential of an given area [PITH_FULL_IMAGE:figures/full_fig_p004_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Comparison of routes in Scenario 1, featuring [PITH_FULL_IMAGE:figures/full_fig_p006_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Scenario 2 of an obstructed path and near-obstacle [PITH_FULL_IMAGE:figures/full_fig_p007_6.png] view at source ↗
Figure 8
Figure 8. Figure 8: Routes among high buildings in downtown Austin, [PITH_FULL_IMAGE:figures/full_fig_p007_8.png] view at source ↗
Figure 7
Figure 7. Figure 7: Routes comparison for Scenario 3, featuring a [PITH_FULL_IMAGE:figures/full_fig_p007_7.png] view at source ↗
Figure 9
Figure 9. Figure 9: Routes surrounding downtown Austin, TX. scenario. The source code to generate the routes near Austin, TX or any city can be found on our Github repository at https://github.com/wzjoriv/Larp. A GeoJSON file of the city’s buildings is needed to run it. It can be obtained via OpenStreetMap or similar map providers. V. CONCLUSION This study introduces Larp, a novel path planning frame￾work specifically designe… view at source ↗
read the original abstract

The realization of Urban Air Mobility (UAM) necessitates scalable global path planning algorithms capable of ensuring safe navigation within complex urban environments. This paper proposes a multi-scale risk-aware cell decomposition method that efficiently partitions city-scale airspace into variable-granularity sectors, assigning each cell an analytically estimated risk value based on obstacle proximity and expected risk. Unlike uniform grid approaches or sampling-based methods, our approach dynamically balances resolution with computational speed by bounding cell risk via Mahalanobis distance projections, eliminating exhaustive field sampling. Comparative experiments against classical A*, Artificial Potential Fields (APF), and Informed RRT* across five diverse urban topologies demonstrate that our method generates safer paths with lower cumulative risk while reducing computation time by orders of magnitude. The proposed framework, Larp Path Planner, is open-sourced and supports any map provider via its modified GeoJSON internal representation, with experiments conducted using OpenStreetMap data to facilitate reproducible research in city-wide aerial navigation.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper proposes a multi-scale risk-aware cell decomposition method for global path planning in city-wide low-altitude urban air mobility (UAM). The approach partitions airspace into variable-granularity sectors, assigns each cell an analytically estimated risk based on obstacle proximity and Mahalanobis distance projections to bound risk without exhaustive sampling, and dynamically balances resolution and speed. Comparative experiments on five urban topologies claim that the method (Larp Path Planner) produces paths with lower cumulative risk than A*, APF, and Informed RRT* while reducing computation time by orders of magnitude. The framework is open-sourced, uses a modified GeoJSON representation, and supports experiments with OpenStreetMap data.

Significance. If the risk proxy is shown to correlate with real navigation safety and the comparisons hold under independent evaluation, the method could enable scalable city-wide UAM planning by avoiding the computational cost of uniform grids or sampling-based planners. The open-sourcing of the planner and use of standard OSM data for reproducibility are explicit strengths that facilitate follow-on work.

major comments (2)
  1. [Abstract / comparative experiments] Abstract and experimental results: the central claim that the method 'generates safer paths with lower cumulative risk' is evaluated using the same analytic risk estimator (obstacle proximity + Mahalanobis distance projections that bound cell risk) employed inside the planner to eliminate field sampling. This makes the reported safety advantage follow from the construction rather than constituting an independent test against actual collision probability or dynamic clearance.
  2. [Method description] Method description: the assumption that the Mahalanobis-based analytic risk bound is a sufficient proxy for navigation risk (invoked to justify scalability and avoid exhaustive sampling) is load-bearing for both the algorithmic contribution and the experimental conclusions, yet no correlation study, sensitivity analysis, or external validation against sampled or simulated ground-truth risk is reported.
minor comments (2)
  1. Clarify whether the five topologies are drawn from real OSM extracts or synthetic maps, and report the exact risk-threshold and granularity parameters used so that the 'parameter-free' aspects of the comparison can be assessed.
  2. The abstract states both 'expected risk' and 'analytically estimated risk value'; adopt consistent terminology throughout.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the detailed and constructive report. The comments highlight important distinctions between our risk model and external validation, which we address point by point below while clarifying the intended scope of the contribution.

read point-by-point responses

  1. Referee: [Abstract / comparative experiments] Abstract and experimental results: the central claim that the method 'generates safer paths with lower cumulative risk' is evaluated using the same analytic risk estimator (obstacle proximity + Mahalanobis distance projections that bound cell risk) employed inside the planner to eliminate field sampling. This makes the reported safety advantage follow from the construction rather than constituting an independent test against actual collision probability or dynamic clearance.

    Authors: We acknowledge that cumulative risk is computed with the identical analytic estimator used by the planner. This is by design: the contribution is an efficient optimizer for the defined risk model, and the experiments demonstrate that Larp produces lower values of this metric than the baselines across the tested maps. The advantage is therefore internal to the model rather than an independent empirical test of collision probability. We will revise the abstract, results, and add a dedicated limitations paragraph to state this scope explicitly and note that external validation against simulated trajectories remains future work. revision: partial

  2. Referee: [Method description] Method description: the assumption that the Mahalanobis-based analytic risk bound is a sufficient proxy for navigation risk (invoked to justify scalability and avoid exhaustive sampling) is load-bearing for both the algorithmic contribution and the experimental conclusions, yet no correlation study, sensitivity analysis, or external validation against sampled or simulated ground-truth risk is reported.

    Authors: The Mahalanobis projection supplies a conservative geometric bound that avoids exhaustive sampling while still penalizing proximity to obstacles; this bound is the core mechanism enabling multi-scale decomposition at city scale. No correlation study with ground-truth risk appears in the manuscript. We will add a sensitivity analysis subsection showing how risk values respond to changes in the Mahalanobis scaling factor and obstacle buffer, together with an explicit statement of the modeling assumptions in Section III. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation remains self-contained with external baselines

full rationale

The paper presents an algorithmic multi-scale cell decomposition method that assigns analytically estimated risk values and compares resulting paths against independent baselines (A*, APF, Informed RRT*) on five urban topologies using computation time and cumulative risk metrics. No equations or self-citations are shown that reduce the claimed performance gains or risk values to fitted parameters, self-definitions, or prior author work by construction. The analytic risk proxy is used for planning and scalability, but the experimental validation invokes external algorithm comparisons rather than internal re-use that would force the outcome. This is the normal case of an algorithmic contribution with falsifiable external benchmarks.

Axiom & Free-Parameter Ledger

2 free parameters · 1 axioms · 0 invented entities

Abstract-only review limits visibility into parameters; the approach rests on domain assumptions about risk modeling rather than new entities or heavy fitting.

free parameters (2)
  • multi-scale granularity levels
    Variable cell sizes are chosen to balance resolution and speed; specific selection criteria or values not detailed in abstract.
  • risk threshold parameters
    Values used to assign and bound cell risk based on proximity are implicit in the analytical estimation but unspecified.
axioms (1)
  • domain assumption Risk can be analytically estimated from obstacle proximity using Mahalanobis distance projections without exhaustive sampling
    Central to eliminating field sampling and enabling scalability as described in the method.

pith-pipeline@v0.9.0 · 5709 in / 1333 out tokens · 27475 ms · 2026-05-23T21:52:37.672335+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

27 extracted references · 27 canonical work pages

  1. [1]

    A survey on operation concept, advancements, and challenging issues of urban air traffic management

    Rakesh Shrestha, Inseon Oh, and Shiho Kim. A survey on operation concept, advancements, and challenging issues of urban air traffic management. Frontiers in Future Transportation, 2:1, 2021

    work page 2021

  2. [2]

    A compre- hensive review of recent research trends on unmanned aerial vehicles (uavs)

    Khaled Telli, Okba Kraa, Yassine Himeur, Abdelmalik Ouamane, Mohamed Boumehraz, Shadi Atalla, and Wathiq Mansoor. A compre- hensive review of recent research trends on unmanned aerial vehicles (uavs). Systems, 11(8):400, 2023

    work page 2023

  3. [3]

    Analysis of barriers to implement drone logistics

    Bhawesh Sah, Rohit Gupta, and Dana Bani-Hani. Analysis of barriers to implement drone logistics. International Journal of Logistics Research and Applications, 24(6):531–550, 2021

    work page 2021

  4. [4]

    Designing airspace for urban air mobility: A review of concepts and approaches

    Aleksandar Bauranov and Jasenka Rakas. Designing airspace for urban air mobility: A review of concepts and approaches. Progress in Aerospace Sciences , 125:100726, 2021

    work page 2021

  5. [5]

    Air traffic management for collaborative routing of unmanned aerial vehicles via potential fields

    Josue N Rivera and Dengfeng Sun. Air traffic management for collaborative routing of unmanned aerial vehicles via potential fields. In 2024 International Conference on Research in Air Transportation (ICRAT), 2024

    work page 2024

  6. [6]

    Uav path optimization with an integrated cost assessment model considering third-party risks in metropolitan environments

    Bizhao Pang, Xinting Hu, Wei Dai, and Kin Huat Low. Uav path optimization with an integrated cost assessment model considering third-party risks in metropolitan environments. Reliability Engineering & System Safety , 222:108399, 2022

    work page 2022

  7. [7]

    A cost-aware path planning algorithm for mobile robots

    Junghun Suh and Songhwai Oh. A cost-aware path planning algorithm for mobile robots. In 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems , pages 4724–4729. IEEE, 2012

    work page 2012

  8. [8]

    A route planning method using cost map for mobile sensor nodes

    Masaki Nakamiya, Yasue Kishino, Tsutomu Terada, and Shojiro Nishio. A route planning method using cost map for mobile sensor nodes. In 2007 2nd International Symposium on Wireless Pervasive Computing . IEEE, 2007

    work page 2007

  9. [9]

    Spatiotemporal ground risk mapping for uncrewed aircraft systems operations

    Aliaksei Pilko, Andr ´as S ´obester, James P Scanlan, and Mario Ferraro. Spatiotemporal ground risk mapping for uncrewed aircraft systems operations. Journal of Aerospace Information Systems , 20(3):126–139, 2023

    work page 2023

  10. [10]

    Risk assess- ment model for uav cost-effective path planning in urban environments

    Xinting Hu, Bizhao Pang, Fuqing Dai, and Kin Huat Low. Risk assess- ment model for uav cost-effective path planning in urban environments. IEEE Access, 8:150162–150173, 2020

    work page 2020

  11. [11]

    Intelligent uav map generation and discrete path planning for search and rescue operations

    V ´ıctor San Juan, Matilde Santos, and Jos ´e Manuel And ´ujar. Intelligent uav map generation and discrete path planning for search and rescue operations. Complexity, 2018(1):6879419, 2018

    work page 2018

  12. [12]

    A minimum risk approach for path planning of uavs

    Luca De Filippis, Giorgio Guglieri, and Fulvia Quagliotti. A minimum risk approach for path planning of uavs. Journal of Intelligent & Robotic Systems, 61:203–219, 2011

    work page 2011

  13. [13]

    Conflict-free four- dimensional path planning for urban air mobility considering airspace occupancy

    Wei Dai, Bizhao Pang, and Kin Huat Low. Conflict-free four- dimensional path planning for urban air mobility considering airspace occupancy. Aerospace Science and Technology , 119:107154, 2021

    work page 2021

  14. [14]

    Adaptive conflict resolution for multi-uav 4d routes optimization using stochastic fractal search algorithm

    Bizhao Pang, Kin Huat Low, and Chen Lv. Adaptive conflict resolution for multi-uav 4d routes optimization using stochastic fractal search algorithm. Transportation Research Part C: Emerging Technologies , 139:103666, 2022

    work page 2022

  15. [15]

    Path planning for dual uavs cooperative suspension transport based on artificial potential field-a* algorithm

    Jinjun Rao, Chaoyu Xiang, Jinyao Xi, Jinbo Chen, Jingtao Lei, Woj- ciech Giernacki, and Mei Liu. Path planning for dual uavs cooperative suspension transport based on artificial potential field-a* algorithm. Knowledge-Based Systems, 277:110797, 2023

    work page 2023

  16. [16]

    Enhanced hybrid path planning algorithm based on apf and a-star

    Ahmed S Abdel-Rahman, Shady Zahran, Basem E Elnaghi, and SF Nafea. Enhanced hybrid path planning algorithm based on apf and a-star. The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences , 48:867–873, 2023

    work page 2023

  17. [17]

    Path planning techniques for mobile robots: Review and prospect

    Lixing Liu, Xu Wang, Xin Yang, Hongjie Liu, Jianping Li, and Pengfei Wang. Path planning techniques for mobile robots: Review and prospect. Expert Systems with Applications , 227:120254, 2023

    work page 2023

  18. [18]

    Potential-field-rrt: A path-planning algorithm for uavs based on potential-field-oriented greedy strategy to extend random tree

    Tai Huang, Kuangang Fan, Wen Sun, Weichao Li, and Haoqi Guo. Potential-field-rrt: A path-planning algorithm for uavs based on potential-field-oriented greedy strategy to extend random tree. Drones, 7(5):331, 2023

    work page 2023

  19. [19]

    Path planning of robot based on artificial potential field method

    Yang Li, Bin Tian, Yuanjun Yang, and Changde Li. Path planning of robot based on artificial potential field method. In 2022 IEEE 6th Information Technology and Mechatronics Engineering Conference (ITOEC), volume 6, pages 91–94. IEEE, 2022

    work page 2022

  20. [20]

    Obstacle avoidance of mobile robots using modified artificial potential field algorithm

    Seyyed Mohammad Hosseini Rostami, Arun Kumar Sangaiah, Jin Wang, and Xiaozhu Liu. Obstacle avoidance of mobile robots using modified artificial potential field algorithm. EURASIP Journal on Wireless Communications and Networking , 2019(1):1–19, 2019

    work page 2019

  21. [21]

    Modified artificial potential field method for online path planning applications

    Farid Bounini, Denis Gingras, Herve Pollart, and Dominique Gruyer. Modified artificial potential field method for online path planning applications. In 2017 IEEE Intelligent Vehicles Symposium (IV) , pages 180–185. IEEE, 2017

    work page 2017

  22. [22]

    Hager, and Z

    Howie Choset, Ji Y Lee, G.D. Hager, and Z. Dodds. Lecture notes in robotic motion planning: potential functions, 2010

    work page 2010

  23. [23]

    A potential field approach to path planning

    Yong K Hwang and Narendra Ahuja. A potential field approach to path planning. IEEE transactions on robotics and automation , 8(1):23–32, 1992

    work page 1992

  24. [24]

    Improved artificial potential field method applied for auv path planning

    Xiaojing Fan, Yinjing Guo, Hui Liu, Bowen Wei, and Wenhong Lyu. Improved artificial potential field method applied for auv path planning. Mathematical Problems in Engineering , 2020(1):6523158, 2020

    work page 2020

  25. [25]

    Artificial potential field based trajectory tracking for quadcopter uav moving targets

    Cezary Kownacki. Artificial potential field based trajectory tracking for quadcopter uav moving targets. Sensors, 24(4):1343, 2024

    work page 2024

  26. [26]

    Uav path planning based on improved artificial potential field method

    Guoqiang Hao, Qiang Lv, Zhen Huang, Huanlong Zhao, and Wei Chen. Uav path planning based on improved artificial potential field method. Aerospace, 10(6):562, 2023

    work page 2023

  27. [27]

    Path-planning for unmanned aerial vehicles with environment complexity considera- tions: A survey

    Michael Jones, Soufiene Djahel, and Kristopher Welsh. Path-planning for unmanned aerial vehicles with environment complexity considera- tions: A survey. ACM Computing Surveys , 55(11):1–39, 2023

    work page 2023