Basic Walking Simulations and Gravitational Stability Analysis for a Hexapod Robot Using Matlab

Size: px
Start display at page:

Download "Basic Walking Simulations and Gravitational Stability Analysis for a Hexapod Robot Using Matlab"

Transcription

1 Basc Walkng Smulatons and Gravtatonal Stablty Analyss for a Hexapod Robot Usng Matlab Sorn Mănou-Olaru*, Mrcea Nţulescu ** *Department of Automaton, Electroncs and Mechatroncs, Unversty of Craova, Romana (e-mal:manousorn2006@yahoo.com) ** Department of Automaton, Electroncs and Mechatroncs, Unversty of Craova, Romana (e-mal:ntulescu@robotcs.ucv.ro) Abstract: In ths paper the authors present a software program to smulate hexapod robot stablty n gravtatonal feld for a certan confguraton of legs and some basc walkng smulatons usng Matlab software package. Frst the complete knematcal model of the leg s calculated and the drect dynamcal model s presented. The knematcal model of the leg was obtaned usng Denavt Hartenberg algorthm. A workspace analyss of the leg s made n order to analyze collson durng walkng and mpose the necessary constrans. Then a hexapod robot structure usng ths knd of leg s presented and smulated usng Matlab software package. A vrtual smulaton platform was created for the robot n order to smulate robot statc stablty and basc movement algorthm. The analyss of the robot statc stablty s made for dfferent cases of locomoton on horzontal surface and for dfferent leg confguraton. Also the smulaton platform allows connecton of a physcal leg to the computer through Arduno Duemlanove development board n order to smulate dfferent movement algorthms and test the functonalty of the structure. Ths part s an expermental one and wll be mprove n the future. Movng the leg tp from one pont to another s made n two phases: stance phase and swng phase. The paper ncludes some expermental results related to the statc gravtatonal stablty dependng on the support polygon, sngle leg control and some basc walkng smulatons. Keywords: Matlab, gravtatonal stablty, Denavt-Hartenberg representaton, model, hexapod.. INTRODUCTION The nature nvented the leg and humans nvented the wheel. In nature, most arthropods have sx legs to easly mantan statc stablty, and t has been observed that a larger number of legs do not ncrease walkng speed. Moreover, hexapod robots show robustness n case of leg faults. For these reasons, hexapod robots have attracted consderable attenton n recent decades (Bensalem et. al. 2009). Most of the earth s surface s naccessble to regular vehcles. Today s robots are mostly desgned for travelng over relatvely smooth, leveled or nclned surfaces. The terran n queston s ether outdoor envronments, that s generally consdered dffcult for moble robots, or ndoor envronments lke starcases, doorsteps or tght corners can cause dffcultes. An mportant drawback of legged machnes s the complexty of the control requred to acheve walkng even on completely flat and horzontal surface n whch much smpler wheeled machnes work perfectly well (Carbone 2005). The dffculty s not movng the ndvdual legs, but n coordnaton of the movement of the legs and the body. The legged robot control system must generate a sequence of leg and body motons, a gat, whch wll propel t along desred trajectory. Gat generaton s the formulaton and selecton of a sequence of coordnated leg and body motons that propel the robot along the desred path. The most studed problem for mult-legged robots concerns how to determne the best sequence for lftng off and placng the feet. Hexapod gats have been wdely studed as a functon of robot characterstcs. The large dversty of the exstng walkng anmals offers nnumerable examples of the possbltes of ths type of locomoton. The gat analyss and selecton requres an apprecable modelng effort for the mprovement of moblty wth legs n structure/unstructured envronments. Nowadays studes are focused prmarly on usng artfcal neural networks, fuzzy logc or central pattern generators for both leg coordnaton and leg control. It s well known that to mantan a structure s poston n a three dmensonal space requres three pont of support. Machnes wth three or more legs contnuously n contact wth the ground are sad to be statcally balanced f they mantan ther projecton of the centre of gravty wthn the polygon determned by the legs on the support plane. The polygon s known as the support polygon (Fg. ). One of the most studed problem for multlegged robots concerns the stablty analyze durng lftng off and placng the legs. The moton of legged robots can be dvded nto statcally and dynamcally stable. Statc sta

2 blty means that the robot s stable at all tmes durng ts gat cycle. Dynamc stablty means that the robot s only stable when t s movng. For legged robots, statc stablty demands that the robot has at least three legs on the ground at all tmes and the robot s centre of mass s nsde the support polygon,.e. the convex polygon formed by the feet supportng the robot (Fg. ). On the left sde four legs provde support and the centre of mass s located nsde the support polygon so the robot s statcally stable. On the mddle the bottom left leg has been lfted, puttng the centre of mass outsde the support polygon whch made the robot unstable. On the rght sde three legs provde support and the centre of mass s located on one sde of the support polygon. Ths case s called crtcal stablty. The coordnate frames for the robot legs are assgned as n fg. 2. The assgnment of lnk frames follows the Denavt- Hartenberg drect geometrcal modelng algorthm. d q R z L q R 2 R x 0 L L 2 x q 2 x 2 z 2 y 0 Y G Z G X G x z Fg. 2. Model and coordnates frame for leg knematcs. Statcally stable Statcally unstable Fg.. Stablty cases for a hexapod robot: stable, unstable crtcally. Arduno Duemlanove s a development board equpped wth an AVR ATMEGA28 mcrocontroller. Today all the mcrocontrollers are made wth CMOS technology because of the large densty of ntegraton at a lower cost AVR uses Harvard archtecture, wth separate memores and buses for program and data. Some advantages of usng Arduno Duemlanove are: -easy to program. Programmng envronment s easyto-use for both begnners and advanced programmers -open source. Lots of code lbrares are avalable for free for a wde range of external components (sensors, actuator, LCD). 2. ROBOTIC LEG MODEL The successful desgn of a legged robot depends mostly on the desgn of the chosen leg. Snce all aspects of walkng are ultmately governed by the physcal lmtatons of the leg, t s mportant to select a leg that wll allow a maxmum range of moton and that wll not mpose unnecessary constrants on the walkng. 2. Drect Knematcs Crtcally stable A three-revolute knematcal chan has been chosen for each leg mechansm n order to mmc the leg structure (Fg. 2). A drect geometrcal model for each leg mechansm s formulated between the movng frame O (x,y,z ) of the leg base, where =, and the fxed frame O G (X G,Y G, Z G ). The robot leg frame starts wth lnk 0 whch s the pont on the robot where the leg s attached; lnk s the coxa, lnk 2 s the femur and lnk s the tba. Legs are dstrbuted symmetrcally about an axs n the drecton of moton (Y n ths case). The general form for the transformaton matrx from lnk to lnk - usng Denavt Hartenberg parameters [Schllng 990] s gven n (): T cosθ sn θ cosα snθ snα a cos θ snθ cos θ cosα cos θ snα a sn θ = 0 snα cosα d The transformaton matrx s a seres of transformatons:. Translate d along z - axs, 2. Rotate θ about z - axs,. Translate a along x - axs, 4. Rotate α about x - axs. The overall transformaton s obtaned as a product between three transformaton matrxes: base femur tba base Tcoxa = Tcoxa TfemurT (2) tba Consderng fg. 2 and usng (2) the coordnates of the leg tp are: x=cos θ (L + L2 cos θ2 + L cos( θ2 - θ)) y=sn θ (L + L2 cos θ2 + L cos( θ2 - θ)) () z = d + L sn θ + L sn( θ - θ ) where: d s the dstance from the ground to coxa jont. L are the lengths of the leg lnks. The centre of mass of each lnk s postoned relatve to the lnk frame by a poston vector p = [x, y, z, ] T. To fnd the poston of the centre of mass of each lnk relatve to leg frame, the coordnates p are multpled wth the D- H transformaton gvng the centre of mass postons: ()

3 p = T0 p, =... (4) CoM The poston of centre of mass of the leg s calculated usng the followng equatons: x m y m z m x y z m m m l l l = = = g =,, g = g = l l l = = = where m l s the mass of lnk. 2.2 Inverse Knematcs The geometrcal model descrbed above establshes a connecton between the jont varable and the poston and orentaton of the end frame. The nverse knematcs problem conssts of determnng the jont angles from a gven poston and orentaton of the end frame. The soluton of ths problem s mportant n order to transform the moton assgned to the end frame nto the jont angle motons correspondng to the desred end frame moton. The goal s to fnd the three jont varables θ, θ 2, and θ correspondng to the desred end frame poston. The end frames orentaton s not an ssue, snce we are only nterested n ts poston. y Fg.. Illustratons for solvng nverse knematcs. Usng () and consderng the followng constrants: all jonts allow rotaton only about one axs, femur and tba always rotate on parallel axes, and the physcal lmtaton of each jont we can determne the jont angle. The coxa jont angle can be found usng atan2(y,x) functon as can be seen from fg..a. (5) θ = atan 2( yl, xl) (6) In order to determne the other two angles a geometrcal approach was consdered. To further smplfy the approach the leg tp coordnates were transformed to coxa frame usng the transformaton matrx below: T A Leg tp x l,y l θ x y Femur jont Coxa jont T ( ) ( ) Tba jont T coxa coxa coxa R R d = 0 femur femur femur femur coxa L 2 φ 2 φ L a B φ θ x,y x (7) The angle φ 2 whch s the angle relatng to the femur servo poston, can be derved drectly from the trangle (fg..b): θ = ϕ (8) 2 2 The angle φ s the angle between the x-axs and lne a and can be calculated wth atan2 functon: ϕ = atan 2( y, x ) (9) where x and y are the leg tp coordnates n coxa frame. If we consder φ t to be the entre femur span and apply the law of cosnes results: where: L2 + a L ϕt = acos 2 L2 a 2 2 (0) a = x + y () Next the femur angle can be found from: L2 + a L θ2 = acos + atan 2( y, x) (2) 2 L2 a Agan, applyng the law of cosnes we fnd the φ angle: L2 + L a ϕ = acos () 2 L2 L Consderng fg. B we see that θ can be found as follows: 2. Dynamc Model θ = π ϕ (4) The purpose of robot dynamcs s to determne the generalzed forces requred to not only overcome the selfnertal loads (due to the weght of the lnks nsde the robot) but also to produce the desred nput motons to the robot s mechansm (Fahm 2008). In order to obtan a more precse model we dvded the mass of each lnk n two (M - servomotor mass, m -lnk mass, M > m ) (Fg. 4). Consderng the generalzed coordnates vector q= [q, q 2, q ] T the generalzed vector forces can be computed usng the below equaton: d L L τ = dt q& q where: Lqq (,&) = E( qq,&) E( q). c p (5) Consderng that all three servomotors have the same mass M =M 2 =M =M and the last two lnks have the same

4 m,l,i M 2,I 2 M,I θ Ground Fg. 4. Illustratons for developng dynamc model of the leg. mass m 2 =m =m 2 but dfferent lengths the expressons for generalzed forces are: && θ ( I I M ( l R ) m ( r r )) ( M R + m ( r + r )) && ( I I M l 2 m r 2 ) m r& 2 & τ = & θ & & & 2 2 r 2 R r r 4 τ = θ θ m g l θ + θ M + m m2 l2 cos( θ2) (2 M + m+ )]} 2 τ = && θ ( I + I ) g l cos( θ2 + θ) m2 M + m { [ cos( 2 ) ( ) (6) (7) (8) where: I -are the moments of nerta assocated wth the servomotors; I -are the moments of nerta assocated wth the lnks; r -radus of nstantaneous crcle of rotaton of the centre of mass assocated wth the lnk of the leg, =2...4; R -radus of nstantaneous crcle of rotaton of the servomotor.. WORKSPACE ANALYSIS of the LEG There are several thngs that are mportant when defnng the leg workspace. A basc one s that the workspace should not be larger than the reach of the leg. Workspace must be defne n order to maxmze moton but n the same tme to mnmze sngulartes or any other ptfalls (Mak 2007). Workspace s also useful for walkng algorthm to prevent collson of adjacent legs by mposng restrctons for drect or nverse knematcs. The actuators used on the legs are capable of rotatng 80 degrees. In order to mnmze leg collsons the coxa angle was lmted between π/4 and π/4. Ths restrcton was θ 2 z c θ m 2,l 2,I 2 M,I m,l,i ntroduced due to mechancal constructon of the leg. To get the most out of moton the operaton space of varable θ 2 was set from -π/2 to π/4 and θ from 0 to *π/4. In our case there s a sngularty when the x and y coordnates of the leg tp are zero. In ths confguraton the value for θ s arbtrary. To avod ths scenaro we can defne the x coordnate greater than zero. Physcal lmtatons due to mechancal constructon for each jont angle are: q coxa =[-π/4,π/4], q femur =[-π/4,π/2], q tba =[0,*π/4]. The defned workspace wth the above lmtaton s presented n fg. 5, 6 and 7. Fg. 5. Leg workspace (XY vew). Fg. 6. Leg workspace (XZ vew).

5 The robot structure consdered has 6 dentcal legs and each leg has degree of freedom (RRR) (Fg. 9). All the relevant ponts have been put on the model as can be seen from fg. 9: coordnates of the centre of mass of each leg G, =...6; leg numberng for easy understandng ( to 6), coordnates of the centre of mass of the robot G, projecton of the centre of mass nto the support polygon G, robot s centre of symmetry wth the attached frame O R (X R,Y R, Z R ), the global frame O w (X w,y w, Z w ). The global frame s the frame that all other frames wll be defned relatve to. The global frame s rgdly attached to the lower left corner of the world so that the z-axs s vertcal and the xy-plane s algned wth the floor surface. The orgn of the robot coordnates s attached n the centre of symmetry wth the z-axs pontng up, the x-axs pontng left and the y-axs pontng forward. Fg. 7. Leg workspace (YZ vew). The leg workspace wth the mportant pont s presented n fg. 8 and syntheszed n table. Fg. 9. Hexapod robot structure Fg. 8. Leg workspace. Extreme nterest ponts. Tabel. Leg workspace Coordnates Mn Max X -7 47,2 Y -9,6 9,6 Z -22,2 49,8 Vald for l =5, l 2 =25.2, l =7 and for coxa jont coordnates (0, 5, 20) 4. Hexapod Robot Model The legged locomoton on natural terran presents a set of complex problems (foot placement, obstacle avodance, load dstrbuton, general stablty) (Krzysztof et al 2008) that must be taken nto account both n mechancal constructon of vehcles and n development of control strateges. One way to handle these ssues s usng models that mathematcally descrbe the dfferent stuatons. Therefore modelng becomes a useful tool n understandng systems complexty and for testng and smulatng dfferent control approaches (Barreto et al, Fahm 2008). The overall transformaton from global frame to each leg tp s obtaned as follows: where: T T T T coxa = (9) W W R tp R coxa tp W TR s the transformaton matrx between the global frame and the robot frame and defnes the rotaton about y,x,z (roll, ptch, yaw matrx). R Tcoxa s the transformaton matrx from the robot centre to each leg. The poston of robot s centre of mass s calculated usng the followng equatons: x m y m z m X Y Z m m m where: m L g L g L g L = = = G =,, 6 G = 6 G = 6 L L L = = = = m, m l - mass of each leg = l (20)

6 Fg. 0. Hexapod robot control nterface. 5. SIMULATION PLATFORM The man purpose of ths smulaton platform s to show how the support polygon modfes when legs lose contact wth ground and f the projecton of the centre of mass s wthn the support polygon. The smulaton program was made usng MatLab GUIDE (Bran et al 200). The developed software platform can be used to analyze what happens wth the hexapod robot n gravtatonal feld and t also allows communcaton wth the leg n real world. The analyss of the hexapod robot n gravtatonal feld can be group n two modes: - free fall mode. In ths mode the mechancal confguraton of the legs s defned by ther jonts values, no addtonal move s allowed. - transtory analyss. Ths mode s used to analyss what happens wth the robot between two statc regmes. The communcaton between the physcal leg and Matlab envronment s made usng Arduno Duemlanove development board. Gvng a set of values for legs jonts yelds a statonary mechancal confguraton whch generates a certan support polygon n relaton wth whch we analyze the gravtatonal stablty of the hexapod robot. For a certan confguraton of legs, the robot s statcally stable f the projecton of the centre of mass s nsde the support polygon; t s at stablty lmt f the projecton of the centre of mass s on one sde of the support polygon and t s statcally unstable f the projecton of the centre of mass s outsde the support polygon. In ths last case the robot s shftng gradually ts support polygon by lftng/touchng the ground wth ts legs, due to gravty, untl the condton for statc stablty s accomplshed. The shape of the support polygon needed for mnmum statc stablty s the trangle. 5. Program Interface When the nterface s launched the robot s frst drawn n a stable confguraton as shown n fg. 0. The nterface s dvded bascally nto 2 areas: n the upper left the robot s dsplayed (plotted) accordng to the values set by the user and n the upper rght and bottom we can fnd the controls for the robot. The controls for the robot are structured manly n parts: jonts control, poston control, walkng control. Jonts control and poston control conssts of a lst where the leg number t put on and a panel where the user can set the values for each jont or poston (usng drect and nverse knematcs). Walkng control consst of choosng the terran on whch the robot wll move. The terran can be choosng usng the mmedate (controls) checkboxes. The controls for each leg are encapsulated nto a panel dentfed by leg number. Every slder has an edtable textbox where the value s dsplayed and controls a certan lnk of the robot. If we use a slder the assocated edtable textbox value s updated and vce versa. Also the robot leg poston s updated wth the data from the slder

7 or from the textbox. The controls for lnk length or mass affect all the legs because they are consdered dentcal. The button label Leg Control from fg. 0 launches a second nterface lke n fg.. The second nterface allows both hardware and smulated control for a sngle leg. Ths nterface can be used both n offlne mode or onlne mode. - determne the convex polygon - determne the area of the convex polygon (A) - form the n trangle usng 2 consecutve sdes of the support polygon and the projecton of centre of mass, G, (e.g. ABG, BCG etc.) - determne the areas of the n trangles formed (A ) - f (ΣA = A) then condton=true - else condton=false 5. Hardware Leg Control Fg.. Leg control usng Arduno Duemlanove The graphcal representaton of the robot also allows seeng the shape of the support polygon whch s updated accordng to the legs on the ground. The support polygon s drawn only f the dstance from the tp of the leg to the ground s smaller than a threshold. Ths threshold s modfable (but not present n the nterface) and was ntroduced as a way to compensate certan poston errors that may occur due to real servomotors. The smulaton program shows all the stages the robot goes through for a better understandng. For smplcty and better understandng of the robot stages the model s drawn n a smpler way Smulaton Algorthm The authors have elaborated an algorthm n order to acheve the goal of analyzng the statc stablty of a hexapod robot n gravtatonal feld. The algorthm s structured n 5 steps as followng: - settng the jonts values - determne the mechancal confguraton - determne whch legs are on the ground - evaluaton of the statc stablty condton - whle (condton of statc stablty = false) - determne the rotaton lne usng the mnmum dstance from G to support polygon s sdes - rotate the robot about the lne found - determne whch legs are on the ground - evaluaton of the statc stablty condton The determnaton of statc stablty condton s resumed at fndng f the projecton of robot s centre of mass s nsde the support polygon. For ths the authors used the followng algorthm: The system proposed by the authors (Fg. 2) s smlar wth the system xpc-target component of Matlab. The software that make possble the communcaton between Arduno board and Matlab has been released wth the last verson of Matlab. Mathworks has also developed support for Arduno n Smulnk. A part of the communcaton software s uploaded on the Arduno board and plays the server role. There are two programs that can be uploaded on the board: - adosrv.pde wth whch all the nput and output of the board can be manpulated. - motorsrv.pde desgned exclusvely for motor control va a motor sheld. The major drawback of usng the orgnal motorsrv.pde was that ths fle was developed as support for a specfc motor sheld that can only control 2 servomotors. So we modfy the fle n a way that now allows usng all 6 PWM channels avalable. Arduno AtMega28 Matlab USB P W M Fg. 2. Leg control system Leg The other part s a Matlab class (arduno.m) and plays the role of the clent. Once the class s nstantated t makes possble sendng commands over USB port. The drecton of moton of the servo s automatcally determned. If we set a rotaton wth 90 0 and then a 0 0 rotaton the servo wll rotate 60 0 antclockwse. 5.4 Walkng Algorthm Durng walkng or runnng the leg move cyclcally and n order to facltate analyss or control, the moton of the leg s often parttoned n two parts: - support phase or stance, when the robot uses the leg to support and propel. - transfer phase or swng, when the leg s moved from one foothold to the next.

8 The stance part of the walkng algorthm s supposed to move the leg n a straght lne. The swng part of the algorthm must lft the leg off the ground, move t back to the startng poston and lower t down to the ground agan. The walkng algorthm s based on the knematcal model of the leg. Speed Parameters Step length Leg lft force that acts upon the robot s the gravtatonal force. For a gven set of jont values the robot passes through many transtory stages untl t becomes statcally stable (Fg. 4. a, b, and c). Legs that have contact wth the ground determne the shape of the support polygon (trangle, quadrlateral, pentagon or hexagon). In order to know f the robot acheves statc stablty the projecton of G (G ) must be nsde the support polygon. To solve ths problem the above algorthm s appled. Algorthm Walkng control Stance Swng Leg jonts Fg.. Walkng algorthm dagram Parameters ntroduce n the algorthm (Fg. ) are: - speed; defne the speed of the leg tp, - step length; defne the length of the step, - leg lft; ths defnes how hgh the leg s lfted when t s n the swng-cycle. For a smooth straght moton, the swng tme must be equal to the stance tme for each leg. In the stance part of a step, the leg only moves n a straght lne. At tme t from the start of the step, the coordnates (x, y, z) for the trajectory wll be: x= leglength steplength y= t* speed 2 z = legheght (2) In the swng part of the step, the leg frst has to be lfted of the ground, and then moved back to where the next step s supposed to start and then lowered to the ground. To fnd out where n the swng-cycle the leg s at tme t from the start of the cycle we frst have to calculate the total length the leg has to travel: (2 * leglft steplength)* t dst = swng _ cycle (22) One step conssts of one stance cycle and one swng cycle but to mantan a smooth moton of the leg, t s mportant that the swng cycle contnues where the stance cycle ended, and that the swng cycle ends where the new stance cycle starts. Ths does not only hold for the poston, but also for the speed and the drecton of the speed. 6. EXPERIMENTAL RESULTS 6. Free fall analyss The free fall analyss represents what happens wth the robot left to fall on the ground from a heght greater than the extenson of the legs. Keepng n mnd that the jonts are locked by the values prescrbed by the user, no extra movements are allowed (no actve stablty). The only Fg. 4.a: Phase one of fallng. In fg. 4.b t can be seen that even n ths confguraton G s not nsde the support polygon and the robot contnues t s fallng and rotates about the lne determned by leg 2 and leg 5 untl the frst leg touches the ground, whch n ths case, s leg. Fg. 4.b: Phase two of fallng. In fg. 4.c a new confguraton s formed and f the algorthm descrbed above t s appled, pont G s nsde the support polygon and the robot becomes statcally stable and the fallng stops. Fg. 4.c: Phase three statcally stable. 6.2 Transtory Analyss In ths mode of analyss the robot passes between two statc regmes. A statc regme s dentfed by the condton of stablty. The user can alter a statc regme usng the controls for jont values or poston of the leg tp. Ths analyss can also be nterpreted as a contnuaton

9 of free fall analyss case f the condton of stablty has been met. In fg 5.a the robot has statc stablty, the support polygon descrbed by the legs on the ground s a quadrlateral (formed by legs, 2, 5 and 6) and the projecton of the centre of mass s nsde the support polygon. 6.. Hardware Leg Control The algorthm for controllng the leg jonts, ncludng drect knematcs and nverse knematcs, was mplemented n Matlab n order to analyze leg performance. The results of the tests can be vew n the chart below. Fg. 5.a: Phase one statcally stable. Next, lftng leg 2 the support polygon changes ts shape becomng a trangle. Usng the algorthm descrbed above, the projecton of G s not nsde the support polygon and the robot becomes statcally unstable and starts fallng (Fg. 5.b). Fg. 6. Hardware leg control results. The man errors occurred due to the fact that we can only send nteger numbers for jont values. Other errors occurred due to the fact that the jont are assembled usng bolts and nuts. Normal usage of the robot causes the nuts and bolts to loosen causng a lot of clearance n the jonts. 6.4 Inclned Plane Walkng Approach The movement on nclned plane s realzed by movng one leg from one sde at the tme as can be seen from fg. 7, 8 and 9. As mpose restrctons for the robot we can enumerate the followng: the robot body must be leveled wth respect to the ground, coxa angle s set for π/4. The angle for the plane s 0 0. Fg. 5.b: Phase two: fallng Followng the algorthm the next leg closest to the ground s leg number 4. In fg. 5.c the projecton of G s nsde the newly support polygon, the robot stops fallng and becomes statcally stable. Fg. 7. Movng leg Fg. 5.c: Phase three statcally stable Fg. 8. Movng leg.

10 After ths cycle of movement the body s dragged forward agan and the algorthm resumes. Fnally the robot wth all the legs are on the nclned plane wth ts body leveled as can be seen from fg. 24. Fg. 9. Movng leg 5. Once all the legs from one sde have been moved to a new poston the robot body wll be dragged usng all the coxa jonts so that the robot can move forward (Fg. 20). Fg. 24. Fnal poston of the robot on the nclned plane. Also t can be seen the trajectory of the robot on the nclned plane. Fg. 20. Robot body drag. After the body has been dragged to the new poston the legs 2, 4 and 6 from the other sde must be moved forward (Fg. 2, 22 and 2). Fg. 25. Trajectory of the robot durng walkng Fg. 2. Movng leg Star Step Walkng Approach As wth the prevous case of movement, ths case respects the algorthm descrbe n the prevous chapter. The movement on star step s realzed by movng one leg from one sde at the tme as can be seen from fg. 26, 27 and 28. As mpose restrctons for the robot we can enumerate the followng: the robot body must be leveled wth respect to the ground, coxa angle s set for π/4. The heght of the star step s / of the heght of the robot. Fg. 22. Movng leg 4. Fg. 2. Movng leg 6. Fg. 26. Movng leg.

11 Fg. 27. Movng the leg. Fg.. Movng leg 4. Fg. 28. Movng the leg 5. Once all the legs from one sde have been moved to a new poston the robot body wll be dragged usng all the coxa jonts so that the robot can move forward (Fg. 29). Fg. 2. Movng leg 6. After ths cycle of movement the body s dragged forward agan and the algorthm resumes. Fnally the robot wth all the legs are on the star step wth ts body leveled as can be seen from fg. Fg.. Fnal poston of the robot. Fg. 29. Robot body drag Also t can be seen the trajectory of the robot on durng walkng. After the body has been dragged to the new poston the legs 2, 4 and 6 from the other sde must be moved forward (Fg. 0, and 2). Fg. 0. Movng leg 2. Fg. 4. Trajectory of the robot durng walkng

12 7. CONCLUSION In ths paper a smulaton platform for legged moble robots was presented, that allows stablty analyss and full control of the robot. Free fall analyss s useful for nvestgatng what happens wth the robot on uneven terran or for accdents that may happen due to lose of contact, slppery surface, servomotor falure, power supply falure. Transtory analyss represents a more mportant case for locomoton, gat generaton. When startng to develop a gat cycle we can have a bg pcture of what happens when the robot starts to move, how the support polygon changes and what actons (what leg should be actuated) must be appled to the robot n order to meet condton of stablty. The nterface wll be mbung wth addtonal walkng algorthms and controls. The nterface was desgned to be smple and ntutve and to offer the user a smple and effcent way to control every aspects of the robot (angles, masses, lengths, leg control). The two analyses made n ths artcle represent the bases for next actvtes on statc stablty. Hardware leg control wll be mbung to better precson. In the future the program wll be upgraded permttng addtonal controls and functons for stablty analyss (ncludng dynamc stablty) on uneven ground and mplementng collson detecton algorthms. Also the results of these studes represent the bases for dfferent strateges of locomoton on dfferent terrans. The expermental results wll become a standard for a real hexapod robot. ACKNOWLEDGMENT Ths work was partally supported by strategc grant POSDRU/88/.5/S/5078, Project ID 5078 (2009), cofnanced by the European Socal Fund Investng n People, wthn the Sectoral Operatonal Programme Human Resource Development REFERENCES Barreto J., Trgo A.,Menezes P., Das J., Knematc and dynamc modelng of a sx legged robot. Bensalem, S.,Gallen, M., Ingrand, F., Kahloul, I., Nguyen Thanh-Hung (2009), Desgnng autonomous robots, IEEE Robotcs & Automaton Magazne, Vol. 6, March Bran R., Hunt R., Lpsman L., Rosenberg J. M.,(200), A gude to MATLAB for begnners and experenced users, ISBN-I: , Cambrdge Unversty Press Carbone G., Ceccarell M., (2005), Legged robotc systems, Cuttng Edge Robotcs, ARS Scentfc Book, pp , Wen. Fahm, F. (2008), Autonomous robots: modelng, path plannng, and control, Sprnger. Krzysztof W., Domnk B., Andrzej K.,(2008) Control and envronment sensng system for a sx-legged robot, Journal of Automaton, Moble Robotcs & Intellgent Systems, Volume 2 N o. Mak K. H.(2007) Bonspraton and Robotcs:Walkng and Clmbng Robots, ISBN , I- Tech Educaton and Publshng, Croata Schllng R. J. (990), Fundamentals of robotcs: analyss and control, ISBN: , Prentce Hall, New Jersey, USA. 7S.pdf

Inverse kinematic Modeling of 3RRR Parallel Robot

Inverse kinematic Modeling of 3RRR Parallel Robot ème Congrès Franças de Mécanque Lyon, 4 au 8 Août 5 Inverse knematc Modelng of RRR Parallel Robot Ouafae HAMDOUN, Fatma Zahra BAGHLI, Larb EL BAKKALI Modelng and Smulaton of Mechancal Systems Laboratory,

More information

Analysis on the Workspace of Six-degrees-of-freedom Industrial Robot Based on AutoCAD

Analysis on the Workspace of Six-degrees-of-freedom Industrial Robot Based on AutoCAD Analyss on the Workspace of Sx-degrees-of-freedom Industral Robot Based on AutoCAD Jn-quan L 1, Ru Zhang 1,a, Fang Cu 1, Q Guan 1 and Yang Zhang 1 1 School of Automaton, Bejng Unversty of Posts and Telecommuncatons,

More information

ROBOT KINEMATICS. ME Robotics ME Robotics

ROBOT KINEMATICS. ME Robotics ME Robotics ROBOT KINEMATICS Purpose: The purpose of ths chapter s to ntroduce you to robot knematcs, and the concepts related to both open and closed knematcs chans. Forward knematcs s dstngushed from nverse knematcs.

More information

Parallel manipulator robots design and simulation

Parallel manipulator robots design and simulation Proceedngs of the 5th WSEAS Int. Conf. on System Scence and Smulaton n Engneerng, Tenerfe, Canary Islands, Span, December 16-18, 26 358 Parallel manpulator robots desgn and smulaton SAMIR LAHOUAR SAID

More information

DESIGN OF A HAPTIC DEVICE FOR EXCAVATOR EQUIPPED WITH CRUSHER

DESIGN OF A HAPTIC DEVICE FOR EXCAVATOR EQUIPPED WITH CRUSHER DESIGN OF A HAPTIC DEVICE FOR EXCAVATOR EQUIPPED WITH CRUSHER Kyeong Won Oh, Dongnam Km Korea Unversty, Graduate School 5Ga-1, Anam-Dong, Sungbuk-Gu, Seoul, Korea {locosk, smleast}@korea.ac.kr Jong-Hyup

More information

Overview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION

Overview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Overvew 2 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Introducton Mult- Smulator MASIM Theoretcal Work and Smulaton Results Concluson Jay Wagenpfel, Adran Trachte Motvaton and Tasks Basc Setup

More information

Support Vector Machines

Support Vector Machines /9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.

More information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,

More information

Kinematics of pantograph masts

Kinematics of pantograph masts Abstract Spacecraft Mechansms Group, ISRO Satellte Centre, Arport Road, Bangalore 560 07, Emal:bpn@sac.ernet.n Flght Dynamcs Dvson, ISRO Satellte Centre, Arport Road, Bangalore 560 07 Emal:pandyan@sac.ernet.n

More information

INVERSE DYNAMICS ANALYSIS AND SIMULATION OF A CLASS OF UNDER- CONSTRAINED CABLE-DRIVEN PARALLEL SYSTEM

INVERSE DYNAMICS ANALYSIS AND SIMULATION OF A CLASS OF UNDER- CONSTRAINED CABLE-DRIVEN PARALLEL SYSTEM U.P.B. Sc. Bull., Seres D, Vol. 78, Iss., 6 ISSN 454-58 INVERSE DYNAMICS ANALYSIS AND SIMULATION OF A CLASS OF UNDER- CONSTRAINED CABLE-DRIVEN PARALLEL SYSTEM We LI, Zhgang ZHAO, Guangtan SHI, Jnsong LI

More information

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour 6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the

More information

3D vector computer graphics

3D vector computer graphics 3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres

More information

ON THE DESIGN OF LARGE SCALE REDUNDANT PARALLEL MANIPULATOR. Wu huapeng, Heikki handroos and Juha kilkki

ON THE DESIGN OF LARGE SCALE REDUNDANT PARALLEL MANIPULATOR. Wu huapeng, Heikki handroos and Juha kilkki ON THE DESIGN OF LARGE SCALE REDUNDANT PARALLEL MANIPULATOR Wu huapeng, Hekk handroos and Juha klkk Machne Automaton Lab, Lappeenranta Unversty of Technology LPR-5385 Fnland huapeng@lut.f, handroos@lut.f,

More information

The motion simulation of three-dof parallel manipulator based on VBAI and MATLAB Zhuo Zhen, Chaoying Liu* and Xueling Song

The motion simulation of three-dof parallel manipulator based on VBAI and MATLAB Zhuo Zhen, Chaoying Liu* and Xueling Song Internatonal Conference on Automaton, Mechancal Control and Computatonal Engneerng (AMCCE 25) he moton smulaton of three-dof parallel manpulator based on VBAI and MALAB Zhuo Zhen, Chaoyng Lu* and Xuelng

More information

Programming in Fortran 90 : 2017/2018

Programming in Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values

More information

Accounting for the Use of Different Length Scale Factors in x, y and z Directions

Accounting for the Use of Different Length Scale Factors in x, y and z Directions 1 Accountng for the Use of Dfferent Length Scale Factors n x, y and z Drectons Taha Soch (taha.soch@kcl.ac.uk) Imagng Scences & Bomedcal Engneerng, Kng s College London, The Rayne Insttute, St Thomas Hosptal,

More information

Pose, Posture, Formation and Contortion in Kinematic Systems

Pose, Posture, Formation and Contortion in Kinematic Systems Pose, Posture, Formaton and Contorton n Knematc Systems J. Rooney and T. K. Tanev Department of Desgn and Innovaton, Faculty of Technology, The Open Unversty, Unted Kngdom Abstract. The concepts of pose,

More information

A Binarization Algorithm specialized on Document Images and Photos

A Binarization Algorithm specialized on Document Images and Photos A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a

More information

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges

More information

Load Balancing for Hex-Cell Interconnection Network

Load Balancing for Hex-Cell Interconnection Network Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,

More information

The Codesign Challenge

The Codesign Challenge ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.

More information

Kinematics Modeling and Analysis of MOTOMAN-HP20 Robot

Kinematics Modeling and Analysis of MOTOMAN-HP20 Robot nd Workshop on Advanced Research and Technolog n Industr Applcatons (WARTIA ) Knematcs Modelng and Analss of MOTOMAN-HP Robot Jou Fe, Chen Huang School of Mechancal Engneerng, Dalan Jaotong Unverst, Dalan,

More information

Sensory Redundant Parallel Mobile Mechanism

Sensory Redundant Parallel Mobile Mechanism Sensory Redundant Parallel Moble Mechansm Shraga Shoval and Moshe Shoham* Department of Industral Engneerng & Management, Academc College of Judea and Samara, Arel., *Faculty of Mechancal Engneerng, Technon,

More information

Numerical model describing optimization of fibres winding process on open and closed frame

Numerical model describing optimization of fibres winding process on open and closed frame Journal of Physcs: Conference Seres PAPER OPEN ACCESS Numercal model descrbng optmzaton of fbres wndng process on open and closed frame To cte ths artcle: M Petr et al 06 J Phys: Conf Ser 738 0094 Vew

More information

WORKSPACE OPTIMIZATION OF ORIENTATIONAL 3-LEGGED UPS PARALLEL PLATFORMS

WORKSPACE OPTIMIZATION OF ORIENTATIONAL 3-LEGGED UPS PARALLEL PLATFORMS Proceedngs of DETC 02 ASME 2002 Desgn Engneerng Techncal Conferences and Computers and Informaton n Engneerng Conference Montreal, Canada, September 29-October 2, 2002 DETC2002/MECH-34366 WORKSPACE OPTIMIZATION

More information

Solving two-person zero-sum game by Matlab

Solving two-person zero-sum game by Matlab Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by

More information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism for Nested Loops with Non-uniform and Flow Dependences Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr

More information

Mathematics 256 a course in differential equations for engineering students

Mathematics 256 a course in differential equations for engineering students Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the

More information

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana

More information

CMPS 10 Introduction to Computer Science Lecture Notes

CMPS 10 Introduction to Computer Science Lecture Notes CPS 0 Introducton to Computer Scence Lecture Notes Chapter : Algorthm Desgn How should we present algorthms? Natural languages lke Englsh, Spansh, or French whch are rch n nterpretaton and meanng are not

More information

Cluster Analysis of Electrical Behavior

Cluster Analysis of Electrical Behavior Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School

More information

Hermite Splines in Lie Groups as Products of Geodesics

Hermite Splines in Lie Groups as Products of Geodesics Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the

More information

Distance Calculation from Single Optical Image

Distance Calculation from Single Optical Image 17 Internatonal Conference on Mathematcs, Modellng and Smulaton Technologes and Applcatons (MMSTA 17) ISBN: 978-1-6595-53-8 Dstance Calculaton from Sngle Optcal Image Xao-yng DUAN 1,, Yang-je WEI 1,,*

More information

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide Lobachevsky State Unversty of Nzhn Novgorod Polyhedron Quck Start Gude Nzhn Novgorod 2016 Contents Specfcaton of Polyhedron software... 3 Theoretcal background... 4 1. Interface of Polyhedron... 6 1.1.

More information

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces Range mages For many structured lght scanners, the range data forms a hghly regular pattern known as a range mage. he samplng pattern s determned by the specfc scanner. Range mage regstraton 1 Examples

More information

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and

More information

Computational Issues in the Planning and Kinematics of Binary Robots Abstract 1. Introduction 2. Workspace Analysis and Optimization

Computational Issues in the Planning and Kinematics of Binary Robots Abstract 1. Introduction 2. Workspace Analysis and Optimization Computatonal Issues n the Plannng and Knematcs of Bnary Robots Matthew D. Lchter, Vvek A. Sujan, and Steven Dubowsky { lchter vasujan dubowsky@mt.edu } Department of Mechancal Engneerng Massachusetts Insttute

More information

Analysis of Continuous Beams in General

Analysis of Continuous Beams in General Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,

More information

Virtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory

Virtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory Background EECS. Operatng System Fundamentals No. Vrtual Memory Prof. Hu Jang Department of Electrcal Engneerng and Computer Scence, York Unversty Memory-management methods normally requres the entre process

More information

Brave New World Pseudocode Reference

Brave New World Pseudocode Reference Brave New World Pseudocode Reference Pseudocode s a way to descrbe how to accomplsh tasks usng basc steps lke those a computer mght perform. In ths week s lab, you'll see how a form of pseudocode can be

More information

On Some Entertaining Applications of the Concept of Set in Computer Science Course

On Some Entertaining Applications of the Concept of Set in Computer Science Course On Some Entertanng Applcatons of the Concept of Set n Computer Scence Course Krasmr Yordzhev *, Hrstna Kostadnova ** * Assocate Professor Krasmr Yordzhev, Ph.D., Faculty of Mathematcs and Natural Scences,

More information

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed

More information

Dynamic wetting property investigation of AFM tips in micro/nanoscale

Dynamic wetting property investigation of AFM tips in micro/nanoscale Dynamc wettng property nvestgaton of AFM tps n mcro/nanoscale The wettng propertes of AFM probe tps are of concern n AFM tp related force measurement, fabrcaton, and manpulaton technques, such as dp-pen

More information

TN348: Openlab Module - Colocalization

TN348: Openlab Module - Colocalization TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages

More information

Modeling Concave Globoidal Cam with Swinging Roller Follower: A Case Study

Modeling Concave Globoidal Cam with Swinging Roller Follower: A Case Study Modelng Concave Globodal Cam wth Swngng Roller Follower: A Case Study Nguyen Van Tuong, and Premysl Pokorny Abstract Ths paper descrbes a computer-aded desgn for desgn of the concave globodal cam wth cylndrcal

More information

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty

More information

Multiblock method for database generation in finite element programs

Multiblock method for database generation in finite element programs Proc. of the 9th WSEAS Int. Conf. on Mathematcal Methods and Computatonal Technques n Electrcal Engneerng, Arcachon, October 13-15, 2007 53 Multblock method for database generaton n fnte element programs

More information

Simulation Based Analysis of FAST TCP using OMNET++

Simulation Based Analysis of FAST TCP using OMNET++ Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months

More information

Hierarchical clustering for gene expression data analysis

Hierarchical clustering for gene expression data analysis Herarchcal clusterng for gene expresson data analyss Gorgo Valentn e-mal: valentn@ds.unm.t Clusterng of Mcroarray Data. Clusterng of gene expresson profles (rows) => dscovery of co-regulated and functonally

More information

3-Wheel Swerve Drive - The Trouble with Tribots

3-Wheel Swerve Drive - The Trouble with Tribots 3-Wheel Swerve Drve - The Trouble wth Trbots Clem McKown - FRC Team 1640 17-August-2014 Executve Summary FRC's 2013 change n robot permeter rules (to 112 nch maxmum overall permeter from the earler maxmum

More information

VRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) , Fax: (370-5) ,

VRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) , Fax: (370-5) , VRT012 User s gude V0.1 Thank you for purchasng our product. We hope ths user-frendly devce wll be helpful n realsng your deas and brngng comfort to your lfe. Please take few mnutes to read ths manual

More information

CS 534: Computer Vision Model Fitting

CS 534: Computer Vision Model Fitting CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust

More information

Computer Animation and Visualisation. Lecture 4. Rigging / Skinning

Computer Animation and Visualisation. Lecture 4. Rigging / Skinning Computer Anmaton and Vsualsaton Lecture 4. Rggng / Sknnng Taku Komura Overvew Sknnng / Rggng Background knowledge Lnear Blendng How to decde weghts? Example-based Method Anatomcal models Sknnng Assume

More information

Anytime Predictive Navigation of an Autonomous Robot

Anytime Predictive Navigation of an Autonomous Robot Anytme Predctve Navgaton of an Autonomous Robot Shu Yun Chung Department of Mechancal Engneerng Natonal Tawan Unversty Tape, Tawan Emal shuyun@robot0.me.ntu.edu.tw Abstract To acheve fully autonomous moble

More information

Problem Set 3 Solutions

Problem Set 3 Solutions Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,

More information

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009. Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton

More information

Design and Implementation of Trainable Robotic Arm

Design and Implementation of Trainable Robotic Arm Internatonal Journal of Scence, Engneerng and Technology Research (IJSETR) Desgn and Implementaton of Tranable Robotc Arm Mo Mo Aung 1, Saw Aung Nyen Oo 2 1 Master Canddate, Department of Electronc Engneerng,

More information

3D Virtual Eyeglass Frames Modeling from Multiple Camera Image Data Based on the GFFD Deformation Method

3D Virtual Eyeglass Frames Modeling from Multiple Camera Image Data Based on the GFFD Deformation Method NICOGRAPH Internatonal 2012, pp. 114-119 3D Vrtual Eyeglass Frames Modelng from Multple Camera Image Data Based on the GFFD Deformaton Method Norak Tamura, Somsangouane Sngthemphone and Katsuhro Ktama

More information

Genetic Tuning of Fuzzy Logic Controller for a Flexible-Link Manipulator

Genetic Tuning of Fuzzy Logic Controller for a Flexible-Link Manipulator Genetc Tunng of Fuzzy Logc Controller for a Flexble-Lnk Manpulator Lnda Zhxa Sh Mohamed B. Traba Department of Mechancal Unversty of Nevada, Las Vegas Department of Mechancal Engneerng Las Vegas, NV 89154-407

More information

Optimized motion planning of manipulators in partially-known environment using modified D* Lite algorithm

Optimized motion planning of manipulators in partially-known environment using modified D* Lite algorithm Optmzed moton plannng of manpulators n partally-known envronment usng modfed D* Lte algorthm AMIR FEIZOLLAHI and RENE V. MAYORGA Department of Industral Systems Engneerng Unversty of Regna 3737 Wascana

More information

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique //00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy

More information

An Optimal Algorithm for Prufer Codes *

An Optimal Algorithm for Prufer Codes * J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,

More information

APPLICATION OF AN AUGMENTED REALITY SYSTEM FOR DISASTER RELIEF

APPLICATION OF AN AUGMENTED REALITY SYSTEM FOR DISASTER RELIEF APPLICATION OF AN AUGMENTED REALITY SYSTEM FOR DISASTER RELIEF Johannes Leebmann Insttute of Photogrammetry and Remote Sensng, Unversty of Karlsruhe (TH, Englerstrasse 7, 7618 Karlsruhe, Germany - leebmann@pf.un-karlsruhe.de

More information

ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE

ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE Yordzhev K., Kostadnova H. Інформаційні технології в освіті ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE Yordzhev K., Kostadnova H. Some aspects of programmng educaton

More information

Biostatistics 615/815

Biostatistics 615/815 The E-M Algorthm Bostatstcs 615/815 Lecture 17 Last Lecture: The Smplex Method General method for optmzaton Makes few assumptons about functon Crawls towards mnmum Some recommendatons Multple startng ponts

More information

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques

More information

Efficient Distributed File System (EDFS)

Efficient Distributed File System (EDFS) Effcent Dstrbuted Fle System (EDFS) (Sem-Centralzed) Debessay(Debsh) Fesehaye, Rahul Malk & Klara Naherstedt Unversty of Illnos-Urbana Champagn Contents Problem Statement, Related Work, EDFS Desgn Rate

More information

Step-3 New Harmony vector, improvised based on the following three mechanisms: (1) random selection, (2) memory consideration, and (3)

Step-3 New Harmony vector, improvised based on the following three mechanisms: (1) random selection, (2) memory consideration, and (3) Optmal synthess of a Path Generator Lnkage usng Non Conventonal Approach Mr. Monsh P. Wasnk 1, Prof. M. K. Sonpmple 2, Prof. S. K. Undrwade 3 1 M-Tech MED Pryadarshn College of Engneerng, Nagpur 2,3 Mechancal

More information

Head-Raising of Snake Robots Based on a Predefined Spiral Curve Method

Head-Raising of Snake Robots Based on a Predefined Spiral Curve Method Artcle Head-Rasng of Snake Robots Based on a Predefned Spral Curve Method Xaobo Zhang 1,2,3, Jnguo Lu 1,2, *, Zhaoje Ju 1,2,4 and Chenguang Yang 5 1 State Key Laboratory of Robotcs, Shenyang Insttute of

More information

Six-axis Robot Manipulator Numerical Control Programming and Motion Simulation

Six-axis Robot Manipulator Numerical Control Programming and Motion Simulation 2016 Internatonal Conference on Appled Mechancs, Mechancal and Materals Engneerng (AMMME 2016) ISBN: 978-1-60595-409-7 S-as Robot Manpulator Numercal Control Programmng and Moton Smulaton Chen-hua SHE

More information

VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES

VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES UbCC 2011, Volume 6, 5002981-x manuscrpts OPEN ACCES UbCC Journal ISSN 1992-8424 www.ubcc.org VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES

More information

Resolving Ambiguity in Depth Extraction for Motion Capture using Genetic Algorithm

Resolving Ambiguity in Depth Extraction for Motion Capture using Genetic Algorithm Resolvng Ambguty n Depth Extracton for Moton Capture usng Genetc Algorthm Yn Yee Wa, Ch Kn Chow, Tong Lee Computer Vson and Image Processng Laboratory Dept. of Electronc Engneerng The Chnese Unversty of

More information

AADL : about scheduling analysis

AADL : about scheduling analysis AADL : about schedulng analyss Schedulng analyss, what s t? Embedded real-tme crtcal systems have temporal constrants to meet (e.g. deadlne). Many systems are bult wth operatng systems provdng multtaskng

More information

A New Approach For the Ranking of Fuzzy Sets With Different Heights

A New Approach For the Ranking of Fuzzy Sets With Different Heights New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays

More information

XV International PhD Workshop OWD 2013, October Machine Learning for the Efficient Control of a Multi-Wheeled Mobile Robot

XV International PhD Workshop OWD 2013, October Machine Learning for the Efficient Control of a Multi-Wheeled Mobile Robot XV Internatonal PhD Workshop OWD 203, 9 22 October 203 Machne Learnng for the Effcent Control of a Mult-Wheeled Moble Robot Uladzmr Dzomn, Brest State Techncal Unversty (prof. Vladmr Golovko, Brest State

More information

Smoothing Spline ANOVA for variable screening

Smoothing Spline ANOVA for variable screening Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory

More information

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster

More information

Stability and Gait Planning of 3-UPU Hexapod Walking Robot

Stability and Gait Planning of 3-UPU Hexapod Walking Robot Artcle Stablty and Gat Plannng of 3-UPU Hexapod Walkng Robot Ruqn L *, Hongwe Meng, Shaopng Ba, Ynyn Yao, Janwe Zhang,3 School of Mechancal Engneerng, North Unversty of Chna, ayuan 03005, Chna; Department

More information

A proposal for the motion analysis method of skiing turn by measurement of orientation and gliding trajectory

A proposal for the motion analysis method of skiing turn by measurement of orientation and gliding trajectory Avalable onlne at www.scencedrect.com Proceda Engneerng 13 (211) 17 22 5 th Asa-Pacfc Congress on Sports Technology (APCST) A proposal for the moton analyss method of skng turn by measurement of orentaton

More information

PHYSICS-ENHANCED L-SYSTEMS

PHYSICS-ENHANCED L-SYSTEMS PHYSICS-ENHANCED L-SYSTEMS Hansrud Noser 1, Stephan Rudolph 2, Peter Stuck 1 1 Department of Informatcs Unversty of Zurch, Wnterthurerstr. 190 CH-8057 Zurch Swtzerland noser(stuck)@f.unzh.ch, http://www.f.unzh.ch/~noser(~stuck)

More information

Load-Balanced Anycast Routing

Load-Balanced Anycast Routing Load-Balanced Anycast Routng Chng-Yu Ln, Jung-Hua Lo, and Sy-Yen Kuo Department of Electrcal Engneerng atonal Tawan Unversty, Tape, Tawan sykuo@cc.ee.ntu.edu.tw Abstract For fault-tolerance and load-balance

More information

Outline. Self-Organizing Maps (SOM) US Hebbian Learning, Cntd. The learning rule is Hebbian like:

Outline. Self-Organizing Maps (SOM) US Hebbian Learning, Cntd. The learning rule is Hebbian like: Self-Organzng Maps (SOM) Turgay İBRİKÇİ, PhD. Outlne Introducton Structures of SOM SOM Archtecture Neghborhoods SOM Algorthm Examples Summary 1 2 Unsupervsed Hebban Learnng US Hebban Learnng, Cntd 3 A

More information

MATHEMATICS FORM ONE SCHEME OF WORK 2004

MATHEMATICS FORM ONE SCHEME OF WORK 2004 MATHEMATICS FORM ONE SCHEME OF WORK 2004 WEEK TOPICS/SUBTOPICS LEARNING OBJECTIVES LEARNING OUTCOMES VALUES CREATIVE & CRITICAL THINKING 1 WHOLE NUMBER Students wll be able to: GENERICS 1 1.1 Concept of

More information

Lecture 5: Multilayer Perceptrons

Lecture 5: Multilayer Perceptrons Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented

More information

Kent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming

Kent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming CS 4/560 Desgn and Analyss of Algorthms Kent State Unversty Dept. of Math & Computer Scence LECT-6 Dynamc Programmng 2 Dynamc Programmng Dynamc Programmng, lke the dvde-and-conquer method, solves problems

More information

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements Module 3: Element Propertes Lecture : Lagrange and Serendpty Elements 5 In last lecture note, the nterpolaton functons are derved on the bass of assumed polynomal from Pascal s trangle for the fled varable.

More information

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between

More information

CSCI 104 Sorting Algorithms. Mark Redekopp David Kempe

CSCI 104 Sorting Algorithms. Mark Redekopp David Kempe CSCI 104 Sortng Algorthms Mark Redekopp Davd Kempe Algorthm Effcency SORTING 2 Sortng If we have an unordered lst, sequental search becomes our only choce If we wll perform a lot of searches t may be benefcal

More information

VFH*: Local Obstacle Avoidance with Look-Ahead Verification

VFH*: Local Obstacle Avoidance with Look-Ahead Verification 2000 IEEE Internatonal Conference on Robotcs and Automaton, San Francsco, CA, Aprl 24-28, 2000, pp. 2505-25 VFH*: Local Obstacle Avodance wth Look-Ahead Verfcaton Iwan Ulrch and Johann Borensten The Unversty

More information

12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification

12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification Introducton to Artfcal Intellgence V22.0472-001 Fall 2009 Lecture 24: Nearest-Neghbors & Support Vector Machnes Rob Fergus Dept of Computer Scence, Courant Insttute, NYU Sldes from Danel Yeung, John DeNero

More information

SUMMARY... I TABLE OF CONTENTS...II INTRODUCTION...

SUMMARY... I TABLE OF CONTENTS...II INTRODUCTION... Summary A follow-the-leader robot system s mplemented usng Dscrete-Event Supervsory Control methods. The system conssts of three robots, a leader and two followers. The dea s to get the two followers to

More information

Wishing you all a Total Quality New Year!

Wishing you all a Total Quality New Year! Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma

More information

X- Chart Using ANOM Approach

X- Chart Using ANOM Approach ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are

More information

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,

More information

Reducing Frame Rate for Object Tracking

Reducing Frame Rate for Object Tracking Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg

More information

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data Malaysan Journal of Mathematcal Scences 11(S) Aprl : 35 46 (2017) Specal Issue: The 2nd Internatonal Conference and Workshop on Mathematcal Analyss (ICWOMA 2016) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES

More information

ELEC 377 Operating Systems. Week 6 Class 3

ELEC 377 Operating Systems. Week 6 Class 3 ELEC 377 Operatng Systems Week 6 Class 3 Last Class Memory Management Memory Pagng Pagng Structure ELEC 377 Operatng Systems Today Pagng Szes Vrtual Memory Concept Demand Pagng ELEC 377 Operatng Systems

More information

Quick error verification of portable coordinate measuring arm

Quick error verification of portable coordinate measuring arm Quck error verfcaton of portable coordnate measurng arm J.F. Ouang, W.L. Lu, X.H. Qu State Ke Laborator of Precson Measurng Technolog and Instruments, Tanjn Unverst, Tanjn 7, Chna Tel.: + 86 [] 7-8-99

More information

Computer models of motion: Iterative calculations

Computer models of motion: Iterative calculations Computer models o moton: Iteratve calculatons OBJECTIVES In ths actvty you wll learn how to: Create 3D box objects Update the poston o an object teratvely (repeatedly) to anmate ts moton Update the momentum

More information

Module Management Tool in Software Development Organizations

Module Management Tool in Software Development Organizations Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,

More information