Jung Mo Kang

Jung Mo Kang

orcid

Research Focus & Metrics

Academic Career Length

1Year (2026-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 November 2026 in Preprints.org
Verified
Preprint
Open access
PDF file
JKJung Mo Kang
Jung Mo Kang
The Model Predictive Path Integral (MPPI) con troller shipped with ROS 2 Nav2 is a widely used deployable local controller for mobile robots, yet in narrow, crowded, dynamic spaces it can stall in local minima, and its critics avoid collisions only through soft costs, with no formal safety guarantee. Methods exist for each weakness, and several works outside Nav2 address both together, but we know of no public Nav2 controller plugin that combines local-minima escape with a barrier-based safety filter. This system paper presents Safe-Escape MPPI (SE-MPPI), a Nav2 controller plugin that integrates online local-minima detection-and-escape for MPPI with a control-barrier-function (CBF) safety filter for tracked dynamic obstacles. A first version of the plugin reached the goal in none of its 44 valid live trials on a correct build; we report the four defects that we identify as the cause (one inferred, not logged) and the repaired controller. Its escape carries four additions to the advised design: two of them, avoid lists and a movement watchdog, were needed for the development sweeps of a family of pockets to pass (ablated jointly; the ablation is confounded with position in the sweep), and two are safeguards for other configurations. We disclose all four, with a joint ablation of the first two. In a pre-registered live campaign (one post hoc amendment to its crash-stop rule, after which all s4 SE-MPPI trials ran), SE-MPPI without recoveries reached the goal in 5 of 6 on s1 (Wilson 95% interval [0.44,0.97]) and 5 of 6 on the held-out s4, which lies outside the development family; stock without recoveries in 0 of 6 on each; with Nav2’s default recovery tree, on s1, stock 0 of 6 and SE-MPPI 3 of 6, on one simulated host (Fisher exact p = 0.0152 for each of the first two contrasts and p = 0.1818 for the third, which is descriptive). s1 is the development scenario; s4 carries the claim. A third pocket, s3, that has a near mirror twin in the development family gave 4 of 6 against 0 of 6 (p = 0.0606, not significant). We make no claim beyond one simulated host, six repetitions per cell, and no real robot. In a randomized, paired 1,200-trial benchmark on a Python 2D mirror that transcribes the shipped algorithm, not on the Nav2 controller itself, escape raises success on the static U-trap family from 0% to 80% (Wilson 95% interval [67,89]); a second arm of 1,200 trials on the same 200 seeded worlds, with the four additions switched off, reaches 58%. The escape–safety coordination matches an independent escape+CBF stack there, a null result, so we claim it only as a mechanism. By a standard argument for time-varying CBF gains, the gain schedule preserves forward invariance of the barrier’s safe set, a conditional guarantee that covers only a look-ahead point and the tracked dynamic obstacles, assumes that the barrier inequality holds between control updates, and requires a slack free quadratic program.

7 October 2026 in Preprints.org
Verified
Preprint
Open access
PDF file
JKJung Mo Kang
Jung Mo Kang
Widely used open-source tools for map-based LiDAR localization of mobile robots are still largely organized by sensor suite: a 2D scanner typically calls for an AMCL-style particle filter over an occupancy grid, a 3D LiDAR for an NDT-based tracker over a point-cloud map, and an inertial- or GNSS-aided platform for a Kalman fusion node, often with different topics, parameters, initialization, and recovery behavior. Existing libraries already share one particle-filter core across 2D and 3D sensor models, and other systems already relocalize a robot by branch-and-bound scan matching. We describe PRISM-Loc, an open-source ROS 2 localization stack that places three established estimator families behind one node contract: laser2d, a likelihood-field Monte Carlo localizer; ndt3d, a planar NDT-MCL backend (Saarinen et al., 2013) that reuses the same particle filter with a Gaussian-voxel measurement model; and fusion3d, a 15-state error-state Kalman filter fusing LiDAR, IMU, and RTK-GNSS. Every backend publishes the same map→odom transform and pose with covariance and accepts the same /initialpose seeding, all filter mathematics live in Eigen-only C++17 cores that are tested without a ROS runtime, and laser2d relocalizes a kidnapped robot on request (at startup or by a service call) by deterministic branch-and-bound scan matching over a map-sized search window restricted to cells not marked occupied, keeping the top-K candidate poses and committing one only after several odometry-chained scans concentrate a normalized heuristic evidence score on it, and otherwise reporting the place as ambiguous. We claim no new estimator theory and no new verification principle; the contribution is this particular integration, released as software. In seeded closed-loop experiments on synthetic data that drive the actual cores, the 2D tracker holds a steady-state mean position error of 0.105 m, branch-and-bound relocalization succeeds on 97 of 100 kidnapped-robot queries in a 6 m room with zero false accepts at its default threshold, on 40 m and 80 m maps with repeated structure the single-scan rule accepts a wrong pose on 6 and 15 of 120 queries, which multi-scan verification reduces to 0 and 1 of 120 (pooled 95% Wilson interval 0.1–2.3%) while committing as many correct poses (242 against 241 of 300), and the ESKF bounds a 10 s aiding dropout to 0.125 m RMSE, although a 100-run NEES test shows that its covariance is overconfident (full-state NEES above the 95% interval at 89 of 120 epochs, mainly in attitude; bias blocks consistent). No external baseline and no real or public data are used, and no field-accuracy claim is made. Code: https://github.com/kjungmo/prism_loc.

2 October 2026 in Preprints.org
Verified
Preprint
Open access
PDF file
JKJung Mo Kang
Jung Mo Kang
Service robots in crowded pedestrian environments re-decide at every control cycle which side to pass a person on; when this re-decision is greedy, the passing direction can oscillate across cycles in ambiguous configurations, or the robot can freeze. Topology-aware planners bias selection toward the previously chosen class through soft costs, selection hysteresis, or consistency weights; opinion-dynamics methods make the passing side an explicit, stateful decision with deadlock-breaking guarantees; and minimum-dwell or fixed-rate selectors bound the switching rate by construction. We introduce COMPASS (COMmitment-based PASSing for Social navigation), a decision-layer planner whose commitment rule is a leaky evidence accumulator — a rectified, leaky variant of Page’s one-sided CUSUM statistic with a progress-dependent threshold — under a lexicographic safety override of the standard priority-arbitration kind. Passing classes are bound to person track IDs, a design contract that the current implementation only partly realizes. We state five properties (P1–P5); they apply standard arguments and are not new mathematics. The load-bearing one, P2, is a deterministic, pathwise lower bound on the number of control cycles between discretionary switches that follows from the accumulator rather than from a fixed dwell timer; at the default knobs its worst case is 3 cycles (0.15 s). P2 is paired with a conditional response-time bound, and P1 refines it to an exponentially small per-cycle switching probability under an i.i.d. hypothesis. In an offline harness that drives the actual decision core (5 scenarios × 50 seeds), an immediate-argmin comparator produces about 98 decision changes per encounter under ambiguous ties, whereas COMPASS produces at most one decision change in each tested encounter, as does a 0.6 s persistence (dwell) timer in that scenario; the two rules differ under transient, reversing and intermittent advantage. In a historical decision-core-only measurement, latency at K = 3 (8 classes) is p99 58.6µs and max 651.3µs (the max is about 1.30% of the 50 ms budget at 20 Hz). All comparators are internal. Closed-loop evaluation, external baselines (including a previous-class consistency-weight baseline), and user studies are not performed; they are specified as a planned-evaluation protocol. Code: https://github.com/kjungmo/compass.

23 October 2026 in Preprints.org
Verified
Preprint
Open access
PDF file
JKJung Mo Kang
Jung Mo Kang
A robot that maps one building for weeks must keep walls, forget movers and treat a scheduled door as signal. Occupancy mappers make the first two decisions with a log-odds accumulator whose increments were chosen by habit. We show that the OctoMap increments (+0.85, −0.4) are the increments of Wald’s sequential probability ratio test (SPRT) between the hit rates 0.1975 and 0.4621, so that “Static” means “occupied in more than about a third of the windows”, and that a multiplicative leak removes the property on which an error bound rests. STRATA 0.2 makes the test explicit: the user states two hit rates and two error rates, increments and thresholds follow, and a cell ends Static, Rejected or Undecided. Under independent windows, clutter at a hit rate of at most m0 graduates in the first test of one cell history (up to its first graduation, its first rejection or its retention as a periodic candidate) with probability at most 0.0101 (Ville’s inequality); restarts after a demotion are not covered. The operating characteristic measured on the engine with the Periodic veto off matches the exact computation of the rule and is approximated by Wald’s closed form. At a lag-1 autocorrelation of 0.23, the low end of the range measured on real calibration cells (0.231 to 0.474), the graduation rate per forward test (a history split at each demotion) is 3.49 times α, and at 0.5 it is 10.87 times α. We derived the pair under a pre-registered rule that we amended after the first calibration measurement, and the wall-thickness gate failed on every calibration sequence, so the shipped pair (0.20, 0.70, 0.01, 0.01) is provisional and the 3D pair is not calibrated. On held-out LILocBench, Oxford Spires, KTH-benchmark and Boreas data we compare seven evidence rules, without tuning and without choosing a winner. On LILocBench clutter, 8.81 % of the cells are ever Static under the sequential test (2.93 % at an observed hit rate of at most m0) against 21.16 % under v0.1; both exceed the nominal α = 0.01, which is per history, not per cell. The sequential test rejects none of the 366 wall-run cells, as does v0.1, but it leaves 14.21 %of them not Static at the end against 1.09 % for v0.1, and it needs a median of 33 windows to graduate one, against 10. In the opposite direction, on KITTI 05 (0.2 m voxels, ten frames per window, Periodic veto on) under the policy that exports Static voxels only, it drops more of both static and dynamic points than v0.1 (static accuracy 66.90 % against 90.20 %, dynamic accuracy 98.99 % against 83.19 %); a dynamic accuracy above that of an oracle map is reached only by dropping static points, and in this setting, under the policy that exports every voxel not Rejected, it removes no dynamic point. The engine is one geometry-free state machine for a 2D grid and a 3D voxel hash, with a FreMEn-style periodic label whose false-alarm bound holds for iid clutter; Periodic is validated on synthetic streams only. Code: https://github.com/kjungmo/strata/tree/paper-v2.