Pith. sign in

REVIEW 1 cited by

DS-MPEPC: Safe and Deadlock-Avoiding Robot Navigation in Cluttered Dynamic Scenes

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2303.10133 v1 pith:JDTF6SCS submitted 2023-03-17 cs.RO

classification cs.RO
keywords costdynamicformulationnavigationdeadlockenvironmentsfunctionpropose
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We present an algorithm for safe robot navigation in complex dynamic environments using a variant of model predictive equilibrium point control. We use an optimization formulation to navigate robots gracefully in dynamic environments by optimizing over a trajectory cost function at each timestep. We present a novel trajectory cost formulation that significantly reduces the conservative and deadlock behaviors and generates smooth trajectories. In particular, we propose a new collision probability function that effectively captures the risk associated with a given configuration and the time to avoid collisions based on the velocity direction. Moreover, we propose a terminal state cost based on the expected time-to-goal and time-to-collision values that helps in avoiding trajectories that could result in deadlock. We evaluate our cost formulation in multiple simulated and real-world scenarios, including narrow corridors with dynamic obstacles, and observe significantly improved navigation behavior and reduced deadlocks as compared to prior methods.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Learning Implicit Social Navigation Behavior using Deep Inverse Reinforcement Learning

    cs.RO 2025-01 conditional novelty 4.0 of 10

    S-MEDIRL, a deep inverse RL method with a bilateral filtering smoothing loss and demonstration extrapolation, learns to yield and avoid deadlock in a narrow crossing, reaching about 92% success.

Pith tools