Skip to content

Event

CONSORT: Multi-Robot Cooperative Localization Planning under GPS Denial

1 reports · 1 sources

Tony Zhang and co-authors submitted a preprint proposing CONSORT, a multi-robot cooperative localization planning method for GPS-denied environments: the primary agent must reach the goal in minimum time under collision probability constraints and a terminal localization uncertainty bound. The method optimizes only the mean state trajectory, propagates covariance only when evaluating terminal constraints, converts the belief-space problem into a solvable form, and achieves discrete-to-continuous planning via a joint search over a hexagonal grid plus spline trajectory refinement. The authors report that across 50 randomized scenarios, planner performance diverges as the terminal uncertainty constraint tightens: CONSORT solves 80% of the scenarios, versus 54% for the strongest baseline, with comparable path lengths. In maritime simulations, when executed under feedback control and using an independently developed factor-graph estimator, trajectories remain collision-free and terminal uncertainty differs from its prediction by within 6%. These results are as reported by the authors and have not yet been independently verified.

Report timeline

  1. CONSORT: Multi-Robot Cooperative Localization Planning with Uncertainty Constraints in GPS-Denied Environments

    The authors propose CONSORT, a multi-robot planning method for cooperative localization in GPS-denied environments. By optimizing only over mean-state trajectories and propagating covariance only for terminal constraint evaluation, it turns the belief-space problem into a solvable form.

    arXiv cs.RO ·

Related topics

Interest trend

Current
3
Peak
4Nov 4 01:00
Past 24 hours
–

The trend compares participants observed throughout the same period, so its range may be smaller than the current interest count. Move or tap to inspect each hour; use the arrow keys on a keyboard.