Chance constraint based multi agent navigation under uncertainty
Bharath Gopalakrishnan, Arun Kumar Singh, Meha Kaushik, K. Madhava, Krishna, Dinesh Manocha

TL;DR
This paper introduces PRVO, a probabilistic algorithm for multi-robot navigation under uncertainty, ensuring collision avoidance with specified probabilities while maintaining computational efficiency similar to deterministic methods.
Contribution
The paper presents a novel probabilistic extension of RVO that efficiently incorporates motion and perception uncertainties into multi-agent navigation, with a closed-form solution for collision probability.
Findings
PRVO effectively accounts for uncertainty in robot navigation.
PRVO outperforms conservative bounding volume methods.
The approach maintains computational complexity comparable to deterministic RVO.
Abstract
We present Probabilistic Reciprocal Velocity Obstacle or PRVO as a general algorithm for navigating multiple robots under perception and motion uncertainty. PRVO is defined as the space of velocities that ensures dynamic collision avoidance between a pair of robots with a specified probability. Our approach is based on defining chance constraints over the inequalities defined by the deterministic Reciprocal Velocity Obstacle (RVO). The computational complexity of the proposed probabilistic RVO is comparable to the deterministic counterpart. This is achieved by a series of reformulations where we first substitute the computationally intractable chance constraints with a family of surrogate constraints and then adopt a time scaling based solution methodology to efficiently characterize their solution space. Further, we also show that the solution space of each member of the family of…
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.
