![]() |
Re: An improvement to OPR
Thanks for the information Ether. It spurred me to check the details in the Octave documentation
Quote:
Unfortunately I don't have access to reliable per robot score data otherwise we could establish how well a Gaussian distribution models typical robot performance. (I did check my team's scouting data but it varied too far from the official scores to rely on.) If anyone would like to share scouting data from this season I'd be very interested. In my professional life I work on big statistical modeling problems and we still usually base the models on Gaussians due to their computational ease, albeit as Gaussian Mixture Models to approximate any probability density function. * In fact we know for certain that a pure climber can only score discrete values of 0, 10, 20 or 30 points. |
Re: An improvement to OPR
1 Attachment(s)
Quote:
Speaking of speed, attached is a zip file containing a test case of N and d for the normal equations Nx=d. Would you please solve it for x using Octave and tell me how long it takes? (Don't include the time it takes to read the large N matrix from the disk, just the computation time). PS: N and d were created from the official qual Match Results posted by FIRST for 75 regional and district events plus MAR, MSC, Archi, Curie, Galileo, & Newton. So solving for x is solving for World OPR. |
Re: An improvement to OPR
Quote:
We can test it afterwards and calculate the b and see how close it is to the missing subscore of the surrogate match. |
Re: An improvement to OPR
Quote:
|
| All times are GMT -5. The time now is 08:53. |
Powered by vBulletin® Version 3.6.4
Copyright ©2000 - 2017, Jelsoft Enterprises Ltd.
Copyright © Chief Delphi