Open Access. Powered by Scholars. Published by Universities.®

Probability Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 2 of 2

Full-Text Articles in Probability

Statistical Approach To Quantifying Interceptability Of Interaction Scenarios For Testing Autonomous Surface Vessels, Benjamin E. Hargis, Yiannis E. Papelis Apr 2023

Statistical Approach To Quantifying Interceptability Of Interaction Scenarios For Testing Autonomous Surface Vessels, Benjamin E. Hargis, Yiannis E. Papelis

Modeling, Simulation and Visualization Student Capstone Conference

This paper presents a probabilistic approach to quantifying interceptability of an interaction scenario designed to test collision avoidance of autonomous navigation algorithms. Interceptability is one of many measures to determine the complexity or difficulty of an interaction scenario. This approach uses a combined probability model of capability and intent to create a predicted position probability map for the system under test. Then, intercept-ability is quantified by determining the overlap between the system under test probability map and the intruder’s capability model. The approach is general; however, a demonstration is provided using kinematic capability models and an odometry-based intent model.


An Adaptive Algorithm For `The Secretary Problem': Alternate Proof Of The Divergence Of A Maximizer Sequence, Andrew Benfante, Xiang Xu Jan 2023

An Adaptive Algorithm For `The Secretary Problem': Alternate Proof Of The Divergence Of A Maximizer Sequence, Andrew Benfante, Xiang Xu

OUR Journal: ODU Undergraduate Research Journal

This paper presents an alternate proof of the divergence of the unique maximizer sequence {π‘₯βˆ— 𝑛} of a function sequence {𝐹𝑛(π‘₯)} that is derived from an adaptive algorithm based on the now classic optimal stopping problem, known by many names but here β€˜the secretary problem’. The alternate proof uses a result established by Nguyen, Xu, and Zhao (n.d.) regarding the uniqueness of maximizer points of a generalized function sequence {π‘†πœ‡,𝜎 𝑛 } and relies on the strict monotonicity of 𝐹𝑛(π‘₯) as 𝑛 increases in order to show divergence of {π‘₯βˆ— 𝑛}. Towards this, limits of the exponentiated Gaussian CDF are …