Informed Sampling-based Collision Avoidance with Least Deviation from the Nominal Path
Thomas T. Enevoldsen, Roberto Galeazzi

TL;DR
This paper introduces an informed sampling method for local path re-planning that minimizes deviation from a nominal path while avoiding collisions, demonstrated on autonomous marine craft navigation.
Contribution
It proposes a novel informed sampling scheme and cost function that efficiently ensures collision avoidance with minimal deviation from the nominal path.
Findings
Effective collision avoidance with minimal path deviation
Efficient sampling scheme using ellipsoids along the path
Validated on autonomous marine craft navigation scenarios
Abstract
This paper addresses local path re-planning for -dimensional systems by introducing an informed sampling scheme and cost function to achieve collision avoidance with minimum deviation from an (optimal) nominal path. The proposed informed subset consists of the union of ellipsoids along the specified nominal path, such that the subset efficiently encapsulates all points along the nominal path. The cost function penalizes large deviations from the nominal path, thereby ensuring current safety in the face of potential collisions while retaining most of the overall efficiency of the nominal path. The proposed method is demonstrated on scenarios related to the navigation of autonomous marine crafts.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRobotic Path Planning Algorithms · Maritime Navigation and Safety · Optimization and Search Problems
