PFS setup timing model Peter Mao. WARNING This is a toy model. It is intended to promote discussion of PFI setup time trades. Assume that all parameters.

Slides:



Advertisements
Similar presentations
Mobile Robot Localization and Mapping using the Kalman Filter
Advertisements

Arc-length computation and arc-length parameterization
Introduction. OzPoz is the fiber positioner for FLAMES, a multi-object spectroscopic facility on the VLT. It can feed light from as many as 140 objects.
State Estimation and Kalman Filtering CS B659 Spring 2013 Kris Hauser.
From Kinematics to Arm Control a)Calibrating the Kinematics Model b)Arm Motion Selection c)Motor Torque Calculations for a Planetary Robot Arm CS36510.
Efficiency of Algorithms Csci 107 Lecture 6-7. Topics –Data cleanup algorithms Copy-over, shuffle-left, converging pointers –Efficiency of data cleanup.
Markov-Chain Monte Carlo
x – independent variable (input)
Random-Variate Generation. Need for Random-Variates We, usually, model uncertainty and unpredictability with statistical distributions Thereby, in order.
Evolutionary Feature Extraction for SAR Air to Ground Moving Target Recognition – a Statistical Approach Evolving Hardware Dr. Janusz Starzyk Ohio University.
1 Integration of Background Modeling and Object Tracking Yu-Ting Chen, Chu-Song Chen, Yi-Ping Hung IEEE ICME, 2006.
Linear and generalised linear models Purpose of linear models Least-squares solution for linear models Analysis of diagnostics Exponential family and generalised.
Maximum likelihood (ML)
Traction Control Michael Boersma Michael LaGrand 12/10/03.
CSC2535: 2013 Advanced Machine Learning Lecture 3a: The Origin of Variational Bayes Geoffrey Hinton.
Title: Spatial Data Mining in Geo-Business. Overview  Twisting the Perspective of Map Surfaces — describes the character of spatial distributions through.
May 2008US Sensor Calibration1 Ultrasonic Sensors Calibration Omar A. Daud Truc-Vien T. Nguyen May 16, 2008.
Topics on Final Perceptrons SVMs Precision/Recall/ROC Decision Trees Naive Bayes Bayesian networks Adaboost Genetic algorithms Q learning Not on the final:
880.P20 Winter 2006 Richard Kass 1 Confidence Intervals and Upper Limits Confidence intervals (CI) are related to confidence limits (CL). To calculate.
EM and expected complete log-likelihood Mixture of Experts
STATUS REPORT OF FPC SPICA Task Force Meeting March 29, 2010 MATSUMOTO, Toshio (SNU)
Part 5 Parameter Identification (Model Calibration/Updating)
Chem Math 252 Chapter 5 Regression. Linear & Nonlinear Regression Linear regression –Linear in the parameters –Does not have to be linear in the.
University of Southern California Department Computer Science Bayesian Logistic Regression Model (Final Report) Graduate Student Teawon Han Professor Schweighofer,
Clustering Methods K- means. K-means Algorithm Assume that K=3 and initially the points are assigned to clusters as follows. C 1 ={x 1,x 2,x 3 }, C 2.
PFI Cobra/MC simulator Peter Mao. purpose develop algorithms for fiducial (FF) and science (SF) fiber identification under representative operating conditions.
CS 782 – Machine Learning Lecture 4 Linear Models for Classification  Probabilistic generative models  Probabilistic discriminative models.
Status of the Fourier Studies A. Cerri. Outline Introduction Description of the tool Validation –“lifetime fit” –Pulls Toy Montecarlo –Ingredients –Comparison.
A unifying framework for hybrid data-assimilation schemes Peter Jan van Leeuwen Data Assimilation Research Center (DARC) National Centre for Earth Observation.
DSP C5000 Chapter 16 Adaptive Filter Implementation Copyright © 2003 Texas Instruments. All rights reserved.
© Department of Statistics 2012 STATS 330 Lecture 20: Slide 1 Stats 330: Lecture 20.
How Errors Propagate Error in a Series Errors in a Sum Error in Redundant Measurement.
Observational Astrophysics I
Mixture of Gaussians This is a probability distribution for random variables or N-D vectors such as… –intensity of an object in a gray scale image –color.
August 26, 2003P. Nilsson, SPD Group Meeting1 Paul Nilsson, SPD Group Meeting, August 26, 2003 Test Beam 2002 Analysis Techniques for Estimating Intrinsic.
Determination of True Attenuation Lengths using SPASE-AMANDA Coincidence Data Tim Miller JHU/APL.
21 Jun 2010Paul Dauncey1 First look at FNAL tracking chamber alignment Paul Dauncey, with lots of help from Daniel and Angela.
ECE 8443 – Pattern Recognition ECE 8423 – Adaptive Signal Processing Objectives: Supervised Learning Resources: AG: Conditional Maximum Likelihood DP:
Bayes Theorem The most likely value of x derived from this posterior pdf therefore represents our inverse solution. Our knowledge contained in is explicitly.
Radial Basis Function ANN, an alternative to back propagation, uses clustering of examples in the training set.
Sensor testing and validation plans for Phase-1 and Ultimate IPHC_HFT 06/15/ LG1.
Requirements for Single-Dish Holography Parameter Specification Goal Measurement error
System Performance Metrics and Current Performance Status George Angeli.
Logistic Regression William Cohen.
ST236 Site Calibrations with Trimble GNSS
2005 Unbinned Point Source Analysis Update Jim Braun IceCube Fall 2006 Collaboration Meeting.
Regularization of energy-based representations Minimize total energy E p (u) + (1- )E d (u,d) E p (u) : Stabilizing function - a smoothness constraint.
ESTIMATION METHODS We know how to calculate confidence intervals for estimates of  and  2 Now, we need procedures to calculate  and  2, themselves.
Brenna Flaugher for the DES Collaboration; DPF Meeting August 27, 2004 Riverside,CA Fermilab, U Illinois, U Chicago, LBNL, CTIO/NOAO 1 Dark Energy and.
PACMAN Error Inventory OUTLINE The PACMAN task The Inventory of contributors The Evaluation Method Critical Areas Outcome 08/10/2015 by Iordan Doytchinov.
R. Kass/W03 P416 Lecture 5 l Suppose we are trying to measure the true value of some quantity (x T ). u We make repeated measurements of this quantity.
Discriminative n-gram language modeling Brian Roark, Murat Saraclar, Michael Collins Presented by Patty Liu.
A Collapsed Variational Bayesian Inference Algorithm for Latent Dirichlet Allocation Yee W. Teh, David Newman and Max Welling Published on NIPS 2006 Discussion.
Chapter 12 Case Studies Part B. Control System Design.
Clustering (2) Center-based algorithms Fuzzy k-means Density-based algorithms ( DBSCAN as an example ) Evaluation of clustering results Figures and equations.
Chapter 16 Adaptive Filter Implementation
Integration and alignment of ATLAS SCT
In-Situ Filter Testing
Probabilistic Models for Linear Regression
Inverse Transformation Scale Experimental Power Graphing
Segmentation Using Metropolis Algorithm
Problem statement Given: a set of unknown parameters
Gaussian Mixture Models And their training with the EM algorithm
Motion Models (cont) 2/16/2019.
Let’s do a Bayesian analysis
Echidna: current status and expected performance
Parametric Methods Berlin Chen, 2005 References:
Chapter 8: Estimating With Confidence
Using Clustering to Make Prediction Intervals For Neural Networks
Lesson 3. Controlling program flow. Loops. Methods. Arrays.
Presentation transcript:

PFS setup timing model Peter Mao

WARNING This is a toy model. It is intended to promote discussion of PFI setup time trades. Assume that all parameters and assumptions made here were pulled from thin air.

Timing diagram (schematic) close shutter, read out CCD telescope slew/settle cobra anti-home, cobra scan to home w/ MC integration MC readout, calibration, centroiding calculate distortion map Cobra move MC integrate MC readout, calibration, centroiding ID centroids, calc SF PFI(x,y) transfer new targets iteration sequence report final status to OBCP/SOSS ASIAA JPL Caltech Other repeat done

Positioning error model Presently, derived from C.Fisher’s 2008 data on Cobra convergence. The calibrated (red) curve has a functional dependence: d = d (n) with d = distance in microns, interpreted as the 1 stdev distance in a 2D gaussian distribution. and n = iteration This is used to calculate – 1. the Cobra move time – 2. the MC integration time – 3. the number of (un)finished fibers

Cobra move time move time should be a function of the distance error. probably a linear function. INPUTS: – positioning error (d) [microns] – miminum move time (default: 0.01 sec) INTERNAL PARAMETERS: – Cobra velocity (5000 microns/sec) This should really be sorted out in (θ,ϕ) space, not in cartesian coords. For initial moves, the angular velocity is 2π rad/sec. When angular errors are smaller (< 10 deg) cobra moves at π/2 rad/sec. High velocity is likely only used for the first two iterations. – Assume Cobras are moved in 5 groups. FUNCTION – t = (t min < d/v) * 5

Cobra move time vs. step #

MC integration time integration time should scale inversely with required accuracy required accuracy should be proportional to distance error (of the next step) INPUTS: – MC allowed position error [function of cobra position error] using d/10 for now. – seeing limit [in microns now, but should be in arcsec] – integration time at seeing limit [default = 10 sec] – minimum exposure time (default = 0.1 sec) FUNCTION – C = d seeing * t seeing – d MC = (d seeing < d cobra /10) – t MC = (t min < C/d MC )

MC integration time vs. step # and positioning error

# finished fibers Assume that SF locations are Gaussian- distributed about the desired position, and that the position error, d, is the standard-deviation of that distribution. INPUTS – position error [d = d(iteration step)] – number of science fibers – error budget allocation for SF location (d max ) N fibers_on = floor(N SF * (1 – exp(-0.5 * (d max /d(n)) 2 ) N SF = N fibers_on + N fibers_off

Science fiber positioning success vs step #

Sample output Study of fiber efficiency vs. MC integration time at seeing limit. Based on timing model: – giving up 27 fibers breaks even if the MC integration time at the seeing limit drops by ~5 seconds. – up to 5 seconds, the MC integration time is a subdominant factor in observing efficiency. Trade can be calculated for any variable in the timing model dBη = 10 log 10 (η) η = (# observed)/(max observable) 1 Fiducial fiber = 0.8 Science fibers

Loose ends Cobra timing models needs to be updated MC timing model needs input from ASIAA Setup excecution sequence will evolve during development All parameters need to be vetted.