Pith. sign in

REVIEW

AutoRVO: Local Navigation with Dynamic Constraints in Dense Heterogeneous Traffic

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 1804.02915 v2 pith:R6XBQO2E submitted 2018-04-09 cs.RO cs.MA

classification cs.ROcs.MA
keywords algorithmdensetrafficconstraintsdynamicaccountcollision-freeheterogeneous
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We present a novel algorithm for computing collision-free navigation for heterogeneous road-agents such as cars, tricycles, bicycles, and pedestrians in dense traffic. Our approach currently assumes the positions, shapes, and velocities of all vehicles and pedestrians are known and computes smooth trajectories for each agent by taking into account the dynamic constraints. We describe an efficient optimization-based algorithm for each road-agent based on reciprocal velocity obstacles that takes into account kinematic and dynamic constraints. Our algorithm uses tight fitting shape representations based on medial axis to compute collision-free trajectories in dense traffic situations. We evaluate the performance of our algorithm in real-world dense traffic scenarios and highlight the benefits over prior reciprocal collision avoidance schemes.

Discussion (0). Sign in to comment.

Pith tools