Computation of forward stochastic reach sets: Application to stochastic, dynamic obstacle avoidance
Baisravan HomChaudhuri, Abraham P. Vinod, and Meeko M. K. Oishi

TL;DR
This paper introduces an efficient method to compute the forward stochastic reach set and its probability measure for nonlinear systems, enabling probabilistic obstacle avoidance in robotics, especially with convex obstacle shapes.
Contribution
The paper presents a novel approach to compute FSR sets with probability measures for nonlinear stochastic systems, facilitating probabilistic collision avoidance in robotics.
Findings
Method successfully computes FSR sets for nonlinear systems.
Convexity of FSR is guaranteed for convex obstacle shapes.
Demonstrated effectiveness in multi-obstacle avoidance scenarios.
Abstract
We propose a method to efficiently compute the forward stochastic reach (FSR) set and its probability measure for nonlinear systems with an affine disturbance input, that is stochastic and bounded. This method is applicable to systems with an a priori known controller, or to uncontrolled systems, and often arises in problems in obstacle avoidance in mobile robotics. When used as a constraint in finite horizon controller synthesis, the FSR set, and its probability measure facilitates probabilistic collision avoidance, in contrast to methods which presume the obstacles act in a worst-case fashion and generate hard constraints that cannot be violated. We tailor our approach to accommodate rigid body constraints, and show convexity is assured so long as the rigid body shape of each obstacle is also convex. We extend methods for multi-obstacle avoidance through mixed integer linear…
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.
