PROBABILITY-BASED OPTIMAL PATH PLANNING FOR TWO-WHEELED MOBILE ROBOTS
|
|
- Jonah Cain
- 6 years ago
- Views:
Transcription
1 Poceedings of the ASME 215 Dynamic Systems and Contol Confeence DSCC215 Octobe 28-3, 215, Columbus, Ohio, USA DSCC PROBABILITY-BASED OPTIMAL PATH PLANNING FOR TWO-WHEELED MOBILE ROBOTS Jaeyeon Lee Depatment of Electical Engineeing Univesity of Texas at Dallas Richadson, Texas Wooam Pak Depatment of Mechanical Engineeing Univesity of Texas at Dallas Richadson, Texas ABSTRACT Most dynamic systems show uncetainty in thei behavio. Theefoe, a deteministic model is not sufficient to pedict the stochastic behavio of such systems. Altenatively, a stochastic model can be used fo bette analysis and simulation. By numeically integating the stochastic diffeential equation o solving the Fokke-Planck equation, we can obtain a pobability density function of the motion of the system. Based on this pobability density function, the path-of-pobability(pop) method fo path planning has been developed and veified in simulation. Howeve, thee ae ooms fo moe impovements and its pactical implementation has not been pefomed yet. This pape concens fomulation, simulation and pactical implementation of the path-of-pobability fo two-wheeled mobile obots. In this famewok, we define a new cost function which measues the aveaged tageting eo using oot-mean-squae (RMS), and iteatively minimize it to find an optimal path with the lowest tageting eo. The poposed algoithm is implemented and tested with a two-wheeled mobile obot fo pefomance veification. tual system is inevitable. One easy way to tackle this poblem is to apply the feedback contol, and a vaiety of contol methods ae used to compensate the associated eos. Nevetheless, it has been shown that we can include the stochastic effects in analysis and simulation of dynamic systems. This pape focuses on applying the stochastic effects into a path planning poblem. Along this line, the system uncetainty and stochasticity have been studies in many ways. The stochasticity was included in the theoetical model fo bette analysis as well as contol in [1 3]. Latombe et al. [4] developed a motion planning in an envionment with eos existing in contol and sensing. Alteovitz et al. [5] poposed a new motion planning algoithm fo a flexible medical needle with the consideation of system uncetainty. Thee exist a numbe of studies on path planning methods based on the stochastic model [6 11]. These methods geneate paths fo the system by seaching the highest pobability fo the system to each a taget. In othe wods, they find a path to maximize the pobability fo the system to each a taget. In authos pevious wok [12], we fistly used a tageting eo instead of pobability to find the best configuation of obot manipulato. Inspied by the wok in [12], this pape poposes a method to find an optimal path that minimizes the expected eo of the mobile obot position to the taget. Although the optimality in path planning can be defined in vaious ways, we define it using minimum of tageting eos in this pape. 1 Intoduction In modeling dynamic systems, it is common to ignoe the system uncetainty and use the deteministic model fo motion analysis, contol and simulation. The stochasticity of systems is easily ignoed in many cases when employing the deteministic model even if thee exists the stochasticity such as model eos and distubances in actual wold. Thee is no doubt that some amount of discepancy between a theoetical model and an ac- Even though the path-of-pobability(pop) method fo path geneation has been developed, impoved and veified with compute simulation [6 11], thee has not been implementation with actual hadwae. In this pape, we solve the path planning pob- 1 Copyight 215 by ASME
2 lem fo two-wheeled mobile obot with the tageting eo estimation. Additionally, we apply two impovement ideas fo the classical POP method and veify the algoithm with both compute simulation and actual expeiments with irobot Ceate. This pape is oganized as follows. In Section 2, we eview the stochasticity-based modeling fo the two-wheeled mobile obot. Two impovements of the classical POP fo the path geneation ae poposed in Section 3. Multiple simulations based on the poposed method and implementation with irobot Ceate ae povided in Sections 4 and 5, espectively. Finally, conclusion is given in Section 6. 2 Stochastic Modeling As a pio step to contol a mobile obot system, we need to have a efeence path that the obot should follow in path planning. Thee have been many eseach activities to obtain bette paths accoding to a couple of diffeent puposes. One example is the maximum pobability appoach [6]. Since the pobability of the system motion stems fom the stochasticity of the system, a mathematical model fo the system with the consideation of the stochasticity should be fistly obtained. In this section, we model a two-wheeled mobile obot with the stochasticity. 1 2 ρ(x,t) t n i, j=1 2 + n i=1 x i x j ( m k=1 (h i (x,t)ρ(x,t)) x i H ik H T k j ρ(x,t) )= (2) Fokke and Planck have found this theoy fistly and the advanced vesions wee intoduced in [13 16]. The analytic solution fo the pobability density function can be obtained by solving this Fokke-Planck equation [17] in pinciple. Howeve, getting a closed fom solution is challenging and sometimes impossible. Anothe way to obtain the pobability density function ρ(x,t) fom the SDE is to numeically integate the SDE (1) multiple times and build a histogam. This histogam epesents the pobability density function. The numeical integation of the SDE can be achieved by the Eule-Mauyama method [18]. The numeical integation fo the geneal SDE (1) can be given as [6, 12] 2.1 Stochastic diffeential equation As afoementioned, actual systems always contain a cetain amount of eos such as uncetainty, noise and distubance. We can include this stochastic effect into the theoetical model equation to expess motion of the system moe accuately by intoducing a stochastic diffeential equation (SDE). The SDE is able to contain the stochastic effects when it expesses actual system s behavio. The stochastic diffeential equation inr n is witten as whee x i+1 = x i + h(x i,t i ) t i + H(x i,t i ) W i, (3) x i = x(t i ), t i = t i+1 t i, W i = W(t i+1 ) W(t i ). dx(t) = h(x(t), t)dt + H(x(t), t)dw(t) (1) whee x R n and W R m. We can obtain this expession by petubing the deteministic system dx/dt = h(x, t) by noise o andom foce at evey time. The andom foce is denoted by W(t) that is a vecto of uncoelated Wiene pocesses with unit stength fo each dimension and a matix H R n m scales and couples these noises. The system vaiable x(t) can be obtained by integating the equation (1). Howeve, the integation esults will not be consistent evey time because of the stochastic tem. We can handle this issue by employing a pobability density function ρ(x, t) of x(t). One of the methods to obtain the pobability density function fom the SDE is to use the Fokke-Planck equation. This special patial diffeential equation govens the time evolution of the pobability density function. Fo the SDE in (1), the Fokke- Planck equation is witten as The simple update pocedue epesented by these equations is the Eule-Mauyama method. Since W(t) is the Wiene pocess, we can conside that W i is sampled fom a Gaussian distibution with zeo mean and vaiance t i, which means W i t i N(,1). 2.2 Stochastic model fo two-wheeled mobile obot Figue 1(a) shows schematic epesentation of a twowheeled mobile obot. The vaiables (x, y) and θ denote the position and the oientation of the obot, espectively. The distance between two wheels measued along the axis is L, the adius of the wheel is, the otation angle of the ight wheel otates is φ 1, and the otation angle of the left wheel otates is φ 2. Both angles ae measued counteclockwise viewed along the axis fom outside to the inside of the mobile obot. This model can be applied to most two-wheeled mobile obots including irobot Ceate. Accoding to the wok in [7], we can assume no-lateal-slip 2 Copyight 215 by ASME
3 stochastic effects ae applied to the angula velocities of the two wheels. (a) 3 Path Geneation with Stochasticity In this section, we define the tageting eo fo a system to each a taget and show its use fo the path planning of stochastic systems. The poposed method is applied to the two-wheeled mobile obot and then, finally, we will discuss potentials of the POP algoithm to be impoved fo bette pefomance. (b) FIGURE 1. (a) The kinematic model of the two-wheeled mobile obot [7] (b) Two-wheeled mobile obot (irobot Ceate) condition fo the infinitesimal motions of the two-wheeled mobile obot. The infinitesimal motions can be witten as dx 2 dy = cosθ 2 cosθ 2 sin θ 2 sinθ dθ L L ( dφ1 dφ 2 ). (4) To include the stochastic effects, we assume that the infinitesimal changes in wheel otation angles can be the fom of dφ i = ω i dt+ σdw i (5) whee dw i is the incement of unit stength Wiene pocesses, σ is the stength of the Wiene pocess. Let us define 2δ as the diffeence between the angula velocities of the two wheels such that ω 1 = ω + δ and ω 2 = ω δ. By adopting the stochastic behavio of the system, the infinitesimal motion in (4) can be ewitten as dx ω cosθ dy = ω sinθ dt dθ γ 2 +σ cosθ 2 cosθ 2 sinθ 2 sinθ L L ) ( dw1 dw 2 whee γ is 2δ/L. This equation (6) is able to expess the motion of the two-wheeled mobile obot with an assumption that the (6) 3.1 Path geneation with a new cost function To geneate a path fo a stochastic system, we can use the POP method. This method uses the pobability density function to decide the locally optimal intemediate paths. In the pevious implementations [6 11], the maximum pobability was pusued duing the path geneation. Theefoe, thei eseach focused on finding an optimal path with the maximum pobability to each a goal. Howeve accoding to [12], the tageting eo instead of tageting pobability is also a meaningful measue to detemine if the planning is successful. The tageting eo of stochastic systems can be evaluated using the pobability density function. We use this new measue as a cost function fo the POP method. Suppose that a andom vaiable X is dawn fom a pobability density function (PDF) ρ(x). The oot-mean-squae (RMS) distance is computed as L= 1 N N i (x i x d ) 2 σ 2 +(µ x d ) 2 whee x i is the i th sampled value, N is the numbe of samples, x d is the taget, and µ and σ 2 ae the mean and the vaiance of the PDF, espectively. We can modify this fomulation to ou poblem. Since the mobile obot exploes on 2D space and we ae focusing on the minimization of the cost, a new cost can be defined as L (µ x, µ y,σ x,σ y )=σ 2 x + σ 2 y +(µ x x d ) 2 +(µ y y d ) 2. Theefoe, the optimal path in this pape can be defined as a path with the minimum tageting RMS eo to each a goal. 3.2 Path geneation fo two-wheeled mobile obot This statistical appoach can be applied to the two-wheeled mobile obot to geneate the optimal path as follows. We fistly assume a simple input angula velocity ω = 1 with δ =. The obot will follow the intemediate path defined by angula velocity ω = 1 and δ = in a deteministic way duing a small 3 Copyight 215 by ASME
4 FIGURE 2. segments Pobability density functions with diffeent numbe of time peiod t. Then, in the sampling stage, we geneate multiple andom path samples fom the cuent intemediate state to a taget by applying stochasticity to obtain a pobability density function. We can calculate the cost that the futue path eaches the taget using this pobability density function. Similaly, we can test with othe inputs(ω,δ)=(1,±α) and(ω,δ)=(1,±β) to evaluate the cost function. Afte obtaining all five costs using five candidates fo δ, we compae the costs to find which intemediate path is the best one fo the next intemediate path in tems of the minimum tageting eo. One small path with which the futue path has the lowest tageting eo will be selected. The algoithm uns until a pe-defined total numbe of path segments ae obtained. Eventually, we can have an optimal path fom initial position to a goal location by stitching the chosen intemediate paths. In the simulation and implementation of this pape we suggest the following options fo each intemediate path s candidates. δ = α o β o o β o α. (7) The poposed algoithm will choose one optimal δ among candidates ( α, β,,β,α) by seaching the minimum tageting eo to each a goal. 3.3 Impoved POP method Accoding to the POP method, we choose the total numbe of path segments based on the distance between the initial position and the taget position befoe applying the POP method because the algoithm uns until the fixed numbe of intemediate paths ae obtained. Theefoe, we should caefully decide the numbe of intemediate paths to get a meaningful full path eaching a taget accuately. Othewise, the full path will not each the taget when the total length of the intemediate paths is too shot o the full path may pass ove the taget when the total length is too long. To ovecome this poblem, we geneate the andom path samples with shote and longe paths in the sampling stage. Fo example, we geneate the andom path samples with 9 and 11 segments as well as 1 segments in the case that we pe-defined total 1 path segments fo the POP method. Due to these two additional sampling sets (with 9 and 11 segments), the algoithm can estimate whethe the emained path segments is pope, shot, o long. Theefoe, the algoithm can actively adjust the length of segments. Figue 2 shows the pobability density function with thee diffeent numbes of the path segments when a system is moving fom (,) to the ight diection. The left PDF is geneated by total 9 segments, the middle PDF is geneated by total 1 segments, and the ight PDF is geneated by total 11 segments of the intemediate paths. Moeove, thee is anothe oom fo impovement of the POP algoithm. The idea is that we can iteatively update the optimal path. We geneate multiple candidates of the optimal full paths by epeatedly applying the POP algoithm and evaluate them using the RMS tageting eos. To do this, afte obtaining the fist optimal path (afte the 1st iteation is done), we apply the same algoithm again using the path that we obtained in the pevious iteation. We epeat this iteation until the esult conveges to cetain bounday. 4 Numeical Simulation In this section, we veify the poposed algoithm with compute simulation. Compaed to the classical POP algoithm, the simulation with the poposed method shows two impovements as mentioned in the pevious section. Fo each simulation case, we test the algoithm to geneate the optimal path with the lowest tageting eo with and without obstacles. The two-wheeled mobile obot stats to move at (,) fo evey simulation and all simulation paametes we used ae identical to the actual paametes of the irobot Ceate fo the pupose of consistency between simulation and actual implementation that will be given in the next section. 4.1 Simulation I : Active segments Figue 3 shows simulation esults of the poposed algoithm with and without obstacles. Fo the fist simulation without an obstacle in Figue 3(a), the taget point is at (38, 9). The POP algoithm is applied and the optimized path in tems of RMS eos to hit the taget is geneated. A full path is composed of 13 segments even though default numbe of total segments is set by 1. The numbe of segments is actively changed depending on the position of the goal duing the simulation. Fo each step to get the intemediate path, the algoithm evaluates five candidates of δ and selects one that bings the lowest RMS eo fo the obot to hit the taget. The empiical paametes ae selected as σ =.7 and 4 Copyight 215 by ASME
5 1 1 1st (E:28.39mm) 2nd (E:24.96mm) 3d (E:21.45mm) 4th (E:21.45mm) 5th (E:18.12mm) 6th (E:15.8mm) 7th (E:12.19mm) 8th (E:12.19mm) (a) (a) 1st (E:56.48mm) 2nd (E:44.98mm) 3d (E:37.53mm) 4d (E:22.93mm) (b) FIGURE 3. Path geneated by the POP method. (a) Path to taget a point (38,9) without obstacles. (b) Path to taget a point (385,- 3) with obstacles. The cicula obstacles ae placed at (12,2) and (285,-35) and thei adii ae 15mm (b) FIGURE 4. Path geneated by the iteation method. (a) Path to taget a point (38,7) without obstacles. (b) Path to taget a point (38,- 25) with obstacles. The cicula obstacles ae placed at (12,2) and (285,-35) and thei adii ae 15mm. δ =[.1,.5,.,.5,.1]. Figue 3(b) shows the second simulation esult with two obstacles. The taget point is at (385, 3) and two obstacles ae at (12, 2) and (285, 35). The stategy to avoid obstacles is to exclude the paths that ae ovelapped with the obstacles when geneating multiple andom path samples. Theefoe, the path geneated by this stategy intinsically avoids the obstacle. 4.2 Simulation II : Iteative method As afoementioned, we can update the path though the iteative application of the POP method. In this iteative appoach, the multiple andom path samples in the sampling stage ae geneated based on the pevious optimal path. We geneate a set of paths though the iteative application of the POP method until one of thee conditions is satisfied. The conditions ae : The cuent path segments ae moe than the past path segments. FIGURE 5. Test envionment. (2mm 4mm) The cuent tageting eo is highe than the past tageting eo. The numbe of iteation exceeds 5. Figue 4 shows the esult of the new path geneation with the iteative appoach. Figue 4(a) shows the optimal path geneation 5 Copyight 215 by ASME
6 1 1 Y FIGURE 6. Implementation of the algoithm with irobot Ceate (no obstacle). The same paametes fo the taget and obstacles as in Fig. 3(a) ae used X FIGURE 8. Implementation of the algoithm with irobot Ceate (no obstacle) with iteation appoach. The same paametes fo the taget and obstacles as in Fig. 4(a) ae used. 1 1 Y FIGURE 7. Implementation of the algoithm with irobot Ceate (obstacles). The same paametes fo the taget and obstacles as in Fig. 3(b) ae used X FIGURE 9. Implementation of the algoithm with irobot Ceate (obstacles). The same paametes fo the taget and obstacles as in Fig. 4(b) ae used. without obstacles. The optimal path fom the fist iteation is denoted by the blue staight line and the final iteation esult is denoted by the ed dotted line. The black dotted line denotes the paths obtained duing the iteation. Figue 4(b) shows the optimal path geneation esult with iteation with two cicula obstacles. With this iteation, the tageting eo deceases. 5 Implementation and Expeiments We implement the poposed algoithm with irobot Ceate based on the simulation esults to veify the algoithm with an actual hadwae system. The irobot Ceate is a cicula twowheeled mobile obot with appoximately 169mm adius, 88mm height and 2.9kg weight. Two wheels ae 3mm in adius and the distance between the two wheels is L=262mm. Figue 5 shows the test envionment with the irobot Ceate. The test aea epesented by the blue ectangle is the size of 4mm 2mm. The motion of the obot is captued by a camea. The white cicles epesent the obstacles. The obot moves and otates accoding to the esult of the poposed path planning algoithm fo each intemediate step. Diffeent fom the simulation, each intemediate position and oientation ae updated by the irobot s encode which means the actual values with noise ae employed. Figue 6 shows ou fist implementation test. This esult shows that the obot follows the optimal path with the lowest tageting eo to each the taget without obstacles. Note that this is an implementation of the fist simulation esult shown in Figue 3(a). The final tageting eo is measued as 51mm. Figue 7 shows an implementation test with two obstacles. The obot follows the optimal path with the lowest tageting eo with obstacles. Similaly, this is an implementation of the second simulation esult in Figue 3(b). The tageting eo is measued as 72mm. Additionally, we implement the iteative application. We make the obot follow the optimal path afte the iteation pocess is finished. In this pocess, the multiple andom path samples in the sampling stage ae geneated by the final optimal path that we obtained in the iteation pocess. Even though this implementation stategy doesn t mean that the obot always eaches to the taget with the minimum tageting eo, we can expect the 6 Copyight 215 by ASME
7 highe possibility to each the goal with the minimum RMS eo to hit the taget than the implementation without the iteative appoach. Figue 8 shows the implementation esult that eflects the simulation esult in Figue 4(a). The actual eo is slightly deceased to 45mm compaed to the implementation without iteation. The last esult shown in Figue 9 is implementation of the esult in Figue 4(b). The final tageting eo is measued as 65mm. Note that the eo in implementation is slightly lage than the simulation esult because we used actual intemediate position and otation values obtained by the intenal encode to calculate next intemediate path. In othe wods, we consideed the actual uncetainty fom the envionment to veify the poposed method in the actual implementation. Accoding to the implementations, we can guaantee the poposed algoithm can geneate the optimal path with espect to the lowest tageting eo in an envionment with and without obstacles. Additionally, we can veify that the impoved method with iteative appoach can possibly decease the tageting eo. Consequently, the poposed method shows the pefomance to makes an actual two wheeled mobile obot follow the optimal path with effective obstacle avoidance. 6 Conclusion In this pape, we impoved a path planning method to geneate optimal paths with the consideation of system stochasticity. Then, we applied it to an actual mobile obot platfom. The impoved algoithm geneates paths that minimize the tageting eo. To do this, we defined a new cost function by applying the oot-mean-squae eo to hit the taget, and adapt it in the path-of-pobability (POP) method. We also impoved the POP method by actively adjusting the numbe of intemediate paths so that the numbe of intemediate paths is automatically adjusted duing the optimal path geneation pocess. In addition, we modified the algoithm to opeate iteatively. This iteative appoach is justified by the fact that the POP algoithm finds only locally optimal answes with the fist iteation. We veified the pefomance of the path planning algoithm with simulation and actual implementation. We finally applied this theoetic appoach to the irobot Ceate and confimed that the algoithm woks successfully in path planning fo the two-wheeled mobile obot. Fo the futue, we will investigate othe types of citeia fo geneating optimal paths such as shotest paths and minimum tavel time. REFERENCES [1] White, P., Zykov, V., Bongad, J. C., and Lipson, H., 25. Thee dimensional stochastic econfiguation of modula obots.. In Robotics: Science and Systems, Cambidge, pp [2] Shah, S. K., Pahlajani, C. D., and Tanne, H. G., 211. Pobability of success in stochastic obot navigation with state feedback. In Intelligent Robots and Systems (IROS), 211 IEEE/RSJ Intenational Confeence on, IEEE, pp [3] Åstöm, K. J., 212. Intoduction to stochastic contol theoy. Couie Copoation. [4] Latombe, J.-C., Lazanas, A., and Shekha, S., Robot motion planning with uncetainty in contol and sensing. Atificial Intelligence, 52(1), pp [5] Alteovitz, R., Banicky, M., and Goldbeg, K., 28. Motion planning unde uncetainty fo image-guided medical needle steeing. The Intenational jounal of obotics eseach, 27(11-12), pp [6] Pak, W., Kim, J. S., Zhou, Y., Cowan, N. J., Okamua, A. M., and Chiikjian, G. S., 25. Diffusion-based motion planning fo a nonholonomic flexible needle model. In Robotics and Automation, 25. ICRA 25. Poceedings of the 25 IEEE Intenational Confeence on, IEEE, pp [7] Pak, W., Liu, Y., Zhou, Y., Moses, M., and Chiikjian, G. S., 28. Kinematic state estimation and motion planning fo stochastic nonholonomic systems using the exponential map. Robotica, 26(4), pp [8] Pak, W., Wang, Y., and Chiikjian, G. S., 29. The pathof-pobability algoithm fo steeing and feedback contol of flexible needles. The Intenational jounal of obotics eseach. [9] Lee, J., and Pak, W., 214. A pobability-based path planning method using fuzzy logic. In Intelligent Robots and Systems (IROS 214), 214 IEEE/RSJ Intenational Confeence on, IEEE, pp [1] Mason, R., and Budick, J. W., 22. Tajectoy planning using eachable-state density functions. In Robotics and Automation, 22. Poceedings. ICRA 2. IEEE Intenational Confeence on, Vol. 1, IEEE, pp [11] Lee, J., and Pak, W., 213. Design and path planning fo a spheical olling obot. In ASME 213 Intenational Mechanical Engineeing Congess and Exposition, Ameican Society of Mechanical Enginees, pp. V4AT4A28 V4AT4A28. [12] Lee, J., and Pak, W., 214. Motion planning fo a edundant obot manipulato with stochasticity in joints. In ASME 214 Intenational Design Engineeing Technical Confeences and Computes and Infomation in Engineeing Confeence, Ameican Society of Mechanical Enginees, pp. V5BT8A65 V5BT8A65. [13] Gadine, C. W., Handbook of stochastic methods, Vol. 3. Spinge Belin. [14] McConnell, J. R., and McConnell, J. R., 198. Rotational Bownian motion and dielectic theoy. Academic Pess London. [15] Risken, H., The Fokke-Planck equation: methods of solution and applications. Spinge Velag. [16] Van Kampen, N. G., Stochastic pocesses in physics 7 Copyight 215 by ASME
8 and chemisty, Vol. 1. Noth holland. [17] Chiikjian, G. S., 29. Stochastic diffeential equations. In Stochastic Models, Infomation Theoy, and Lie Goups, Volume 1. Spinge, pp [18] Higham, D. J., 21. An algoithmic intoduction to numeical simulation of stochastic diffeential equations. SIAM eview, 43(3), pp Copyight 215 by ASME
Insertion planning for steerable flexible needles reaching multiple planar targets
2013 IEEE/RSJ Intenational Confeence on Intelligent Robots and Systems (IROS) Novembe 3-7, 2013. Tokyo, Japan Insetion planning fo steeable flexible needles eaching multiple plana tagets Jaeyeon Lee and
More informationA modal estimation based multitype sensor placement method
A modal estimation based multitype senso placement method *Xue-Yang Pei 1), Ting-Hua Yi 2) and Hong-Nan Li 3) 1),)2),3) School of Civil Engineeing, Dalian Univesity of Technology, Dalian 116023, China;
More informationOptical Flow for Large Motion Using Gradient Technique
SERBIAN JOURNAL OF ELECTRICAL ENGINEERING Vol. 3, No. 1, June 2006, 103-113 Optical Flow fo Lage Motion Using Gadient Technique Md. Moshaof Hossain Sake 1, Kamal Bechkoum 2, K.K. Islam 1 Abstact: In this
More informationPositioning of a robot based on binocular vision for hand / foot fusion Long Han
2nd Intenational Confeence on Advances in Mechanical Engineeing and Industial Infomatics (AMEII 26) Positioning of a obot based on binocula vision fo hand / foot fusion Long Han Compute Science and Technology,
More informationIP Network Design by Modified Branch Exchange Method
Received: June 7, 207 98 IP Netwok Design by Modified Banch Method Kaiat Jaoenat Natchamol Sichumoenattana 2* Faculty of Engineeing at Kamphaeng Saen, Kasetsat Univesity, Thailand 2 Faculty of Management
More information3D Motion Planning Algorithms for Steerable Needles Using Inverse Kinematics
3D Motion Planning Algoithms fo Steeable Needles Using Invese Kinematics Vincent Duindam 1, Jijie Xu 2, Ron Alteovitz 1,3, Shanka Sasty 1, and Ken Goldbeg 1,2 1 Depatment of EECS, Univesity of Califonia,
More informationAn Unsupervised Segmentation Framework For Texture Image Queries
An Unsupevised Segmentation Famewok Fo Textue Image Queies Shu-Ching Chen Distibuted Multimedia Infomation System Laboatoy School of Compute Science Floida Intenational Univesity Miami, FL 33199, USA chens@cs.fiu.edu
More informationJournal of World s Electrical Engineering and Technology J. World. Elect. Eng. Tech. 1(1): 12-16, 2012
2011, Scienceline Publication www.science-line.com Jounal of Wold s Electical Engineeing and Technology J. Wold. Elect. Eng. Tech. 1(1): 12-16, 2012 JWEET An Efficient Algoithm fo Lip Segmentation in Colo
More informationAdaptation of Motion Capture Data of Human Arms to a Humanoid Robot Using Optimization
ICCAS25 June 2-5, KINTEX, Gyeonggi-Do, Koea Adaptation of Motion Captue Data of Human Ams to a Humanoid Robot Using Optimization ChangHwan Kim and Doik Kim Intelligent Robotics Reseach Cente, Koea Institute
More informationA New and Efficient 2D Collision Detection Method Based on Contact Theory Xiaolong CHENG, Jun XIAO a, Ying WANG, Qinghai MIAO, Jian XUE
5th Intenational Confeence on Advanced Mateials and Compute Science (ICAMCS 2016) A New and Efficient 2D Collision Detection Method Based on Contact Theoy Xiaolong CHENG, Jun XIAO a, Ying WANG, Qinghai
More informationSegmentation of Casting Defects in X-Ray Images Based on Fractal Dimension
17th Wold Confeence on Nondestuctive Testing, 25-28 Oct 2008, Shanghai, China Segmentation of Casting Defects in X-Ray Images Based on Factal Dimension Jue WANG 1, Xiaoqin HOU 2, Yufang CAI 3 ICT Reseach
More informationFifth Wheel Modelling and Testing
Fifth heel Modelling and Testing en Masoy Mechanical Engineeing Depatment Floida Atlantic Univesity Boca aton, FL 4 Lois Malaptias IFMA Institut Fancais De Mechanique Advancee ampus De lemont Feand Les
More informationObstacle Avoidance of Autonomous Mobile Robot using Stereo Vision Sensor
Obstacle Avoidance of Autonomous Mobile Robot using Steeo Vision Senso Masako Kumano Akihisa Ohya Shin ichi Yuta Intelligent Robot Laboatoy Univesity of Tsukuba, Ibaaki, 35-8573 Japan E-mail: {masako,
More informationControlled Information Maximization for SOM Knowledge Induced Learning
3 Int'l Conf. Atificial Intelligence ICAI'5 Contolled Infomation Maximization fo SOM Knowledge Induced Leaning Ryotao Kamimua IT Education Cente and Gaduate School of Science and Technology, Tokai Univeisity
More informationDetection and Recognition of Alert Traffic Signs
Detection and Recognition of Alet Taffic Signs Chia-Hsiung Chen, Macus Chen, and Tianshi Gao 1 Stanfod Univesity Stanfod, CA 9305 {echchen, macuscc, tianshig}@stanfod.edu Abstact Taffic signs povide dives
More informationGravitational Shift for Beginners
Gavitational Shift fo Beginnes This pape, which I wote in 26, fomulates the equations fo gavitational shifts fom the elativistic famewok of special elativity. Fist I deive the fomulas fo the gavitational
More informationPOMDP: Introduction to Partially Observable Markov Decision Processes Hossein Kamalzadeh, Michael Hahsler
POMDP: Intoduction to Patially Obsevable Makov Decision Pocesses Hossein Kamalzadeh, Michael Hahsle 2019-01-02 The R package pomdp povides an inteface to pomdp-solve, a solve (witten in C) fo Patially
More informationColor Correction Using 3D Multiview Geometry
Colo Coection Using 3D Multiview Geomety Dong-Won Shin and Yo-Sung Ho Gwangju Institute of Science and Technology (GIST) 13 Cheomdan-gwagio, Buk-ku, Gwangju 500-71, Republic of Koea ABSTRACT Recently,
More informationGeneralized Grey Target Decision Method Based on Decision Makers Indifference Attribute Value Preferences
Ameican Jounal of ata ining and Knowledge iscovey 27; 2(4): 2-8 http://www.sciencepublishinggoup.com//admkd doi:.648/.admkd.2724.2 Genealized Gey Taget ecision ethod Based on ecision akes Indiffeence Attibute
More informationPoint-Biserial Correlation Analysis of Fuzzy Attributes
Appl Math Inf Sci 6 No S pp 439S-444S (0 Applied Mathematics & Infomation Sciences An Intenational Jounal @ 0 NSP Natual Sciences Publishing o Point-iseial oelation Analysis of Fuzzy Attibutes Hao-En hueh
More informationMonte Carlo Techniques for Rendering
Monte Calo Techniques fo Rendeing CS 517 Fall 2002 Compute Science Conell Univesity Announcements No ectue on Thusday Instead, attend Steven Gotle, Havad Upson Hall B17, 4:15-5:15 (efeshments ealie) Geomety
More informationConservation Law of Centrifugal Force and Mechanism of Energy Transfer Caused in Turbomachinery
Poceedings of the 4th WSEAS Intenational Confeence on luid Mechanics and Aeodynamics, Elounda, Geece, August 1-3, 006 (pp337-34) Consevation Law of Centifugal oce and Mechanism of Enegy Tansfe Caused in
More informationDesired Attitude Angles Design Based on Optimization for Side Window Detection of Kinetic Interceptor *
Poceedings of the 7 th Chinese Contol Confeence July 6-8, 008, Kunming,Yunnan, China Desied Attitude Angles Design Based on Optimization fo Side Window Detection of Kinetic Intecepto * Zhu Bo, Quan Quan,
More information3D Hand Trajectory Segmentation by Curvatures and Hand Orientation for Classification through a Probabilistic Approach
3D Hand Tajectoy Segmentation by Cuvatues and Hand Oientation fo Classification though a Pobabilistic Appoach Diego R. Faia and Joge Dias Abstact In this wok we pesent the segmentation and classification
More informationExtract Object Boundaries in Noisy Images using Level Set. Final Report
Extact Object Boundaies in Noisy Images using Level Set by: Quming Zhou Final Repot Submitted to Pofesso Bian Evans EE381K Multidimensional Digital Signal Pocessing May 10, 003 Abstact Finding object contous
More information= dv 3V (r + a 1) 3 r 3 f(r) = 1. = ( (r + r 2
Random Waypoint Model in n-dimensional Space Esa Hyytiä and Joma Vitamo Netwoking Laboatoy, Helsinki Univesity of Technology, Finland Abstact The andom waypoint model (RWP) is one of the most widely used
More informationADDING REALISM TO SOURCE CHARACTERIZATION USING A GENETIC ALGORITHM
ADDING REALISM TO SOURCE CHARACTERIZATION USING A GENETIC ALGORITHM Luna M. Rodiguez*, Sue Ellen Haupt, and Geoge S. Young Depatment of Meteoology and Applied Reseach Laboatoy The Pennsylvania State Univesity,
More informationA Recommender System for Online Personalization in the WUM Applications
A Recommende System fo Online Pesonalization in the WUM Applications Mehdad Jalali 1, Nowati Mustapha 2, Ali Mamat 2, Md. Nasi B Sulaiman 2 Abstact foeseeing of use futue movements and intentions based
More informationMassachusetts Institute of Technology Department of Mechanical Engineering
cm cm Poblem Massachusetts Institute of echnolog Depatment of Mechanical Engineeing. Intoduction to obotics Sample Poblems and Solutions fo the Mid-em Exam Figue shows a obotic vehicle having two poweed
More informationProactive Kinodynamic Planning using the Extended Social Force Model and Human Motion Prediction in Urban Environments
Poactive Kinodynamic Planning using the Extended Social Foce Model and Human Motion Pediction in Uban Envionments Gonzalo Fee and Albeto Sanfeliu Abstact This pape pesents a novel appoach fo obot navigation
More informationAccurate Diffraction Efficiency Control for Multiplexed Volume Holographic Gratings. Xuliang Han, Gicherl Kim, and Ray T. Chen
Accuate Diffaction Efficiency Contol fo Multiplexed Volume Hologaphic Gatings Xuliang Han, Gichel Kim, and Ray T. Chen Micoelectonic Reseach Cente Depatment of Electical and Compute Engineeing Univesity
More informationOn Error Estimation in Runge-Kutta Methods
Leonado Jounal of Sciences ISSN 1583-0233 Issue 18, Januay-June 2011 p. 1-10 On Eo Estimation in Runge-Kutta Methods Ochoche ABRAHAM 1,*, Gbolahan BOLARIN 2 1 Depatment of Infomation Technology, 2 Depatment
More informationSpiral Recognition Methodology and Its Application for Recognition of Chinese Bank Checks
Spial Recognition Methodology and Its Application fo Recognition of Chinese Bank Checks Hanshen Tang 1, Emmanuel Augustin 2, Ching Y. Suen 1, Olivie Baet 2, Mohamed Cheiet 3 1 Cente fo Patten Recognition
More informationGTOC 9, Multiple Space Debris Rendezvous Trajectory Design in the J2 environment
GTOC 9, Multiple Space Debis Rendezvous Tajectoy Design in the J envionment Macus Hallmann, Makus Schlottee, Ansga Heidecke, Maco Sagliano Fedeico Fumenti, Volke Maiwald, René Schwaz Institute of Space
More informationAssessment of Track Sequence Optimization based on Recorded Field Operations
Assessment of Tack Sequence Optimization based on Recoded Field Opeations Matin A. F. Jensen 1,2,*, Claus G. Søensen 1, Dionysis Bochtis 1 1 Aahus Univesity, Faculty of Science and Technology, Depatment
More information3D Reconstruction from 360 x 360 Mosaics 1
CENTER FOR MACHINE PERCEPTION 3D Reconstuction fom 36 x 36 Mosaics CZECH TECHNICAL UNIVERSITY {bakstein, pajdla}@cmp.felk.cvut.cz REPRINT Hynek Bakstein and Tomáš Pajdla, 3D Reconstuction fom 36 x 36 Mosaics,
More informationImage Enhancement in the Spatial Domain. Spatial Domain
8-- Spatial Domain Image Enhancement in the Spatial Domain What is spatial domain The space whee all pixels fom an image In spatial domain we can epesent an image by f( whee x and y ae coodinates along
More informationTopological Characteristic of Wireless Network
Topological Chaacteistic of Wieless Netwok Its Application to Node Placement Algoithm Husnu Sane Naman 1 Outline Backgound Motivation Papes and Contibutions Fist Pape Second Pape Thid Pape Futue Woks Refeences
More informationISyE 4256 Industrial Robotic Applications
ISyE 456 Industial Robotic Applications Quiz # Oct. 9, 998 Name This is a closed book, closed notes exam. Show wok fo poblem questions ) ( pts) Please cicle one choice fo each item. a) In an application,
More informationANALYTIC PERFORMANCE MODELS FOR SINGLE CLASS AND MULTIPLE CLASS MULTITHREADED SOFTWARE SERVERS
ANALYTIC PERFORMANCE MODELS FOR SINGLE CLASS AND MULTIPLE CLASS MULTITHREADED SOFTWARE SERVERS Daniel A Menascé Mohamed N Bennani Dept of Compute Science Oacle, Inc Geoge Mason Univesity 1211 SW Fifth
More informationA Minutiae-based Fingerprint Matching Algorithm Using Phase Correlation
A Minutiae-based Fingepint Matching Algoithm Using Phase Coelation Autho Chen, Weiping, Gao, Yongsheng Published 2007 Confeence Title Digital Image Computing: Techniques and Applications DOI https://doi.og/10.1109/dicta.2007.4426801
More informationAn Optimised Density Based Clustering Algorithm
Intenational Jounal of Compute Applications (0975 8887) Volume 6 No.9, Septembe 010 An Optimised Density Based Clusteing Algoithm J. Hencil Pete Depatment of Compute Science St. Xavie s College, Palayamkottai,
More informationFINITE ELEMENT MODEL UPDATING OF AN EXPERIMENTAL VEHICLE MODEL USING MEASURED MODAL CHARACTERISTICS
COMPDYN 009 ECCOMAS Thematic Confeence on Computational Methods in Stuctual Dynamics and Eathquake Engineeing M. Papadakakis, N.D. Lagaos, M. Fagiadakis (eds.) Rhodes, Geece, 4 June 009 FINITE ELEMENT
More informationSlotted Random Access Protocol with Dynamic Transmission Probability Control in CDMA System
Slotted Random Access Potocol with Dynamic Tansmission Pobability Contol in CDMA System Intaek Lim 1 1 Depatment of Embedded Softwae, Busan Univesity of Foeign Studies, itlim@bufs.ac.k Abstact In packet
More informationShortest Paths for a Two-Robot Rendez-Vous
Shotest Paths fo a Two-Robot Rendez-Vous Eik L Wyntes Joseph S B Mitchell y Abstact In this pape, we conside an optimal motion planning poblem fo a pai of point obots in a plana envionment with polygonal
More informationA Novel Automatic White Balance Method For Digital Still Cameras
A Novel Automatic White Balance Method Fo Digital Still Cameas Ching-Chih Weng 1, Home Chen 1,2, and Chiou-Shann Fuh 3 Depatment of Electical Engineeing, 2 3 Gaduate Institute of Communication Engineeing
More informationTransmission Lines Modeling Based on Vector Fitting Algorithm and RLC Active/Passive Filter Design
Tansmission Lines Modeling Based on Vecto Fitting Algoithm and RLC Active/Passive Filte Design Ahmed Qasim Tuki a,*, Nashien Fazilah Mailah b, Mohammad Lutfi Othman c, Ahmad H. Saby d Cente fo Advanced
More informationSimulation and Performance Evaluation of Network on Chip Architectures and Algorithms using CINSIM
J. Basic. Appl. Sci. Res., 1(10)1594-1602, 2011 2011, TextRoad Publication ISSN 2090-424X Jounal of Basic and Applied Scientific Reseach www.textoad.com Simulation and Pefomance Evaluation of Netwok on
More informationTowards Adaptive Information Merging Using Selected XML Fragments
Towads Adaptive Infomation Meging Using Selected XML Fagments Ho-Lam Lau and Wilfed Ng Depatment of Compute Science and Engineeing, The Hong Kong Univesity of Science and Technology, Hong Kong {lauhl,
More informationJournal of Machine Engineering, Vol. 15, No. 4, 2015
Jounal of Machine Engineeing, Vol. 15, No. 4, 2015 Received: 09 July 2015 / Accepted: 15 Octobe 2015 / Published online: 10 Novembe 2015 Vigil TEODOR 1* Vioel PAUNOIU 1 Silviu BERBINSCHI 2 Nicuşo BAROIU
More informationMobility Pattern Recognition in Mobile Ad-Hoc Networks
Mobility Patten Recognition in Mobile Ad-Hoc Netwoks S. M. Mousavi Depatment of Compute Engineeing, Shaif Univesity of Technology sm_mousavi@ce.shaif.edu H. R. Rabiee Depatment of Compute Engineeing, Shaif
More informationEYE DIRECTION BY STEREO IMAGE PROCESSING USING CORNEAL REFLECTION ON AN IRIS
EYE DIRECTION BY STEREO IMAGE PROCESSING USING CORNEAL REFLECTION ON AN IRIS Kumiko Tsuji Fukuoka Medical technology Teikyo Univesity 4-3-14 Shin-Katsutachi-Machi Ohmuta Fukuoka 836 Japan email: c746g@wisdomcckyushu-uacjp
More informationVehicle Chassis Control Using Adaptive Semi-Active Suspension
Poceedings of the 17th Wold Congess The Intenational Fedeation of Automatic Contol Vehicle Chassis Contol Using Adaptive Semi-Active Suspension V. Sankaanaayanan, Sinan Oncu, Dince Ocan, and Levent Güvenç
More informationA New Finite Word-length Optimization Method Design for LDPC Decoder
A New Finite Wod-length Optimization Method Design fo LDPC Decode Jinlei Chen, Yan Zhang and Xu Wang Key Laboatoy of Netwok Oiented Intelligent Computation Shenzhen Gaduate School, Habin Institute of Technology
More informationClustering Interval-valued Data Using an Overlapped Interval Divergence
Poc. of the 8th Austalasian Data Mining Confeence (AusDM'9) Clusteing Inteval-valued Data Using an Ovelapped Inteval Divegence Yongli Ren Yu-Hsn Liu Jia Rong Robet Dew School of Infomation Engineeing,
More informationA Memory Efficient Array Architecture for Real-Time Motion Estimation
A Memoy Efficient Aay Achitectue fo Real-Time Motion Estimation Vasily G. Moshnyaga and Keikichi Tamau Depatment of Electonics & Communication, Kyoto Univesity Sakyo-ku, Yoshida-Honmachi, Kyoto 66-1, JAPAN
More informationRANDOM IRREGULAR BLOCK-HIERARCHICAL NETWORKS: ALGORITHMS FOR COMPUTATION OF MAIN PROPERTIES
RANDOM IRREGULAR BLOCK-HIERARCHICAL NETWORKS: ALGORITHMS FOR COMPUTATION OF MAIN PROPERTIES Svetlana Avetisyan Mikayel Samvelyan* Matun Kaapetyan Yeevan State Univesity Abstact In this pape, the class
More informationTopic 7 Random Variables and Distribution Functions
Definition of a Random Vaiable Distibution Functions Popeties of Distibution Functions Topic 7 Random Vaiables and Distibution Functions Distibution Functions 1 / 11 Definition of a Random Vaiable Distibution
More information3D inspection system for manufactured machine parts
3D inspection system fo manufactued machine pats D. Gacía a*, J. M. Sebastián a*, F. M. Sánchez a*, L. M. Jiménez b*, J. M. González a* a Dept. of System Engineeing and Automatic Contol. Polytechnic Univesity
More informationA Novel Image-Based Rendering System With A Longitudinally Aligned Camera Array
EUOGAPHICS 2 / A. de Sousa, J.C. Toes Shot Pesentations A Novel Image-Based endeing System With A Longitudinally Aligned Camea Aay Jiang Li, Kun Zhou, Yong Wang and Heung-Yeung Shum Micosoft eseach, China
More informationMulti-azimuth Prestack Time Migration for General Anisotropic, Weakly Heterogeneous Media - Field Data Examples
Multi-azimuth Pestack Time Migation fo Geneal Anisotopic, Weakly Heteogeneous Media - Field Data Examples S. Beaumont* (EOST/PGS) & W. Söllne (PGS) SUMMARY Multi-azimuth data acquisition has shown benefits
More informationOPTIMUM DESIGN OF 3R ORTHOGONAL MANIPULATORS CONSIDERING ITS TOPOLOGY
Copyight by ABCM Page 38 OPTIMUM DESIGN OF 3R ORTHOGONAL MANIPULATORS CONSIDERING ITS TOPOLOGY Giovana Tindade da Silva Oliveia, gtindadeso@yahoo.com.b School of Mechanical Engineeing, Fedeal Univesity
More informationCommunication vs Distributed Computation: an alternative trade-off curve
Communication vs Distibuted Computation: an altenative tade-off cuve Yahya H. Ezzeldin, Mohammed amoose, Chistina Fagouli Univesity of Califonia, Los Angeles, CA 90095, USA, Email: {yahya.ezzeldin, mkamoose,
More informationHISTOGRAMS are an important statistic reflecting the
JOURNAL OF L A T E X CLASS FILES, VOL. 14, NO. 8, AUGUST 2015 1 D 2 HistoSketch: Disciminative and Dynamic Similaity-Peseving Sketching of Steaming Histogams Dingqi Yang, Bin Li, Laua Rettig, and Philippe
More informationTitle. Author(s)NOMURA, K.; MOROOKA, S. Issue Date Doc URL. Type. Note. File Information
Title CALCULATION FORMULA FOR A MAXIMUM BENDING MOMENT AND THE TRIANGULAR SLAB WITH CONSIDERING EFFECT OF SUPPO UNIFORM LOAD Autho(s)NOMURA, K.; MOROOKA, S. Issue Date 2013-09-11 Doc URL http://hdl.handle.net/2115/54220
More informationTopic -3 Image Enhancement
Topic -3 Image Enhancement (Pat 1) DIP: Details Digital Image Pocessing Digital Image Chaacteistics Spatial Spectal Gay-level Histogam DFT DCT Pe-Pocessing Enhancement Restoation Point Pocessing Masking
More informationA Two-stage and Parameter-free Binarization Method for Degraded Document Images
A Two-stage and Paamete-fee Binaization Method fo Degaded Document Images Yung-Hsiang Chiu 1, Kuo-Liang Chung 1, Yong-Huai Huang 2, Wei-Ning Yang 3, Chi-Huang Liao 4 1 Depatment of Compute Science and
More informationCardiac C-Arm CT. SNR Enhancement by Combining Multiple Retrospectively Motion Corrected FDK-Like Reconstructions
Cadiac C-Am CT SNR Enhancement by Combining Multiple Retospectively Motion Coected FDK-Like Reconstuctions M. Pümme 1, L. Wigstöm 2,3, R. Fahig 2, G. Lauitsch 4, J. Honegge 1 1 Institute of Patten Recognition,
More information4.2. Co-terminal and Related Angles. Investigate
.2 Co-teminal and Related Angles Tigonometic atios can be used to model quantities such as
More informationScaling Location-based Services with Dynamically Composed Location Index
Scaling Location-based Sevices with Dynamically Composed Location Index Bhuvan Bamba, Sangeetha Seshadi and Ling Liu Distibuted Data Intensive Systems Laboatoy (DiSL) College of Computing, Geogia Institute
More informationINFORMATION DISSEMINATION DELAY IN VEHICLE-TO-VEHICLE COMMUNICATION NETWORKS IN A TRAFFIC STREAM
INFORMATION DISSEMINATION DELAY IN VEHICLE-TO-VEHICLE COMMUNICATION NETWORKS IN A TRAFFIC STREAM LiLi Du Depatment of Civil, Achitectual, and Envionmental Engineeing Illinois Institute of Technology 3300
More informationPerformance Optimization in Structured Wireless Sensor Networks
5 The Intenational Aab Jounal of Infomation Technology, Vol. 6, o. 5, ovembe 9 Pefomance Optimization in Stuctued Wieless Senso etwoks Amine Moussa and Hoda Maalouf Compute Science Depatment, ote Dame
More informationMULTI-TEMPORAL AND MULTI-SENSOR IMAGE MATCHING BASED ON LOCAL FREQUENCY INFORMATION
Intenational Achives of the Photogammety Remote Sensing and Spatial Infomation Sciences Volume XXXIX-B3 2012 XXII ISPRS Congess 25 August 01 Septembe 2012 Melboune Austalia MULTI-TEMPORAL AND MULTI-SENSOR
More informationPrediction of Time Series Using RBF Neural Networks: A New Approach of Clustering
138 The Intenational Aab Jounal of Infomation Technology, Vol. 6,. 2, Apil 2009 Pediction of Time Seies Using RBF Neual Netwoks: A New Appoach of Clusteing Mohammed Awad 2, Hécto Pomaes 1, Ignacio Rojas
More informationarxiv: v2 [physics.soc-ph] 30 Nov 2016
Tanspotation dynamics on coupled netwoks with limited bandwidth Ming Li 1,*, Mao-Bin Hu 1, and Bing-Hong Wang 2, axiv:1607.05382v2 [physics.soc-ph] 30 Nov 2016 1 School of Engineeing Science, Univesity
More informationXFVHDL: A Tool for the Synthesis of Fuzzy Logic Controllers
XFVHDL: A Tool fo the Synthesis of Fuzzy Logic Contolles E. Lago, C. J. Jiménez, D. R. López, S. Sánchez-Solano and A. Baiga Instituto de Micoelectónica de Sevilla. Cento Nacional de Micoelectónica, Edificio
More informationIllumination methods for optical wear detection
Illumination methods fo optical wea detection 1 J. Zhang, 2 P.P.L.Regtien 1 VIMEC Applied Vision Technology, Coy 43, 5653 LC Eindhoven, The Nethelands Email: jianbo.zhang@gmail.com 2 Faculty Electical
More informationDr. A.B.M. Toufique Hasan. Lecture-13
7/5/8 ME 45: Aeodynamics D. A.B.M. Toufique Hasan Pofesso Depatment of Mechanical Engineeing g Bangladesh Univesity of Engineeing & Technology BUET, Dhaka Lectue-3 7/5/8 Doublet & Flow Ove a stationey
More informationConcomitants of Upper Record Statistics for Bivariate Pseudo Weibull Distribution
Available at http://pvamuedu/aam Appl Appl Math ISSN: 93-9466 Vol 5, Issue (Decembe ), pp 8 9 (Peviously, Vol 5, Issue, pp 379 388) Applications and Applied Mathematics: An Intenational Jounal (AAM) Concomitants
More informationAnd Ph.D. Candidate of Computer Science, University of Putra Malaysia 2 Faculty of Computer Science and Information Technology,
(IJCSIS) Intenational Jounal of Compute Science and Infomation Secuity, Efficient Candidacy Reduction Fo Fequent Patten Mining M.H Nadimi-Shahaki 1, Nowati Mustapha 2, Md Nasi B Sulaiman 2, Ali B Mamat
More informationKalman filter correction with rational non-linear functions: Application to Visual-SLAM
1 Kalman filte coection with ational non-linea functions: Application to Visual-SLAM Thomas Féaud, Roland Chapuis, Romuald Aufèe and Paul Checchin Clemont Univesité, Univesité Blaise Pascal, LASMEA UMR
More informationCoordinate Systems. Ioannis Rekleitis
Coodinate Systems Ioannis ekleitis Position epesentation Position epesentation is: P p p p x y z P CS-417 Intoduction to obotics and Intelligent Systems Oientation epesentations Descibes the otation of
More informationEvent-based Location Dependent Data Services in Mobile WSNs
Event-based Location Dependent Data Sevices in Mobile WSNs Liang Hong 1, Yafeng Wu, Sang H. Son, Yansheng Lu 3 1 College of Compute Science and Technology, Wuhan Univesity, China Depatment of Compute Science,
More information2. PROPELLER GEOMETRY
a) Fames of Refeence 2. PROPELLER GEOMETRY 10 th Intenational Towing Tank Committee (ITTC) initiated the pepaation of a dictionay and nomenclatue of ship hydodynamic tems and this wok was completed in
More information(a, b) x y r. For this problem, is a point in the - coordinate plane and is a positive number.
Illustative G-C Simila cicles Alignments to Content Standads: G-C.A. Task (a, b) x y Fo this poblem, is a point in the - coodinate plane and is a positive numbe. a. Using a tanslation and a dilation, show
More informationComparisons of Transient Analytical Methods for Determining Hydraulic Conductivity Using Disc Permeameters
Compaisons of Tansient Analytical Methods fo Detemining Hydaulic Conductivity Using Disc Pemeametes 1,,3 Cook, F.J. 1 CSRO Land and Wate, ndoooopilly, Queensland The Univesity of Queensland, St Lucia,
More informationAn Extension to the Local Binary Patterns for Image Retrieval
, pp.81-85 http://x.oi.og/10.14257/astl.2014.45.16 An Extension to the Local Binay Pattens fo Image Retieval Zhize Wu, Yu Xia, Shouhong Wan School of Compute Science an Technology, Univesity of Science
More informationFrequency Domain Approach for Face Recognition Using Optical Vanderlugt Filters
Optics and Photonics Jounal, 016, 6, 94-100 Published Online August 016 in SciRes. http://www.scip.og/jounal/opj http://dx.doi.og/10.436/opj.016.68b016 Fequency Domain Appoach fo Face Recognition Using
More informationNew Algorithms for Daylight Harvesting in a Private Office
18th Intenational Confeence on Infomation Fusion Washington, DC - July 6-9, 2015 New Algoithms fo Daylight Havesting in a Pivate Office Rohit Kuma Lighting Solutions and Sevices Philips Reseach Noth Ameica
More informationModeling spatially-correlated data of sensor networks with irregular topologies
This full text pape was pee eviewed at the diection of IEEE Communications Society subject matte expets fo publication in the IEEE SECON 25 poceedings Modeling spatially-coelated data of senso netwoks
More informationEffects of Model Complexity on Generalization Performance of Convolutional Neural Networks
Effects of Model Complexity on Genealization Pefomance of Convolutional Neual Netwoks Tae-Jun Kim 1, Dongsu Zhang 2, and Joon Shik Kim 3 1 Seoul National Univesity, Seoul 151-742, Koea, E-mail: tjkim@bi.snu.ac.k
More informationImproved Fourier-transform profilometry
Impoved Fouie-tansfom pofilomety Xianfu Mao, Wenjing Chen, and Xianyu Su An impoved optical geomety of the pojected-finge pofilomety technique, in which the exit pupil of the pojecting lens and the entance
More informationDecision Support for Rule and Technique Discovery in an Uncertain Environment
Decision Suppot fo Rule and Technique Discovey in an Uncetain Envionment D. James F. Smith III Naval Reseach Laboatoy, Code 5741 Washington, D.C., 0375-5000 Telephone: 0.767.5358 Fax: 0.404.7690 jfsmith@dsews.nl.navy.mil
More information5 4 THE BERNOULLI EQUATION
185 CHATER 5 the suounding ai). The fictional wok tem w fiction is often expessed as e loss to epesent the loss (convesion) of mechanical into themal. Fo the idealied case of fictionless motion, the last
More informationPrioritized Traffic Recovery over GMPLS Networks
Pioitized Taffic Recovey ove GMPLS Netwoks 2005 IEEE. Pesonal use of this mateial is pemitted. Pemission fom IEEE mu be obtained fo all othe uses in any cuent o futue media including epinting/epublishing
More informationa Not yet implemented in current version SPARK: Research Kit Pointer Analysis Parameters Soot Pointer analysis. Objectives
SPARK: Soot Reseach Kit Ondřej Lhoták Objectives Spak is a modula toolkit fo flow-insensitive may points-to analyses fo Java, which enables expeimentation with: vaious paametes of pointe analyses which
More informationAUTOMATED LOCATION OF ICE REGIONS IN RADARSAT SAR IMAGERY
AUTOMATED LOCATION OF ICE REGIONS IN RADARSAT SAR IMAGERY Chistophe Waceman (1), William G. Pichel (2), Pablo Clement-Colón (2) (1) Geneal Dynamics Advanced Infomation Systems, P.O. Box 134008 Ann Abo
More informationSYSTEM LEVEL REUSE METRICS FOR OBJECT ORIENTED SOFTWARE : AN ALTERNATIVE APPROACH
I J C A 7(), 202 pp. 49-53 SYSTEM LEVEL REUSE METRICS FOR OBJECT ORIENTED SOFTWARE : AN ALTERNATIVE APPROACH Sushil Goel and 2 Rajesh Vema Associate Pofesso, Depatment of Compute Science, Dyal Singh College,
More informationElliptic Generation Systems
4 Elliptic Geneation Systems Stefan P. Spekeijse 4.1 Intoduction 4.1 Intoduction 4.2 Two-Dimensional Gid Geneation Hamonic Maps, Gid Contol Maps, and Poisson Systems Discetization and Solution Method Constuction
More informationHaptic Glove. Chan-Su Lee. Abstract. This is a final report for the DIMACS grant of student-initiated project. I implemented Boundary
Physically Accuate Haptic Rendeing of Elastic Object fo a Haptic Glove Chan-Su Lee Abstact This is a final epot fo the DIMACS gant of student-initiated poject. I implemented Bounday Element Method(BEM)
More information