Determining the Robot-to-Robot Relative Pose Using Range-only Measurements
|
|
- Alicia Harrell
- 6 years ago
- Views:
Transcription
1 Deterining the Robot-to-Robot Relative Pose Using Range-only Measureents Xun S Zhou and Stergios I Roueliotis Abstract In this paper we address the proble of deterining the relative pose of pairs robots that ove on a plane while easuring the distance to each other We show that the iniu nuber of distance easureents required for the degrees of freedo robot-to-robot transforation to becoe locally observable is Furtherore, we prove that the axiu nuber of possible solutions in this case is, while a iniu of distance easureents is necessary in order to uniquely deterine the robots relative pose Finally, we present efficient algoriths for coputing all possible solutions and evaluate the validity of our theoretical results both in siulation and experientally I INTRODUCTION AND RELATED WORK In order to solve distributed estiation probles such as cooperative localization, apping, and tracking, robots first need to deterine their relative position and orientation (pose) This initial calibration process is necessary for coordinating a robot tea and registering easureents to the sae frae of reference Since the accuracy of the relative (robot-to-robot) transforation can significantly affect the quality of a sensor fusion task (eg, tracking a target using observations fro ultiple sensors), it needs to be deterined precisely Mobile robots that ove on a plane and use distance and bearing sensors (eg, laser scanners, stereo caeras) can uniquely deterine their relative pose by processing distance and relative bearing easureents ] However, due to cost, power, and processing constraints, robots often have to rely on sensors that provide only distance easureents In these cases alternative algoriths and otion strategies are necessary in order to deterine the unknown robot-to-robot transforation Most current research on applications of range sensing has focused on designing algoriths that process distance easureents to deterine only the position of each node in a static network of sensors ], or the position and orientation of a obile robot when static beacons are deployed within an area of interest ] In the case of networks of sensors, a variety of algoriths based on convex optiization ] and Multi Diensional Scaling (MDS) ], have been eployed to localize the sensor nodes Additionally, distributed approaches that reduce the counication requireents and better balance the coputational load aong sensors have also received significant attention in the related literature (eg, ], 7]) In all these cases, the objective is to deterine only the position of the sensor nodes with respect to anchor This work was supported by the University of Minnesota (DTC), the NASA Mars Technology Progra (MTP-), and the National Science Foundation (EIA-8, IIS-8) Xun S Zhou and Stergios I Roueliotis are with Departent of Coputer Science and Engineering, University of Minnesota, Minneapolis, MN, USA {zhou stergios}@csunedu R (t ) R (t ) R (t ) R (t ) R (t ) R (t ) R (t ) R (t ) Fig A siplistic approach to deterine an initial estiate for the robot-to-robot relative transforation using distance easureents The dark (light) triangles denote the location of robot R (R ), and t i, t ij, i, j {, } indicate the tie step(s) that a robot reains at a certain location nodes that can globally localize via GPS easureents Siilarly, in the case of obile robots the ephasis is on using distance easureents to localize robots with respect to static beacons ], for exaple, and not on coputing the relative pose of the robots However, deterining the robot-to-robot transforation is a prerequisite for efficiently coordinating the otion of teas of robots and expressing easureents in a coon frae of reference The proble we are interested in is that of directly coputing the degrees-of-freedo (dof) transforation between cooperating robots using distance easureents Specifically, we consider pairs of robots equipped with odoetric sensors for tracking their otion and a range sensor for easuring the distance to each other In this case, if no prior inforation about their relative position and orientation is available, a huan operator will need to anually easure the transforation between the two robots before they can be deployed to perfor their assigned task This tedious process, however, liits the accuracy of the robot-to-robot transforation and increases the cost of deploying large teas of robots due to the tie and effort required A straightforward approach to autoating this initial calibration process is for the robots to ove randoly, collect distance easureents, and then copute their relative transforation using an iterative least squares algorith The proble in this case is that any iterative process applied to iniize the non-linear, in the unknown variables, cost function relies on the existence of an accurate initial estiate in order to converge to the correct solution Additionally, since the iniu nuber of range easureents necessary is not known a priori, a conservative strategy would require the robots to spend excessive tie and energy easuring The extension to the proble of ultiple robot teas is straightforward once a solution to the pair-wise proble is deterined
2 their distance nuerous ties Instead it would be beneficial for the robots to follow a two-step process: (i) Eploy a non-iterative algorith to process the iniu nuber of distance easureents required to copute an initial estiate of their relative transforation (ii) Apply iterative least squares to refine this initial estiate using additional range easureents This second step can be repeated until the user-specified level of accuracy is reached A siplistic ethod to copute an initial estiate for the dof transforation would require the robots to follow a sequence of coordinated otions and easure distances to each other at certain locations and tie instants Specifically, as shown in Fig, if robot R reains static while R easures its distance to R at different locations (tie instants t, t, and t ), the position of R with respect to R can be uniquely deterined In order to also copute their relative orientation, robot R will need to ove to a new location and reain again static till robot R records another distance easureents (tie instants t, t, and t ) and triangulates the new relative position of robot R Using these inferred relative position easureents and knowing the direction of otion of R (coputed fro its own odoetry), the relative orientation between the robots can be uniquely deterined The ain drawback of this approach is that it requires tight coordination between the robots for perforing the sequence of necessary otions and recording the distance easureents at the appropriate locations Additionally, this initial calibration phase delays the onset of the actual robot task which can be detriental in tie-critical situations involving large robot teas In this paper, we address this proble by developing noniterative algoriths for coputing the initial estiate of the dof robot-to-robot transforation without restricting their otion Specifically, we prove that when robots ove randoly and collect distance easureents at different locations, the axiu nuber of possible solutions is (cf Lea, Section II) When range easureents are available, we show that there can exist no ore than solutions (cf Lea, Section III) Furtherore, in Section IV (cf Lea ) we prove that the iniu nuber of distance easureents necessary in order to uniquely deterine the relative pose of the robots is (instead of based on the siplistic ethod outlined in Fig ) Efficient algoriths for coputing all possible solutions for the cases described above are presented Additionally, we provide a novel linear algorith for deterining the unique solution (ie, when range easureents are available) that iniizes the nuerical error in the coputed transforation (cf Section IV-B) In Section V, we describe the iterative least squares algorith that uses additional range easureents to refine the initial estiate for the unknown robot-to-robot transforation Finally, in Section VI, we present siulation and experiental results that verify the validity of our theoretical analysis II DETERMINING THE RELATIVE POSE FROM DISTANCE MEASUREMENTS: AT MOST SOLUTIONS Consider two robots R and R whose initial poses are indicated by the fraes of reference {} and {} respectively (cf Fig ) The two robots ove randoly {} ρ =d θ φ {} p p {} {} p {} d d p {} Fig The trajectories of robots R and R The odd (even) nubered fraes of reference depict the consecutive poses of robot R (R ) d ij, i {,,n }, j {,,n} denotes the distance between the two robots when aligned to fraes {i} and {j} respectively through a sequence of poses {}, {},,{n } for R, and {}, {},,{n} for R and easure their distance d ij, i {,,n }, j {,,n} at each of these locations Additionally, the robots are equipped with odoetric sensors for estiating their poses with respect to their initial fraes of reference That is, robot R estiates the position vectors p,, p n and the angles φ,, φ n necessary for deterining the rotational atrices C,, n C Siilarly the quantities p,, p n and φ,, φ n (and hence C,, nc) are estiated by robot R fro its own odoetry Our goal is to use the odoetry-based estiates and the n distance easureents to deterine the axiu nuber of solutions for the dof relative transforation between the two robots, ie, their relative position p and orientation φ = φ, or equivalently θ and φ, with ] cθ p = ρ sθ, C = cφ ] sφ sφ cφ Note that ρ = d is easured and consider known We first address the case when n = distance easureents (d, d, and d ) are available and prove the following lea: Lea : Given distance easureents between the two robots at different locations, the axiu nuber of possible solutions for the dof robot-to-robot transforation is We proceed by substituting the geoetric relations for the position vectors p, p (cf Fig ) () p = C T ( p + C p p ) () p = C T ( p + C p p ) () in the following expressions for the distance easureents d and d, respectively: d = p T p, d = p T p () Without loss of generality, we assue that only one of the robots records range easureents at each location If both robots easure the sae distance, the two easureents can be cobined to provide a ore accurate estiate of their distance Fro here on we use the concatenated fors cα and sα to denote the sin and cos functions of a real nuber α
3 After rearranging ters and substituting ρ = d for p T p, these can be written as: (d ρ p T p p T p )= ( p p ) T C p p T p () (d ρ p T p p T p )= ( p p ) T C p p T p () Note that the quantities on the left-hand side of these last two equations are known (easured or estiated), while the unknown variables θ and φ (ebedded in p and C) only appear in the right-hand side expressions Eqs () and () for a syste of non-linear equations in the unknowns θ and φ Applying standard nuerical techniques, such as Newton-Raphson 8], for solving this syste has a nuber of drawbacks Firstly, iterative processes often require a large nuber of steps before converging to a solution Secondly, in order for the algorith to converge to the correct answer, initial estiates close to the true values of the unknown variables need to be specified In practice, however, no such inforation is available; the only prior knowledge we have for θ and φ is that they lie within the interval, π) Furtherore, in the particular case where only n =distance easureents are available, the total nuber of solutions that need to be deterined is To copute all possible roots, the initial estiates for the unknowns θ and φ will need to span a wide range of values within the -diensional region, π), π) Such procedure would require a large nuber of initializations of the iterative process with no guarantees that all solutions will be coputed Instead we hereafter describe an eliination process to reove the quantities cθ, sφ, cφ fro the expression in Eqs () and () which results in a th order polynoial in the unknown variable y = sθ; all solutions of this polynoial can be deterined through efficient algoriths The idea behind this approach is siilar to the Gaussian Eliination in linear systes of equations Due to space liitations only the ain steps of this process are shown while reassignent of variables is used to preserve the clarity of presentation By substituting the displaceent estiates (known fro odoetry) for the two robots: ] ] ] ] a p =, a a p =, a b p = b b p = b in Eqs () and (), we have: (ρa cθ + ρa sθ a )cφ +(ρa sθ ρa cθ a 7 )sφ = a + ρ(a cθ + a sθ) (7) (ρb cθ + ρb sθ b )cφ +(ρb sθ ρb cθ b 7 )sφ = b + ρ(b cθ + b sθ) (8) with a (d ρ p T p p T p ) a a a + a a, a 7 a a a a b (d ρ p T p p T p ) b b b + b b, b 7 b b b b Eqs (7) and (8) can be written in a atrix for as: ] ] ] u v cφ w = v sφ w u (9) where u ρa cθ + ρa sθ a, v ρa sθ ρa cθ a 7 u ρb cθ + ρb sθ b, v ρb sθ ρb cθ b 7 w a + ρ(a cθ + a sθ), w b + ρ(b cθ + b sθ) Note that Eq (9), is linear in the unknowns cφ and sφ Solving for these two variables we have: ] cφ = ] v w v w () sφ det u w u w where, det = u v u v Substituting the above expressions for cφ and sφ in the trigonoetric constraint sφ +cφ =, results in a single equation in the variables cθ and sθ (v w v w ) +(u w u w ) =(u v u v ) (v + u )w +(v + u )w (v v + u u )w w =(u v u v ) () As described in 9], the ters v +u, v +u, v v +u u, and u v u v are all linear in cθ and sθ, while w, w, w w are all quadratic in the sae quantities Hence Eq () is a rd order polynoial in x cθ and y sθ, and can be written in the following sipler for: f = 9 x + 8 x y + 7 xy + x + xy + x+ y + y + y + = () where the constants,, 9 are functions of known quantities 9] The final step in the eliination process is to invoke the trigonoetric constraint f = x + y = () to eliinate x fro Eq () by using the Sylvester Resultant ] Specifically, by ultiplying Eq () with x, and Eq () with x and x and rewriting all these equations in a atrix for, we have: s s s s s s s s x x y y y where s y + y + y + s 7 y + y + s 8 y +, s 9 x x = () For the polynoials in Eqs () and () to have coon roots, the deterinant of the Sylvester atrix above ust be equal to zero It can be shown 9] that the deterinant is a th order polynoial in the single variable y: g = y + n y + n y + n y + n y + n y + n () where the constants n,,n are functions of the known quantities,, 9 Therefore, the axiu nuber of possible solutions, including coplex roots, is There are any standard ethods to copute the roots of a single variable polynoial ] Our approach is based on
4 the eigen-decoposition of the copanion atrix ]: n n n While this ethod will deterine all roots of the polynoial, only the real ones are of practical interest since they have a geoetric interpretation Once y is known, x is deterined by coputing the null space of the atrix in Eq () To prove our clai that there exist at ost solutions for (θ, φ), we need to show that for every solution of y (cf Eq ()), only one solution for x can be found (cf Eq ()) To do this, we need to use Groebner bases ] One base, g, is exactly the sae as the polynoial in Eq (), and g has the for g = x + k y + k y + k y + k y + k y + k where the constants k,,k are functions of the known quantities 9] Therefore, for every value of y there is only one solution of x corresponding to it In fact we can draw the sae conclusion without coputing the Groebner basis All we need to do is to show that the leading ter of g, LT(g ) is linear in x This can be easily seen by using the definition of a Groebner basis A set {g,,g s } I is a Groebner basis of an ideal I if and only if the leading ter of any eleent of I is divisible by one of the LT(g i ) We can construct one eleent q of the ideal I =< f,f > by setting q = f ( 9 x + 8 y + )f =( 7 9 )xy + (lower order ters) Since the leading ter LT(q)=( 7 9 )xy ust be divisible by LT(g ), the degree of x in LT(g ) has to be Equivalently, g is linear in x Hence, the total nuber of distinct solutions for (x, y) reains Finally, φ is uniquely deterined by back substitution of x = cθ and y = sθ in Eq () The total nuber of real roots in each case will depend on the robot trajectories A situation where real solutions exist is shown in Fig III DETERMINING THE RELATIVE POSE FROM DISTANCE MEASUREMENTS: AT MOST SOLUTIONS Consider now the case where the robots R and R continue their paths shown in Fig and ove to the new poses {7} and {8}, respectively, where they record an additional distance easureent d 78 We will prove the following: Lea : Given distance easureents between the two robots at different locations, the axiu nuber of possible solutions for the dof robot-to-robot transforation is We proceed in a siilar anner as for the case of distance easureents Specifically, the new position estiates for the two robots at the locations where they record their th distance easureent p 7 = e e ], p 8 = e e ] are related through the geoetric constraint (analogous to Eq ()): 7 p 8 = 7C T ( p + C p 8 p 7 ) () Substituting in the expression for the new distance easureent d 78 = 7 p T 8 7 p 8, results in the following equation: (d 78 ρ p T 8 p 8 p T 7 p 7 )= ( p p 7 ) T C p 8 p T p 7 (7) Following the sae algebraic process as in the previous section we have: (ρe cθ + ρe sθ e )cφ+(ρe sθ ρe cθ e 7 )sφ = e + ρ(e cθ + e sθ) (8) where e,e 7 are defined as before Rearranging Eqs (7), (8), and (8) in a atrix for, we have: u v w u v w cφ sφ = (9) u v w where the u i s, v i s, and w i s, i =,,, are functions of sθ, cθ, and known (easured or estiated) quantities For the above syste to have non-zero solutions, the deterinant of the coefficient atrix ust vanish, ie, (u v u v )w +(v u v u )w +(u v u v )w = Note that the ters u v u v, v u v u, and u v u v are again all linear in x cθ and y sθ and so are w, w, and w, which akes the above polynoial quadratic in x and y 9] Following the sae eliination procedure as in Section II, we arrive at a th order polynoial in y n y + n y + n y + n y + n = () where n,,n are known constants 9] In this case the axiu nuber of possible solutions for y is Once y is deterined, back-substitution allows us to deterine x Finally, sφ and cφ are retrieved by coputing the null space vector of the coefficient atrix in Eq (9) IV DETERMINING THE RELATIVE POSE FROM DISTANCE MEASUREMENTS: UNIQUE SOLUTION We now treat the case where the robots R and R ove again and arrive at the locations {9} and {}, respectively At that point, they record their th distance easureent d 9, and also have available the additional estiates for their positions p 9 and p We will first prove that in this case at ost one solution exists (Section IV-A) and then propose an efficient and robust algorith for coputing its value (Section IV-B) A Unique solution Lea : Given distance easureents between the robots at different locations, there exists at ost one solution for the dof robot-to-robot transforation Following the sae procedure as in Section II, we arrive at the following equations ( of these are the sae ones as
5 in Eq (9) and the th one is coputed in a siilar anner using the latest distance easureent): u i cφ + v i sφ = w i, i = () where the u i s, v i s, and w i s, are functions of cθ, sθ, and known constants 9] Choosing out of any of these equations, and using the eliination process detailed in Section II, we can derive polynoial equations each of th order in the unknown variable y = sθ: ξ,j y + + ξ,j y + ξ,j = () where the ξ i,j s, i, j =, are functions of easured and estiated quantities By rewriting these polynoials in atrix for, we have: ξ, ξ, y = ξ, ξ, y ξ, ξ, () Solving this linear syste of equations for the vector y = y y ] T, allows us to uniquely deterine the value of the unknown y Once y = sθ is uniquely deterined, the reaining unknowns, sθ, cφ, and sφ, can be coputed via back-substitution as in the previous two cases 9] B Efficient Coputation of the Unique Solution The approach for coputing the unique solution presented in the previous section, requires to repeat the eliination procedure of Section II ties In addition to being tie consuing, this ethod ay result in incorrect values for the robot-to-robot transforation or even fail due to the accuulation of nuerical errors In this section, we present an alternative approach based on a linear algorith that efficiently coputes the unique solution given distance easureents As described in Sections II, III, and IV-A, for each of the last distance easureents, d,,d 9,, we can write an equation siilar to Eq (7), repeated below after rearranging ters and renaing the known quantities α i,j s: α 7,j cφ + α,j sφ + α,j cθ + α,j sθ α,j c(θ φ) α,j s(θ φ)+α,j =, j = The unknowns in these equations are cφ, sφ, cθ, sθ, c(θ φ), s(θ φ) Rewriting the in a atrix for, we have cφ sφ α 7, α, cθ sθ = α 7, α, c(θ φ) Ax = s(θ φ) where A is the 7 coefficient atrix (known), and x is the unknown vector we want to solve for Once we have coputed the three vectors r, s, and t that span the null space of A, x can be written as: x = λ r + λ s + λ t () for soe scalars λ, λ, λ To deterine their values, we use the trigonoetric identities c φ + s φ =,c θ + s θ =,c (θ φ)+s (θ φ) = cθcφ + sθsφ = c(θ φ), sθcφ cθsφ = s(θ φ) () and λ r 7 + λ s 7 + λ t 7 = () where r 7, s 7, and t 7 denote the 7 th scalar eleents of vectors r, s, and t, respectively Substituting the corresponding eleents of x fro Eq (), in the constraints (), and eliinating λ using Eq (), we obtain the following syste of equations: λ β, β, λ λ λ β, β, λ = λ where β i,j s, i, j = and ε i s are functions of known quantities 9] This syste can be solved to uniquely deterine the unknown vector λ λ λ λ λ λ ] T Given the values of λ and λ, λ is coputed fro Eq () At this point the vector x (cf Eq ()) is uniquely deterined The unknown robot-to-robot transforation can be retrieved fro the first eleents of x V DETERMINING THE RELATIVE POSE FROM MORE THAN DISTANCE MEASUREMENTS When ore than distance easureents are available to the robots, their relative pose can be coputed with higher accuracy To do so we follow a two step procedure: (i) We process of these distance easureents to copute an initial estiate for the dof transforation (cf Section IV- B), (ii) We use this initial estiate in a weighted least squares algorith that processes all distance easureents available We hereafter describe the second step of this process Assue that the robots have recorded n distance easureents, which are used to for a syste of n nonlinear equations equivalent to Eq (7) Rearranging ters, these can be written in a copact for as ε ε h(x, u) = (7) where x = θ, φ] T is the vector of unknowns, and u = p T p T z T ] T is the vector of the known quantities: p = p T φ p T n φ n ] T estiated by robot R, p = p T φ p T n φ n ] T estiated by robot R, and z =d d (n )(n) ] T the distances easured by the robots Since p, p, and z are estiated or easured independently, the covariance atrix P of u has a block diagonal structure: P = P P R where P = E p p T ] (P = E p p T ])isthecovariance atrix for p ( p), and R = σd ij I n n is the covariance atrix for the noise in the distance easureents d ij, with σ dij denoting the standard deviation in each of the
6 TABLE I Given the estiate û of u (fro the robots odoetry and MEASUREMENTS CASE the recorded distance easureents) and the initial estiate Algorith IV-A Algorith IV-B ˆx of x coputed based on the ethod of the previous θ ean error (rad) 7 φ ean error (rad) section, the weighted least squares algorith coputes the θ error std (rad) 8 new estiate for x through the following iterative process: φ error std (rad) 9 97 ˆx κ+ = ˆx κ H T x (H u PH T u ) H x ] H T x (H u PH T u ) h(ˆx κ, û) where H x = h x x=ˆx κ, H u = h u Robot trajectories observed fro the overhead caera u=û 9 are the Jacobians of the nonlinear function h evaluated using 7 the current estiates for x and u The detailed expressions for these atrices are presented in 9] 8 At this point a coent is necessary on observability In order for the iterative least squares process to converge, the robot-to-robot transforation needs to be observable There exists a large nuber of singular configurations where the atrix H x looses rank (eg, when p = p and p = robot trajectory robot trajectory p ) In these cases, the robots will need to ove to distance easureent new locations and acquire additional range easureents A detailed study of the observability of the syste along with a list of cases when it becoes unobservable is presented Fig The trajectories of the two robots and the locations where distance in 9] easureents were recorded VI SIMULATION AND EXPERIMENTAL RESULTS ) Siulations: The purpose of our siulations is to verify the validity of the presented algoriths, and deonstrate the accuracy and robustness of the ethod presented in Section IV-B (vs that of Section IV-A) for coputing the relative pose of the two robots using distance easureents In our siulations we randoly generated trajectories for the robots and coputed the distances between the at distinct points The trajectories and distance easureents were generated as follows: (i) The two robots start at initial positions apart fro each other and record their first distance easureent (ii) Each robot rotates and oves approxiately towards a direction selected randoly fro a unifor distribution over, π) (iii) The robots record their distance easureent at the current position Steps (ii) and (iii) were repeated until distance easureents were collected While oving, the robots estiate their position and orientation independently based on their odoetric easureents In this case, the standard deviation of the noise in the robots linear and rotational velocity easureents was set to /sec and rad/sec, respectively The standard deviation of the noise in the distance easureents was c The solutions for the relative pose of the two robots were coputed using,, and distance easureents An exaple of the possible robot-to-robot transforations when distance easureents are available is shown in Fig In order to evaluate the accuracy of the ethod of Section IV-B copared to that of Section IV-A, we have coputed the ean error and the standard deviation for the unknown quantities θ, φ over trials These results are shownintablei As evident, both the ean value and the standard deviation of the error in the estiates coputed using Algorith IV- B, are significantly saller than those fro Algorith IV- A Furtherore, for higher values of easureent noise, Algorith IV-A fails to copute the correct solution in % of the cases copared to a % failure rate for Algorith IV- B Failure in this context is considered the case when the error in the estiate is larger than σ, where σ is obtained fro the diagonal eleents of the covariance atrix H T x (H u PH T u ) H x ] coputed subsequently using the iterative weighted least squares algorith ) Experients: For our experients we deployed two identical Pioneer II robots within an area of (cf Fig ) The robots estiated their poses with respect to their initial locations using linear and rotational velocity easureents fro their wheel-encoders An overhead caera ounted on the ceiling of the roo was used to provide ground truth for evaluating the errors in the coputed estiates Additionally, using the position easureents fro the caera, we were able to copute the distances between the and control their accuracy by adding noise in these easureents We have tested the algoriths presented in this work for the cases where - distance easureents were available to the robots In this experient, the standard deviation of the noise in the distance easureents was set to σ= The solutions with,, and distance easureents are shown in the first three coluns of Table II Note that for the case of or distance easureents, only the solutions which are closest to the true value (last colun, coputed using the caera) are included Finally, using as initial estiate the value of the relative pose coputed fro Algorith IV-B and distance easureents, we have tested the iterative least squares algorith for the case of distance easureents The coputed estiates in this case are shown in the th colun of Table II VII CONCLUSIONS AND FUTURE WORK In this paper, we presented efficient algoriths for solving the relative pose proble for pairs of robots oving on a plane using only robot-to-robot distance easureents Non-
7 robot trajectory robot trajectory robot trajectory robot trajectory robot trajectory robot trajectory (a) Solution (b) Solution (c) Solution robot trajectory robot trajectory robot trajectory robot trajectory robot trajectory robot trajectory (d) Solution (e) Solution (f) Solution Fig An experient with real solutions Solution is the true robot configuration The distance easureents are depicted by circles centered at robot R with radii equal to the distance to robot R at each location TABLE II RESULTS WITH,,, DISTANCE MEASUREMENTS No eas Ca θ (rad) φ (rad) iterative algoriths for coputing the initial estiate of the dof transforation were presented for the cases when, and distance easureents were available We have shown that the axiu nuber of solutions for the above cases are,, and respectively (ie, at least distance easureents are required to uniquely solve for the initial relative robot pose) Furtherore, we presented a novel linear algorith for coputing the unique solution that is robust to nuerical errors Finally, an iterative weighted least squares algorith was used to further refine the initial relative pose estiate provided by the non-iterative algorith Our approach does not require any robot coordination or specific otion strategies, thus increasing the flexibility of robot control One future extension of this work is the analysis of the relative robot transforation in D In this case, the transforation that we need to solve for has dof which akes the proble significantly ore challenging REFERENCES ] X S Zhou and S I Roueliotis, Multi-robot SLAM with unknown initial correspondence: The robot rendezvous case, in Proceedings of IEEE International Conference on Intelligent Robots and Systes, Beijing, China, Oct 9 -, pp ] P Bahl and V Padanabhan, Radar: An in-building RF-based user location and tracking syste, in Proceedings of the IEEE INFOCOM, Tel Aviv, Israel, March, pp ] J Djugash, S Singh, and P I Corke, Further results with localization and apping using range fro radio, in International Conference on Field and Service Robotics (FSR ), July ] L Doherty, K S J Pister, and L E Ghaoui, Convex position estiation in wireless sensor networks, in IEEE INFOCOM Proceedings Twentieth Annual Joint Conference of IEEE Coputer and Counications Societies, Anchorage, AK, April, pp ] Y Shang, W Rul, Y Zhang, and M P J Froherz, Localization fro ere connectivity, in Proceedings of the th ACM International Syposiu on Mobile Ad Hoc Networking and Coputing, Annapolis, MD, June, pp ] A Savvides, H Park, and M B Srivastava, The bits and flops of the n-hop ultilateration priitive for node localization probles, in Intl Workshop on Sensor Nets and Apps, Atlanta, GA, Sep, pp 7] J A Costa, N Patwari, and A O Hero, Distributed weightedultidiensional scaling for node localization in sensor networks, ACM Transactions on Sensor Networks, vol, no, pp 9, Feb 8] W Press, S Teukolsky, W Vetterling, and B Flannery, Nuerical Recipes in C Cabridge University Press, 988 9] X S Zhou and S I Roueliotis, Deterining the robot-torobot relative pose using range-only easureents, University of Minnesota, Minneapolis, MN, Tech Rep, May Online] Available: wwwcsunedu/ zhou/paper/distonlypdf ] A G Akritas, Sylvester s For of Resultant and the Matrix- Triangularization Subresultant PRS Method New York: Springer- Verlag, 99, pp ] D Nistér, An efficient solution to the five-point relative pose proble, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol, no, pp 7 77, June ] A Edelan and H Murakai, Polynoial roots fro copanion atrix eigenvalues, Matheatics of Coputation, vol, pp 7 77, 99 ] D Cox, J Little, and D O Shea, Ideals, Varieties, and Algoriths, nd ed Springer
Feature Extraction Techniques
Feature Extraction Techniques Unsupervised Learning II Feature Extraction Unsupervised ethods can also be used to find features which can be useful for categorization. There are unsupervised ethods that
More informationModel Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon
Model Fitting CURM Background Material, Fall 014 Dr. Doreen De Leon 1 Introduction Given a set of data points, we often want to fit a selected odel or type to the data (e.g., we suspect an exponential
More informationA note on the multiplication of sparse matrices
Cent. Eur. J. Cop. Sci. 41) 2014 1-11 DOI: 10.2478/s13537-014-0201-x Central European Journal of Coputer Science A note on the ultiplication of sparse atrices Research Article Keivan Borna 12, Sohrab Aboozarkhani
More informationCh 12: Variations on Backpropagation
Ch 2: Variations on Backpropagation The basic backpropagation algorith is too slow for ost practical applications. It ay take days or weeks of coputer tie. We deonstrate why the backpropagation algorith
More informationChapter 6 1-D Continuous Groups
Chapter 6 1-D Continuous Groups Continuous groups consist of group eleents labelled by one or ore continuous variables, say a 1, a 2,, a r, where each variable has a well- defined range. This chapter explores:
More informationExperimental Design For Model Discrimination And Precise Parameter Estimation In WDS Analysis
City University of New York (CUNY) CUNY Acadeic Works International Conference on Hydroinforatics 8-1-2014 Experiental Design For Model Discriination And Precise Paraeter Estiation In WDS Analysis Giovanna
More informationEffective joint probabilistic data association using maximum a posteriori estimates of target states
Effective joint probabilistic data association using axiu a posteriori estiates of target states 1 Viji Paul Panakkal, 2 Rajbabu Velurugan 1 Central Research Laboratory, Bharat Electronics Ltd., Bangalore,
More informationLecture 13 Eigenvalue Problems
Lecture 13 Eigenvalue Probles MIT 18.335J / 6.337J Introduction to Nuerical Methods Per-Olof Persson October 24, 2006 1 The Eigenvalue Decoposition Eigenvalue proble for atrix A: Ax = λx with eigenvalues
More informationKernel Methods and Support Vector Machines
Intelligent Systes: Reasoning and Recognition Jaes L. Crowley ENSIAG 2 / osig 1 Second Seester 2012/2013 Lesson 20 2 ay 2013 Kernel ethods and Support Vector achines Contents Kernel Functions...2 Quadratic
More informationSPECTRUM sensing is a core concept of cognitive radio
World Acadey of Science, Engineering and Technology International Journal of Electronics and Counication Engineering Vol:6, o:2, 202 Efficient Detection Using Sequential Probability Ratio Test in Mobile
More informationUniform Approximation and Bernstein Polynomials with Coefficients in the Unit Interval
Unifor Approxiation and Bernstein Polynoials with Coefficients in the Unit Interval Weiang Qian and Marc D. Riedel Electrical and Coputer Engineering, University of Minnesota 200 Union St. S.E. Minneapolis,
More informationSupplementary Material for Fast and Provable Algorithms for Spectrally Sparse Signal Reconstruction via Low-Rank Hankel Matrix Completion
Suppleentary Material for Fast and Provable Algoriths for Spectrally Sparse Signal Reconstruction via Low-Ran Hanel Matrix Copletion Jian-Feng Cai Tianing Wang Ke Wei March 1, 017 Abstract We establish
More informationRandomized Recovery for Boolean Compressed Sensing
Randoized Recovery for Boolean Copressed Sensing Mitra Fatei and Martin Vetterli Laboratory of Audiovisual Counication École Polytechnique Fédéral de Lausanne (EPFL) Eail: {itra.fatei, artin.vetterli}@epfl.ch
More informationCOS 424: Interacting with Data. Written Exercises
COS 424: Interacting with Data Hoework #4 Spring 2007 Regression Due: Wednesday, April 18 Written Exercises See the course website for iportant inforation about collaboration and late policies, as well
More informationa a a a a a a m a b a b
Algebra / Trig Final Exa Study Guide (Fall Seester) Moncada/Dunphy Inforation About the Final Exa The final exa is cuulative, covering Appendix A (A.1-A.5) and Chapter 1. All probles will be ultiple choice
More informationNon-Parametric Non-Line-of-Sight Identification 1
Non-Paraetric Non-Line-of-Sight Identification Sinan Gezici, Hisashi Kobayashi and H. Vincent Poor Departent of Electrical Engineering School of Engineering and Applied Science Princeton University, Princeton,
More informationDistributed Subgradient Methods for Multi-agent Optimization
1 Distributed Subgradient Methods for Multi-agent Optiization Angelia Nedić and Asuan Ozdaglar October 29, 2007 Abstract We study a distributed coputation odel for optiizing a su of convex objective functions
More informationThe Transactional Nature of Quantum Information
The Transactional Nature of Quantu Inforation Subhash Kak Departent of Coputer Science Oklahoa State University Stillwater, OK 7478 ABSTRACT Inforation, in its counications sense, is a transactional property.
More informationIAENG International Journal of Computer Science, 42:2, IJCS_42_2_06. Approximation Capabilities of Interpretable Fuzzy Inference Systems
IAENG International Journal of Coputer Science, 4:, IJCS_4 6 Approxiation Capabilities of Interpretable Fuzzy Inference Systes Hirofui Miyajia, Noritaka Shigei, and Hiroi Miyajia 3 Abstract Many studies
More informationŞtefan ŞTEFĂNESCU * is the minimum global value for the function h (x)
7Applying Nelder Mead s Optiization Algorith APPLYING NELDER MEAD S OPTIMIZATION ALGORITHM FOR MULTIPLE GLOBAL MINIMA Abstract Ştefan ŞTEFĂNESCU * The iterative deterinistic optiization ethod could not
More informationChaotic Coupled Map Lattices
Chaotic Coupled Map Lattices Author: Dustin Keys Advisors: Dr. Robert Indik, Dr. Kevin Lin 1 Introduction When a syste of chaotic aps is coupled in a way that allows the to share inforation about each
More informationA Self-Organizing Model for Logical Regression Jerry Farlow 1 University of Maine. (1900 words)
1 A Self-Organizing Model for Logical Regression Jerry Farlow 1 University of Maine (1900 words) Contact: Jerry Farlow Dept of Matheatics Univeristy of Maine Orono, ME 04469 Tel (07) 866-3540 Eail: farlow@ath.uaine.edu
More informationSupport Vector Machine Classification of Uncertain and Imbalanced data using Robust Optimization
Recent Researches in Coputer Science Support Vector Machine Classification of Uncertain and Ibalanced data using Robust Optiization RAGHAV PAT, THEODORE B. TRAFALIS, KASH BARKER School of Industrial Engineering
More informationHybrid System Identification: An SDP Approach
49th IEEE Conference on Decision and Control Deceber 15-17, 2010 Hilton Atlanta Hotel, Atlanta, GA, USA Hybrid Syste Identification: An SDP Approach C Feng, C M Lagoa, N Ozay and M Sznaier Abstract The
More informationHIGH RESOLUTION NEAR-FIELD MULTIPLE TARGET DETECTION AND LOCALIZATION USING SUPPORT VECTOR MACHINES
ICONIC 2007 St. Louis, O, USA June 27-29, 2007 HIGH RESOLUTION NEAR-FIELD ULTIPLE TARGET DETECTION AND LOCALIZATION USING SUPPORT VECTOR ACHINES A. Randazzo,. A. Abou-Khousa 2,.Pastorino, and R. Zoughi
More informationSupport recovery in compressed sensing: An estimation theoretic approach
Support recovery in copressed sensing: An estiation theoretic approach Ain Karbasi, Ali Horati, Soheil Mohajer, Martin Vetterli School of Coputer and Counication Sciences École Polytechnique Fédérale de
More informationTopic 5a Introduction to Curve Fitting & Linear Regression
/7/08 Course Instructor Dr. Rayond C. Rup Oice: A 337 Phone: (95) 747 6958 E ail: rcrup@utep.edu opic 5a Introduction to Curve Fitting & Linear Regression EE 4386/530 Coputational ethods in EE Outline
More informationSeismic Analysis of Structures by TK Dutta, Civil Department, IIT Delhi, New Delhi.
Seisic Analysis of Structures by K Dutta, Civil Departent, II Delhi, New Delhi. Module 5: Response Spectru Method of Analysis Exercise Probles : 5.8. or the stick odel of a building shear frae shown in
More informationAn Improved Particle Filter with Applications in Ballistic Target Tracking
Sensors & ransducers Vol. 72 Issue 6 June 204 pp. 96-20 Sensors & ransducers 204 by IFSA Publishing S. L. http://www.sensorsportal.co An Iproved Particle Filter with Applications in Ballistic arget racing
More informationAlgorithms for parallel processor scheduling with distinct due windows and unit-time jobs
BULLETIN OF THE POLISH ACADEMY OF SCIENCES TECHNICAL SCIENCES Vol. 57, No. 3, 2009 Algoriths for parallel processor scheduling with distinct due windows and unit-tie obs A. JANIAK 1, W.A. JANIAK 2, and
More informationESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS. A Thesis. Presented to. The Faculty of the Department of Mathematics
ESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS A Thesis Presented to The Faculty of the Departent of Matheatics San Jose State University In Partial Fulfillent of the Requireents
More informationIntroduction to Robotics (CS223A) (Winter 2006/2007) Homework #5 solutions
Introduction to Robotics (CS3A) Handout (Winter 6/7) Hoework #5 solutions. (a) Derive a forula that transfors an inertia tensor given in soe frae {C} into a new frae {A}. The frae {A} can differ fro frae
More informationA Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness
A Note on Scheduling Tall/Sall Multiprocessor Tasks with Unit Processing Tie to Miniize Maxiu Tardiness Philippe Baptiste and Baruch Schieber IBM T.J. Watson Research Center P.O. Box 218, Yorktown Heights,
More informationRobustness Experiments for a Planar Hopping Control System
To appear in International Conference on Clibing and Walking Robots Septeber 22 Robustness Experients for a Planar Hopping Control Syste Kale Harbick and Gaurav S. Sukhate kale gaurav@robotics.usc.edu
More informationDepartment of Electronic and Optical Engineering, Ordnance Engineering College, Shijiazhuang, , China
6th International Conference on Machinery, Materials, Environent, Biotechnology and Coputer (MMEBC 06) Solving Multi-Sensor Multi-Target Assignent Proble Based on Copositive Cobat Efficiency and QPSO Algorith
More informationWarning System of Dangerous Chemical Gas in Factory Based on Wireless Sensor Network
565 A publication of CHEMICAL ENGINEERING TRANSACTIONS VOL. 59, 07 Guest Editors: Zhuo Yang, Junie Ba, Jing Pan Copyright 07, AIDIC Servizi S.r.l. ISBN 978-88-95608-49-5; ISSN 83-96 The Italian Association
More informationREDUCTION OF FINITE ELEMENT MODELS BY PARAMETER IDENTIFICATION
ISSN 139 14X INFORMATION TECHNOLOGY AND CONTROL, 008, Vol.37, No.3 REDUCTION OF FINITE ELEMENT MODELS BY PARAMETER IDENTIFICATION Riantas Barauskas, Vidantas Riavičius Departent of Syste Analysis, Kaunas
More informationUsing a De-Convolution Window for Operating Modal Analysis
Using a De-Convolution Window for Operating Modal Analysis Brian Schwarz Vibrant Technology, Inc. Scotts Valley, CA Mark Richardson Vibrant Technology, Inc. Scotts Valley, CA Abstract Operating Modal Analysis
More informationOptimal Jamming Over Additive Noise: Vector Source-Channel Case
Fifty-first Annual Allerton Conference Allerton House, UIUC, Illinois, USA October 2-3, 2013 Optial Jaing Over Additive Noise: Vector Source-Channel Case Erah Akyol and Kenneth Rose Abstract This paper
More informationTele-Operation of a Mobile Robot Through Haptic Feedback
HAVE 00 IEEE Int. Workshop on Haptic Virtual Environents and Their Applications Ottawa, Ontario, Canada, 7-8 Noveber 00 Tele-Operation of a Mobile Robot Through Haptic Feedback Nicola Diolaiti, Claudio
More informationA Simplified Analytical Approach for Efficiency Evaluation of the Weaving Machines with Automatic Filling Repair
Proceedings of the 6th SEAS International Conference on Siulation, Modelling and Optiization, Lisbon, Portugal, Septeber -4, 006 0 A Siplified Analytical Approach for Efficiency Evaluation of the eaving
More informationMulti-Dimensional Hegselmann-Krause Dynamics
Multi-Diensional Hegselann-Krause Dynaics A. Nedić Industrial and Enterprise Systes Engineering Dept. University of Illinois Urbana, IL 680 angelia@illinois.edu B. Touri Coordinated Science Laboratory
More informationA method to determine relative stroke detection efficiencies from multiplicity distributions
A ethod to deterine relative stroke detection eiciencies ro ultiplicity distributions Schulz W. and Cuins K. 2. Austrian Lightning Detection and Inoration Syste (ALDIS), Kahlenberger Str.2A, 90 Vienna,
More information13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices
CS71 Randoness & Coputation Spring 018 Instructor: Alistair Sinclair Lecture 13: February 7 Disclaier: These notes have not been subjected to the usual scrutiny accorded to foral publications. They ay
More informationW-BASED VS LATENT VARIABLES SPATIAL AUTOREGRESSIVE MODELS: EVIDENCE FROM MONTE CARLO SIMULATIONS
W-BASED VS LATENT VARIABLES SPATIAL AUTOREGRESSIVE MODELS: EVIDENCE FROM MONTE CARLO SIMULATIONS. Introduction When it coes to applying econoetric odels to analyze georeferenced data, researchers are well
More informationProc. of the IEEE/OES Seventh Working Conference on Current Measurement Technology UNCERTAINTIES IN SEASONDE CURRENT VELOCITIES
Proc. of the IEEE/OES Seventh Working Conference on Current Measureent Technology UNCERTAINTIES IN SEASONDE CURRENT VELOCITIES Belinda Lipa Codar Ocean Sensors 15 La Sandra Way, Portola Valley, CA 98 blipa@pogo.co
More informationLecture 9 November 23, 2015
CSC244: Discrepancy Theory in Coputer Science Fall 25 Aleksandar Nikolov Lecture 9 Noveber 23, 25 Scribe: Nick Spooner Properties of γ 2 Recall that γ 2 (A) is defined for A R n as follows: γ 2 (A) = in{r(u)
More informationLinear Transformations
Linear Transforations Hopfield Network Questions Initial Condition Recurrent Layer p S x W S x S b n(t + ) a(t + ) S x S x D a(t) S x S S x S a(0) p a(t + ) satlins (Wa(t) + b) The network output is repeatedly
More informationThe Methods of Solution for Constrained Nonlinear Programming
Research Inventy: International Journal Of Engineering And Science Vol.4, Issue 3(March 2014), PP 01-06 Issn (e): 2278-4721, Issn (p):2319-6483, www.researchinventy.co The Methods of Solution for Constrained
More informationarxiv: v1 [cs.ds] 29 Jan 2012
A parallel approxiation algorith for ixed packing covering seidefinite progras arxiv:1201.6090v1 [cs.ds] 29 Jan 2012 Rahul Jain National U. Singapore January 28, 2012 Abstract Penghui Yao National U. Singapore
More informationBipartite subgraphs and the smallest eigenvalue
Bipartite subgraphs and the sallest eigenvalue Noga Alon Benny Sudaov Abstract Two results dealing with the relation between the sallest eigenvalue of a graph and its bipartite subgraphs are obtained.
More informationIntroduction to Discrete Optimization
Prof. Friedrich Eisenbrand Martin Nieeier Due Date: March 9 9 Discussions: March 9 Introduction to Discrete Optiization Spring 9 s Exercise Consider a school district with I neighborhoods J schools and
More informationON THE TWO-LEVEL PRECONDITIONING IN LEAST SQUARES METHOD
PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY Physical and Matheatical Sciences 04,, p. 7 5 ON THE TWO-LEVEL PRECONDITIONING IN LEAST SQUARES METHOD M a t h e a t i c s Yu. A. HAKOPIAN, R. Z. HOVHANNISYAN
More informationConvex Programming for Scheduling Unrelated Parallel Machines
Convex Prograing for Scheduling Unrelated Parallel Machines Yossi Azar Air Epstein Abstract We consider the classical proble of scheduling parallel unrelated achines. Each job is to be processed by exactly
More informationPolygonal Designs: Existence and Construction
Polygonal Designs: Existence and Construction John Hegean Departent of Matheatics, Stanford University, Stanford, CA 9405 Jeff Langford Departent of Matheatics, Drake University, Des Moines, IA 5011 G
More informationIntelligent Systems: Reasoning and Recognition. Perceptrons and Support Vector Machines
Intelligent Systes: Reasoning and Recognition Jaes L. Crowley osig 1 Winter Seester 2018 Lesson 6 27 February 2018 Outline Perceptrons and Support Vector achines Notation...2 Linear odels...3 Lines, Planes
More informationEMPIRICAL COMPLEXITY ANALYSIS OF A MILP-APPROACH FOR OPTIMIZATION OF HYBRID SYSTEMS
EMPIRICAL COMPLEXITY ANALYSIS OF A MILP-APPROACH FOR OPTIMIZATION OF HYBRID SYSTEMS Jochen Till, Sebastian Engell, Sebastian Panek, and Olaf Stursberg Process Control Lab (CT-AST), University of Dortund,
More informationEfficient Filter Banks And Interpolators
Efficient Filter Banks And Interpolators A. G. DEMPSTER AND N. P. MURPHY Departent of Electronic Systes University of Westinster 115 New Cavendish St, London W1M 8JS United Kingdo Abstract: - Graphical
More informationNonmonotonic Networks. a. IRST, I Povo (Trento) Italy, b. Univ. of Trento, Physics Dept., I Povo (Trento) Italy
Storage Capacity and Dynaics of Nononotonic Networks Bruno Crespi a and Ignazio Lazzizzera b a. IRST, I-38050 Povo (Trento) Italy, b. Univ. of Trento, Physics Dept., I-38050 Povo (Trento) Italy INFN Gruppo
More informationPage 1 Lab 1 Elementary Matrix and Linear Algebra Spring 2011
Page Lab Eleentary Matri and Linear Algebra Spring 0 Nae Due /03/0 Score /5 Probles through 4 are each worth 4 points.. Go to the Linear Algebra oolkit site ransforing a atri to reduced row echelon for
More informationOptimal Resource Allocation in Multicast Device-to-Device Communications Underlaying LTE Networks
1 Optial Resource Allocation in Multicast Device-to-Device Counications Underlaying LTE Networks Hadi Meshgi 1, Dongei Zhao 1 and Rong Zheng 2 1 Departent of Electrical and Coputer Engineering, McMaster
More informationANALYSIS OF HALL-EFFECT THRUSTERS AND ION ENGINES FOR EARTH-TO-MOON TRANSFER
IEPC 003-0034 ANALYSIS OF HALL-EFFECT THRUSTERS AND ION ENGINES FOR EARTH-TO-MOON TRANSFER A. Bober, M. Guelan Asher Space Research Institute, Technion-Israel Institute of Technology, 3000 Haifa, Israel
More informationConvexity-Based Optimization for Power-Delay Tradeoff using Transistor Sizing
Convexity-Based Optiization for Power-Delay Tradeoff using Transistor Sizing Mahesh Ketkar, and Sachin S. Sapatnekar Departent of Electrical and Coputer Engineering University of Minnesota, Minneapolis,
More informationTesting Properties of Collections of Distributions
Testing Properties of Collections of Distributions Reut Levi Dana Ron Ronitt Rubinfeld April 9, 0 Abstract We propose a fraework for studying property testing of collections of distributions, where the
More informatione-companion ONLY AVAILABLE IN ELECTRONIC FORM
OPERATIONS RESEARCH doi 10.1287/opre.1070.0427ec pp. ec1 ec5 e-copanion ONLY AVAILABLE IN ELECTRONIC FORM infors 07 INFORMS Electronic Copanion A Learning Approach for Interactive Marketing to a Custoer
More informationSharp Time Data Tradeoffs for Linear Inverse Problems
Sharp Tie Data Tradeoffs for Linear Inverse Probles Saet Oyak Benjain Recht Mahdi Soltanolkotabi January 016 Abstract In this paper we characterize sharp tie-data tradeoffs for optiization probles used
More informationThe Weierstrass Approximation Theorem
36 The Weierstrass Approxiation Theore Recall that the fundaental idea underlying the construction of the real nubers is approxiation by the sipler rational nubers. Firstly, nubers are often deterined
More informationBlock designs and statistics
Bloc designs and statistics Notes for Math 447 May 3, 2011 The ain paraeters of a bloc design are nuber of varieties v, bloc size, nuber of blocs b. A design is built on a set of v eleents. Each eleent
More informationUse of PSO in Parameter Estimation of Robot Dynamics; Part One: No Need for Parameterization
Use of PSO in Paraeter Estiation of Robot Dynaics; Part One: No Need for Paraeterization Hossein Jahandideh, Mehrzad Navar Abstract Offline procedures for estiating paraeters of robot dynaics are practically
More informationInteractive Markov Models of Evolutionary Algorithms
Cleveland State University EngagedScholarship@CSU Electrical Engineering & Coputer Science Faculty Publications Electrical Engineering & Coputer Science Departent 2015 Interactive Markov Models of Evolutionary
More informationList Scheduling and LPT Oliver Braun (09/05/2017)
List Scheduling and LPT Oliver Braun (09/05/207) We investigate the classical scheduling proble P ax where a set of n independent jobs has to be processed on 2 parallel and identical processors (achines)
More informationLecture 21. Interior Point Methods Setup and Algorithm
Lecture 21 Interior Point Methods In 1984, Kararkar introduced a new weakly polynoial tie algorith for solving LPs [Kar84a], [Kar84b]. His algorith was theoretically faster than the ellipsoid ethod and
More informationConstrained Consensus and Optimization in Multi-Agent Networks arxiv: v2 [math.oc] 17 Dec 2008
LIDS Report 2779 1 Constrained Consensus and Optiization in Multi-Agent Networks arxiv:0802.3922v2 [ath.oc] 17 Dec 2008 Angelia Nedić, Asuan Ozdaglar, and Pablo A. Parrilo February 15, 2013 Abstract We
More informationVulnerability of MRD-Code-Based Universal Secure Error-Correcting Network Codes under Time-Varying Jamming Links
Vulnerability of MRD-Code-Based Universal Secure Error-Correcting Network Codes under Tie-Varying Jaing Links Jun Kurihara KDDI R&D Laboratories, Inc 2 5 Ohara, Fujiino, Saitaa, 356 8502 Japan Eail: kurihara@kddilabsjp
More informationDepartment of Physics, Sri Venkateswara University, Tirupati Range Operations, Satish Dhawan Space Centre SHAR, ISRO, Sriharikota
Trajectory Estiation of a Satellite Launch Vehicle Using Unscented Kalan Filter fro Noisy Radar Measureents R.Varaprasad S.V. Bhaskara Rao D.Narayana Rao V. Seshagiri Rao Range Operations, Satish Dhawan
More informationThe Solution of One-Phase Inverse Stefan Problem. by Homotopy Analysis Method
Applied Matheatical Sciences, Vol. 8, 214, no. 53, 2635-2644 HIKARI Ltd, www.-hikari.co http://dx.doi.org/1.12988/as.214.43152 The Solution of One-Phase Inverse Stefan Proble by Hootopy Analysis Method
More informationSupplementary to Learning Discriminative Bayesian Networks from High-dimensional Continuous Neuroimaging Data
Suppleentary to Learning Discriinative Bayesian Networks fro High-diensional Continuous Neuroiaging Data Luping Zhou, Lei Wang, Lingqiao Liu, Philip Ogunbona, and Dinggang Shen Proposition. Given a sparse
More informationTEST OF HOMOGENEITY OF PARALLEL SAMPLES FROM LOGNORMAL POPULATIONS WITH UNEQUAL VARIANCES
TEST OF HOMOGENEITY OF PARALLEL SAMPLES FROM LOGNORMAL POPULATIONS WITH UNEQUAL VARIANCES S. E. Ahed, R. J. Tokins and A. I. Volodin Departent of Matheatics and Statistics University of Regina Regina,
More informationFairness via priority scheduling
Fairness via priority scheduling Veeraruna Kavitha, N Heachandra and Debayan Das IEOR, IIT Bobay, Mubai, 400076, India vavitha,nh,debayan}@iitbacin Abstract In the context of ulti-agent resource allocation
More informationNeural Network-Aided Extended Kalman Filter for SLAM Problem
7 IEEE International Conference on Robotics and Autoation Roa, Italy, -4 April 7 ThA.5 Neural Network-Aided Extended Kalan Filter for SLAM Proble Minyong Choi, R. Sakthivel, and Wan Kyun Chung Abstract
More informationA new type of lower bound for the largest eigenvalue of a symmetric matrix
Linear Algebra and its Applications 47 7 9 9 www.elsevier.co/locate/laa A new type of lower bound for the largest eigenvalue of a syetric atrix Piet Van Mieghe Delft University of Technology, P.O. Box
More informationSymbolic Analysis as Universal Tool for Deriving Properties of Non-linear Algorithms Case study of EM Algorithm
Acta Polytechnica Hungarica Vol., No., 04 Sybolic Analysis as Universal Tool for Deriving Properties of Non-linear Algoriths Case study of EM Algorith Vladiir Mladenović, Miroslav Lutovac, Dana Porrat
More informationThe Simplex Method is Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate
The Siplex Method is Strongly Polynoial for the Markov Decision Proble with a Fixed Discount Rate Yinyu Ye April 20, 2010 Abstract In this note we prove that the classic siplex ethod with the ost-negativereduced-cost
More informationTorsion Experiment. Encoder #3 ( 3 ) Third encoder/disk for Model 205a only. Figure 1: ECP Torsion Experiment
Torsion Experient Introduction For the Torsion lab, there are two required experients to perfor and one extra credit assignent at the end. In experient 1, the syste paraeters need to be identified so that
More informationKernel based Object Tracking using Color Histogram Technique
Kernel based Object Tracking using Color Histogra Technique 1 Prajna Pariita Dash, 2 Dipti patra, 3 Sudhansu Kuar Mishra, 4 Jagannath Sethi, 1,2 Dept of Electrical engineering, NIT, Rourkela, India 3 Departent
More informationProjectile Motion with Air Resistance (Numerical Modeling, Euler s Method)
Projectile Motion with Air Resistance (Nuerical Modeling, Euler s Method) Theory Euler s ethod is a siple way to approxiate the solution of ordinary differential equations (ode s) nuerically. Specifically,
More informationMathematical Model and Algorithm for the Task Allocation Problem of Robots in the Smart Warehouse
Aerican Journal of Operations Research, 205, 5, 493-502 Published Online Noveber 205 in SciRes. http://www.scirp.org/journal/ajor http://dx.doi.org/0.4236/ajor.205.56038 Matheatical Model and Algorith
More informationAn Inverse Interpolation Method Utilizing In-Flight Strain Measurements for Determining Loads and Structural Response of Aerospace Vehicles
An Inverse Interpolation Method Utilizing In-Flight Strain Measureents for Deterining Loads and Structural Response of Aerospace Vehicles S. Shkarayev and R. Krashantisa University of Arizona, Tucson,
More information1 Bounding the Margin
COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #12 Scribe: Jian Min Si March 14, 2013 1 Bounding the Margin We are continuing the proof of a bound on the generalization error of AdaBoost
More informationThe Distribution of the Covariance Matrix for a Subset of Elliptical Distributions with Extension to Two Kurtosis Parameters
journal of ultivariate analysis 58, 96106 (1996) article no. 0041 The Distribution of the Covariance Matrix for a Subset of Elliptical Distributions with Extension to Two Kurtosis Paraeters H. S. Steyn
More informationA1. Find all ordered pairs (a, b) of positive integers for which 1 a + 1 b = 3
A. Find all ordered pairs a, b) of positive integers for which a + b = 3 08. Answer. The six ordered pairs are 009, 08), 08, 009), 009 337, 674) = 35043, 674), 009 346, 673) = 3584, 673), 674, 009 337)
More informationLeast Squares Fitting of Data
Least Squares Fitting of Data David Eberly, Geoetric Tools, Redond WA 98052 https://www.geoetrictools.co/ This work is licensed under the Creative Coons Attribution 4.0 International License. To view a
More informationInternational Scientific and Technological Conference EXTREME ROBOTICS October 8-9, 2015, Saint-Petersburg, Russia
International Scientific and Technological Conference EXTREME ROBOTICS October 8-9, 215, Saint-Petersburg, Russia LEARNING MOBILE ROBOT BASED ON ADAPTIVE CONTROLLED MARKOV CHAINS V.Ya. Vilisov University
More informationDetection and Estimation Theory
ESE 54 Detection and Estiation Theory Joseph A. O Sullivan Sauel C. Sachs Professor Electronic Systes and Signals Research Laboratory Electrical and Systes Engineering Washington University 11 Urbauer
More informationSOLUTIONS. PROBLEM 1. The Hamiltonian of the particle in the gravitational field can be written as, x 0, + U(x), U(x) =
SOLUTIONS PROBLEM 1. The Hailtonian of the particle in the gravitational field can be written as { Ĥ = ˆp2, x 0, + U(x), U(x) = (1) 2 gx, x > 0. The siplest estiate coes fro the uncertainty relation. If
More informationAn RIP-based approach to Σ quantization for compressed sensing
An RIP-based approach to Σ quantization for copressed sensing Joe-Mei Feng and Felix Kraher October, 203 Abstract In this paper, we provide new approach to estiating the error of reconstruction fro Σ quantized
More informationASSUME a source over an alphabet size m, from which a sequence of n independent samples are drawn. The classical
IEEE TRANSACTIONS ON INFORMATION THEORY Large Alphabet Source Coding using Independent Coponent Analysis Aichai Painsky, Meber, IEEE, Saharon Rosset and Meir Feder, Fellow, IEEE arxiv:67.7v [cs.it] Jul
More informationACTIVE VIBRATION CONTROL FOR STRUCTURE HAVING NON- LINEAR BEHAVIOR UNDER EARTHQUAKE EXCITATION
International onference on Earthquae Engineering and Disaster itigation, Jaarta, April 14-15, 8 ATIVE VIBRATION ONTROL FOR TRUTURE HAVING NON- LINEAR BEHAVIOR UNDER EARTHQUAE EXITATION Herlien D. etio
More informationFast Montgomery-like Square Root Computation over GF(2 m ) for All Trinomials
Fast Montgoery-like Square Root Coputation over GF( ) for All Trinoials Yin Li a, Yu Zhang a, a Departent of Coputer Science and Technology, Xinyang Noral University, Henan, P.R.China Abstract This letter
More informationExplicit solution of the polynomial least-squares approximation problem on Chebyshev extrema nodes
Explicit solution of the polynoial least-squares approxiation proble on Chebyshev extrea nodes Alfredo Eisinberg, Giuseppe Fedele Dipartiento di Elettronica Inforatica e Sisteistica, Università degli Studi
More information