Dynamic Networks for Motion Planning in Multi-Robot Space Systems
|
|
- Horace Weaver
- 6 years ago
- Views:
Transcription
1 Proceeding of he 7 h Inernaional Symposium on Arificial Inelligence, Roboics and Auomaion in Space: i-sairas 2003, NARA, Japan, May 19-23, 2003 Dynamic Neworks for Moion Planning in Muli-Robo Space Sysems Chrisopher M. Clark & Sephen M. Rock Aerospace Roboics Lab Deparmen of Aeronauics & Asronauics Sanford Universiy {chrisc, rock}@sun-valley.sanford.edu Jean-Claude Laombe Deparmen of Compuer Science Sanford Universy laombe@cs.sanford.edu KeyWords: Moion Planning, Roboics, Neworks ABSTRACT A new moion planning framework is presened ha enables muliple mobile robos wih limied ranges of sensing and communicaion o maneuver and achieve goals safely in dynamic environmens. The framework is applicable o boh planeary rover and free-floaing space robo applicaions. To combine he respecive advanages of cenralized and decenralized planning, his framework is based on he concep of cenralized planning wihin dynamic robo neworks. As he robos move in heir environmen, localized robo groups form neworks, wihin which world models and robo goals can be shared. Whenever a nework is formed, new informaion becomes available o all robos in his nework. Wih his new informaion, each robo uses a fas, cenralized planner o compue new coordinaed rajecories on he fly. Planning over muliple robo neworks is decenralized and disribued. The applicabiliy of he framework o planeary rovers is demonsraed in boh simulaions and real robo experimens. Also, he framework s applicabiliy o free-floaing robos in a 3D space environmen is demonsraed in simulaion. 1. INTRODUCTION Conceps for fuure space roboic sysems involve many robos under he direcion of a few human operaors, (e.g. assembly of large space srucures [1], humanrobo colonies [24]). To enable his ype of humanrobo operaion, robos mus be given a high degree of auonomy for compleing asks. Many challenges mus be overcome o achieve his level of auonomy. This research focuses on one of hese challenges: muli-robo moion planning. When many robos operae in he same environmen, high-level moion planning is required for he robos o accomplish asks auonomously. They mus be able o reach heir goals while avoiding collisions among hemselves and wih saic and moving obsacles. In unknown or parially known environmens, i is unlikely ha a sysem of sensors can provide global knowledge. In addiion, coninuous iner-robo communicaion is usually no feasible. Insead, only robos ha are sufficienly close o each oher can exchange informaion, e.g., share heir goals and local world models. This paper inroduces a new planning framework ha explois he changing communicaion links beween robos, as he robos move, o combine he respecive advanages of cenralized and decenralized planning. Figure 1: Moion Planning for 4 free-floaing robos in a 3D space environmen. Yellow lines denoe robo rajecories ha end a goal locaions denoed by red cube laices. The large gray cubes denoe obsacles. More precisely, our approach is based on dynamic robo neworks ha are capable of: 1) forming dynamically whenever communicaion and sensing capabiliies permi; 2) sharing world models and robo goals wihin each nework; and 3) consrucing on he fly coordinaed rajecories for all robos in each nework using a fas cenralized moion planner. A brief overview of his approach is presened in Secion 2. Then, a background review (Secion 3) jusifies he choices made in our approach. We hen describe some aspecs of our framework in more deail, namely he represenaion of parial world models (Secion 4) and he planning echnique used (Secion 5). Secion 6 presens he Micro-Auonomous RoverS (MARS) es-plaform and discusses experimens involving rovers in a 2D workspace. In Secion 7, resuls from free-floaing space robo simulaions are provided. 2. PLANNING IN DYNAMIC NETWORKS 2.1 Nework Formaion When any wo robos are wihin communicaion range of each oher, hey esablish a communicaion link. Define G o be he graph whose nodes are he robos and edges are he communicaion links. A nework of robos is any group of k 1 robos forming a maximal conneced componen of G. So, any wo robos in a nework can communicae hrough one or several communicaion links, bu wo robos from differen neworks can no.
2 Figure 2a shows an environmen wih 5 robos, where 2 neworks have formed. In Ne1, he op and boom robos can exchange informaion via heir communicaion links wih he middle robo. Because robos are moving o achieve heir goal locaions, he neworks are dynamic. Robos may leave neworks and/or form new neworks (see Figure 2b). An applicaion level proocol ensures ha a any ime robos in each nework can access he local sensing informaion of all oher robos in he same nework, and hence share a common world model. Ne 0 Ne 1 Ne 2 a) All hree robos (grey circles) are a heir iniial locaions. The wo lef robos are in communicaion range and form a nework. Their cenralized planners creae coordinaed collision-free rajecories for hem oward he goals (crosshairs). The righ robo forms a nework by iself, and is rajecory is planned independenly from he oher wo. The robos sar moving along hese rajecories. a) b) Figure 2: Example wih 5 robos. Dashed lines beween robos depic communicaion links. In a) he robos form wo disinc neworks Ne0 and Ne1. In b), wo robos have moved, and he wo neworks in a) have merged ino Ne2. b) As he robos move along heir rajecories, he middle robo and he righ robo ener communicaion range wih each oher, and all hree robos now form a larger nework. 2.2 Planning Process Moion planning in a nework N is riggered by any one of he following evens: N jus go formed, i.e., wo robos from differen neworks enered one anoher s communicaion range. A significan change in he world model occurs, e.g., a robo in N senses a new obsacle. c) A new plan is made for all hree robos in he nework. This plan consiss of collision-free rajecories for all hree robos. A new goal locaion is requesed for one or several robos in N. When such a riggering even occurs, daa is exchanged beween he robos in N, so ha each one ges an updaed world model ha combines he local world model and goal of every robo. Once robos have shared his informaion, each robo runs is own copy of a cenralized moion planner o consruc coordinaed rajecories for all robos in he nework. When he planner erminaes, each robo broadcass is plan o all oher robos in he nework. Each robo selecs he same bes plan and immediaely sars execuing is rajecory in his plan. The planner is a single-query probabilisicroadmap (PRM) planner similar o he one presened in [14] (see Secion 5). This process is illusraed in Figure 3 on a simple example involving 3 robos, wih no obsacles. A riggering even auomaically occurs a he sar of he process, as he firs neworks ge formed. Since robos also have limied sensing, he world model shared hrough a nework is parial. Planning is done using his model. As robos move, heir sensors may deec previously unknown obsacles or a change in he rajecory followed by a known obsacle. Such an even riggers a re-plan operaion wihin he nework where he new obsacle or change of rajecory was deeced. d) As robos move along heir new rajecories, hey leave communicaion range of each oher and some nework links are broken. They keep following he planned rajecories. Figure 3: Top-down view of a planning example wih hree robos. In each of he fours snapshos, he illusraion on he lef shows he robos on heir rajecories o heir respecive goals (cross-hairs). The diagram on he righ depics he communicaion range of each robo and he exising communicaion links. 3. BACKGROUND REVIEW Mos previous work on muli-robo moion planning can be grouped ino cenralized and decenralized planning [3,27]. While cenralized planning considers all robos ogeher as if hey were forming a single muli-body robo [5,8,26,19,30,31], a decenralized planner plans for each robo separaely before coordinaing he individual plans by uning he robo velociies along heir respecive pahs [2,4,11,16,17,22,25,29]. A varian of decenralized, called prioriizing planning, plans for one robo a a ime, in some sequence, considering he robos whose rajecories have already been planned as moving obsacles [6,12].
3 Cenralized planners can be advanageous because hey allow he possibiliy of compleeness and global opimizaion. For example, i was shown in [27] ha a cenralized planner based on PRM echniques can reliably solve problems requiring he igh coordinaion of muliple ariculaed arms, while decenralized planners based on similar PRM echniques fail ofen. On he oher hand, cenralized planning may ake more ime due o he high dimensionaliy of he configuraion spaces ha are searched. A worse drawback is ha hey require all informaion (parial world models and robo goals) o be cenralized in one single place, which is only possible if he robos have unlimied communicaion abiliies. This is no he case in many pracical seings. A major advanage of decenralized planning is ha i allows for disribued planning. Each robo can hen plan is own rajecory using is own parial model of he environmen. If wo robos evenually ge close o one anoher and risk colliding, simple velociy-uning echniques or oher reacive echniques can be used o locally coordinae heir moions. However, such a fully disribued approach fails o exploi he fac ha localized groups of robos can exchange informaion o improve planning By searching several configuraion spaces of smaller dimensionaliy, decenralized planning is poenially less compuaionally inensive. Bu i canno offer any compleeness or opimaliy guaranee. Various aemps have been made o improve he oucome of decenralized planners (e.g., [4,6,13]). In paricular, a negoiaion scheme beween localized groups of robos is used in [4] o assign prioriy orders o robos, which allow he decenralized planner o compue rajecories of reduced lenghs. This negoiaion scheme demonsraes he benefis of localized iner-robo communicaion, and is he echnique mos closely relaed o he robo nework planning framework presened in his paper. However de-cenralized planning remains inrinsically incomplee. The planning approach presened in his paper explois he respecive advanages of cenralized and decenralized planning. In each robo nework, i uses a cenralized single-query PRM planner o increase compleeness and sill provide fas on-he-fly planning. However, planning is disribued over he various neworks hence, planning over muliple neworks is decenralized o accommodae he fac ha robos from differen neworks canno share informaion. The riggering even caused by he merging of wo previously disinc neworks ino a single nework leads he robos in his new nework o ake advanage of he informaion hey now share by cenrally re-planning heir coordinaed rajecories. Planning wih incomplee world models and on-he-fly re-planning when a sensor deecs he presence of a sill unknown obsacle or a change in an obsacle s rajecory have previously been described in [14, 18] for a single robo. We use similar echniques, bu exend hem o muliple robo neworks. 4. WORLD MODEL Describing he world model in a concise bu useful form is necessary o allow for informaion sharing beween robos in he same nework. In he experimenal sysem ha we have buil, world models simply consis of a lis of robos and heir descripions, and a lis of obsacles and heir descripions. The following able oulines he informaion sored in each lis: World Model Descripion 1) Lis of Robo Descripions - Sae (posiion and velociy) - Size (Radius) - Mos Recen Updae Time - Informaion Source - Goal posiion - Curren Trajecory 2) Lis of Obsacle Descripions - Sae (posiion and velociy) - Size (Radius) - Mos Recen Updae Time - Informaion Source Robos repor heir own size and sae, while obsacle sizes and saes are esimaed by robo sensors. The mos recen updae ime is useful when updaing world models wih informaion received from oher robos. The informaion source is a robo idenificaion number ha indicaes which robo sensed (or communicaed wih) he objec. I is used o keep rack of which robos are currenly in he nework. Several assumpions were made o allow such a concise world model: Each robo has access o is own sae relaive o a global coordinae sysem (e.g., GPS). Each objec is approximaed as a circular objec o allow is geomery o be described by a single parameer, is radius. Each obsacle has consan linear velociy esimaed by a robo s sensor. As in [11], if a any laer ime is rajecory is found o diverge by more han some hreshold from he prediced rajecory (eiher because he obsacle did no move a consan velociy, or because he error in he velociy esimae was oo high), hen he robo ha deecs his divergence calls for he consrucion of a new plan wihin is nework. The planner grows he obsacles (and he robos) o allow for some errors in prediced rajecories of he objecs. All objecs in he environmen are easily idenifiable by robo sensors, which can also precisely esimae heir posiions and velociies. Any discrepancy beween wo local world models can be easily resolved.
4 The second assumpion is raher easy o eliminae, as i has been shown before ha PRM planners can efficienly deal wih geomerically complex robos and obsacles (e.g., [26]). In [14], he hird assumpion has been shown o be quie reasonable, even when obsacle velociies change frequenly, provided ha (re-) planning is fas enough. The las assumpion is more crucial. In our experimenal sysem, i is enforced by engineering he vision sysem appropriaely (see Secion 6.2). In he fuure, i will be imporan o relax his assumpion by using more general sensing sysems and daa fusion echniques [23]. 5. MOTION PLANNING ALGORITHM As indicaed earlier, moion planning wihin a robo nework is done using a cenralized single-query PRM planner (more precisely, several copies of his planner running in parallel). This planner searches he join sae ime space C of he k robos in his nework. The sae of each robo is defined by he wo coordinaes of is cener and wo velociy parameers, so C has 4k+1 dimensions. This represenaion can easily be exended o oher robos. For insance, we have implemened a version of he planner for robos in hree-dimensional space [10]. The planner searches C for a collision-free rajecory from he iniial sae of he robos o heir goal sae. The resuling rajecory defines he coordinaed moions of he robos o heir respecive goals. Our planner searches C by incremenally building a ree of milesones (he roadmap), as described in [14,15,19]. A each ieraion, i selecs a milesone m in he curren roadmap, generaes a collision-free sae m a random in a neighborhood of m in C and, if he pah from m o m ess collision-free, insalls m as a new milesone in he roadmap. The search erminaes when m falls ino an endgame region around he goal. See [14] for deails. As in [14,28], our planner saisfies kinodynamic consrains as follows: o generae each new milesone m, i picks a conrol inpu a random and inegraes he equaions of moion of he robos over a shor duraion. We name our planner Kinodynamic Randomized Moion Planning (KRMP). As shown in [14], under reasonable assumpions on he free space, he probabiliy of no finding a plan when one exiss decreases exponenially o 0 as he number of milesones increases. This is a major advanage over our previous work in [9,11], which used a decenralized prioriized planning approach. Noe, however, ha he fac ha he planner is probabilisically complee does no imply ha he enire sysem is also probabilisically complee. The robos use parial world models and hus need o re-plan heir rajecories when hey encouner discrepancies in heir model, (e.g. new obsacles). Since here is no guaranee ha a series of complee plans is iself a complee plan, he robos are no guaraneed o find a global plan if one exiss. While i is unclear o wha exen he noion of compleeness applies when planning for global goals wih only parial knowledge of he environmen, i is sill desirable o achieve compleeness in he sysem s componens whenever his is possible. The work in [14] also demonsraed empirically ha he above echniques successfully compue rajecories for a single robo wih kinodynamic moion consrains, in real-ime, (i.e. fas enough o be run on he fly). To enable moion planning wihin robo neworks, KRMP exends his previous work o accommodae several robos. Modified echniques are needed o 1) selec milesones for expansion, 2) generae new milesones, and 3) define he endgame region. Below we presen only he echnique we use o generae a new milesone m. No all modificaions are presened in his paper. When planning for muliple robos, one may generae m using he following parallel approach: firs, pick he conrol inpus for all he robos a random; nex, inegrae he moions of all he robos concurrenly; if no collision is deeced, hen record he endpoin as a new milesone, oherwise pick anoher se of conrol inpus. We found ha his echnique yields a high rejecion rae, especially in igh space. This led us o develop he following sequenial approach: consider he robos in some order, pick he conrol inpu for each robo and inegrae is moion (while considering he previous robos as moving obsacles); if he moion collides, pick anoher conrol or change he moion of a previous robo. Our experimens show ha his sequenial approach makes i possible o ge each new milesone much faser, wihou affecing he probabilisic compleeness of he overall planner. Finally, we ake advanage of he various processors available in a robo nework by concurrenly running a separae copy of KRMP on each robo of he nework. Each copy uses a differen seed of he random number generaor, hence consrucs differen roadmaps. We se he same imeou consrain (ypically, a small fracion of a second) on every robo. Each robo hen reurns a plan or is failure o generae one. The same bes plan is seleced by he robos and each robo immediaely swiches o execuing is new rajecory. This is made possible because we use a PRM planning approach. 6. ROVER PLANNING To validae our planning approach, i was implemened on he MARS es-plaform. This secion describes he hardware used for rover experimens, followed by a brief summary of experimenal resuls. For deails abou he implemenaion of he planner on planeary rovers, refer o [11]. 6.1 Micro-Auonomous RoverS Tes-Plaform Locaed in he Aerospace Roboics Lab a Sanford Universiy, he Micro-Auonomous RoverS (MARS) es-plaform is used o model mobile robos in a wodimensional workspace. The plaform consiss of a large 12 x 9 fla, granie able wih six auonomous robos ha move abou he able s surface.
5 The robos are cylindrical in shape and use wo independenly driven wheels ha allow hem o roae on he spo, bu inhibi laeral movemen (nonholonomic consrain). Each robo is equipped wih is own planner (copy of KRMP) and conroller ha are locaed off-board. An overhead vision sysem is used o rack he saes of all objecs on he able. The vision sysem processor calculaes hese saes and publishes hem o all applicaions ha subscribe (see Figure 4). This makes global sae informaion available o all robos. To simulae he limied sensing range ha would occur when sensors are mouned on robos, he objec saes are filered such ha robos only receive sae informaion regarding objecs wihin some predeermined range of he robo. Figure 4 shows he compuer/nework archiecure of he MARS es-plaform. All he processing is done offboard. Two processors are assigned o each robo, respecively for planning and conrol. These compuers are conneced hrough a LAN. All communicaion wihin he LAN is accomplished wih Real Time Innovaion's Nework Daa Delivery Service (NDDS) sofware. Because a LAN is used for iner-robo communicaion insead of a wireless medium, here are no physical barriers o limi he range of communicaion. Hence he communicaion barrier is simulaed. experimen. The boom phoo shows he physical hardware, and was aken a he same ime as he GUI screensho. In he GUI, robos and objecs are depiced as small and large circles, respecively. Robo goal locaions are indicaed by cross-hairs, and lines leading o he goal locaions depic he rajecories. When robos form a nework as described in Secion 2, i is indicaed by a color change. Hence robos wihin a nework have a common color, and his color will differ beween neworks. In he experimen presened, all five robos are iniially locaed a he near end of he able (i.e. boom of he GUI screen). Communicaion and sensing ranges were limied o 0.75 m. Robo colors indicae ha 2 neworks have formed, one wih he 2 robos in he boom lef and one wih he 2 robos in he boom righ. As he experimen progresses, he robos follow heir rajecories o reach heir goal locaions a he far end of he able. Throughou he experimen, robos planned an average of 3.4 imes, and planning imes were an average of 9 ms. NDDS is based on a publish/subscribe archiecure. To broadcas messages by flooding a robo nework, he sender will publish a message o which all robos subscribe. Before robos can receive heir subscripions, he messages are filered so ha only robos wihin some predeermined range of he sender will receive he message. This effecively simulaes a discree physical communicaion range. GUI Planners Conrollers Visualizaion ( ( ( ) ) ) Vision Figure 5: Example experimen on he MARS esplaform involving 5 robos and 3 obsacles. Successful planning was demonsraed in more complex simulaions involving up o 12 planeary rovers in a bounded workspace ha conained 12 saic and moving obsacles, (see [10]). 7. FREE-FLOATING ROBOT PLANNING Figure 4: Nework archiecure of MARS es-plaform 6.2 Planeary Rover Experimens To illusrae he applicabiliy of he planner o a physical sysem, real robo experimens wih up o 5 robos have been carried ou. One example of such an experimen is illusraed in Figure 5. The op phoo is a screensho of he GUI aken a one poin in he This secion deails planner implemenaion issues, provides a brief noe on he 3D visualizaion, and gives resuls from simulaions of free-floaing robos in a 3D environmen. 7.1 Free-Floaing Robos Planner Implemenaion Free-Floaing Robo Model - A simple cube-shaped robo equipped wih 6 independen on/off hrusers was used o model a space robo in simulaion. Noe his
6 does no allow for any change in orienaion. Fuure work will include addiional hrusers o allow roll, pich and yaw variaion. The sae of he robos can be described by X = (x 1, x 2, x 3 ) R 3 represening he posiion wih respec o he inerial frame. Milesones are specified by he sae of he k robos a a paricular ime, (X 0, X 1,..., X k, ). To implemen his in pracice, one mus creae a lis of milesones o ge from m e o m g, he milesone defining he goal saes of each robo. Each milesone in his lis corresponds wih he change in acuaion necessary for obaining he bang-off-bang conrol sequence. u 1 x 3 u 2 x 2 u 3 x 1 Figure 6: Sae-space model of he free-floaing robo Milesone Generaion - To generae a new milesone for he road map, hruser conrol inpus are randomly seleced ha will propagae robos o new saes. Firs, he ime for which he hrusers will be acuaed, ( ac ), is randomly seleced where: [ ] min, max x 1 x 2 x 3 m e m 0 m 1 m 2 m 3 m 4 m 5 m g ac Figure 7: Example of acuaion required o move one Nex, he conrol inpus (ON/OFF) are randomly seleced for each hruser. We assume ha only one of wo opposie-facing hrusers should be enabled a he same ime. This can reduce he number of random variables. Tha is, for each pair of opposie-facing hrusers, a conrol inpu variable u ac is seleced where: u { 1, 1,0} ac u ac Thruser 1 ON OFF OFF Thruser 2 OFF ON OFF Table 1: Mapping he random variable u ac o hruser acuaion. Wih he random variables seleced, a candidae milesone m can be generaed. Given any paren milesone m p, and using 1/s 2 dynamics, robo saes in m can be easily calculaed: robo from (0, 0, 0) o a goal sae. The series of milesones required is {m p, m 0, m 1, mm 3, m 4, m 5, m g } 7.2 Free-Floaing Robo Simulaions To simulae moion planning experimens ha involve free-floaing robos maneuvering in a 3D space environmen, he es plaform described in Secion 6 was augmened o incorporae a 3D visualizaion. The applicaion was coded in C++ and OpenGl. A screensho from he applicaion can be seen in Figures 1 and 9. As depiced in Figure 4, he applicaion acs only as a lisener o receive sae informaion. The applicabiliy of he planner o a 3D environmen was validaed wih simulaions ha include up o 8 robos and 8 obsacles. A es scenario is provided in which robos mus cross pahs several imes. A GUI screensho of he scenario is provided in Figure 8, (Noe ha he hird dimension is no displayed here.) u = + x 2M uaci i = ac + x i M + x aci 2 x i ac i, p ac i, p x, p Endgame Region - The endgame region E in his implemenaion is defined as he subspace ha includes all milesones m e, such ha all robos can be propagaed wihou collisions from saes defined by m e o heir respecive goal locaion via a bang-off-bang conrol sequence. An advanage his sequence has is ha i allows us o limi he velociy of he robo, making i easier o re-plan in he fuure. Figure 8: A es scenario involving 8 robos and 8 obsacles. On he lef, four robos denoed by ligh gray circles have formed a nework. On he righ, wo neworks have formed, each wih wo robos, (denoed by blue and yellow circles). Lines indicae rajecories. Obsacles are depiced as dark circles.
7 The es scenario was simulaed 25 imes o produce he resuls in Table 2. From hese resuls i is clear ha he planner was capable of planning on he fly wih average planning imes of 67 ms. An average of 12.2 neworks were formed hroughou each simulaion. Avg. number of plans made by each robo 4.77 Avg. number of robos in each plan 1.84 Avg. planning ime (ms) 67.0 Avg. number of neworks formed 12.2 Table 2: Daa from 25 simulaions of he es scenario depiced in Figure 8. Provided in Figure 9 is a visualizaion of a simulaion of 4 free-floaing robos planning in a bounded 3D environmen ha conains 4 obsacles. The robos have formed a nework and carried ou cenralized planning o consruc rajecories o heir respecive goals. The view has been roaed beween screenshos in a clockwise direcion o provide differen poins of view of he simulaion. 8. CONCLUSIONS a) b) The moion planning framework presened has demonsraed is effeciveness in planning for muliple mobile robos wihin a bounded workspace. I plans wih a high probabiliy of success in environmens involving robos, saionary obsacles and moving obsacles. Planning imes of less han 100 ms allowed he robos o re-plan on he fly and reac in real-ime o changes in he environmen. Fuure work includes incorporaing more sophisicaed mehods of modeling he environmen ino he communicaion sysem. Anoher fuure direcion will be o invesigae he effecs of varying he raio beween sensor range and communicaion range. For he applicaion o he hree-dimensional workspaces, planning for all degrees of freedom should be incorporaed. c) d) e) Figure 9: Visualizing a simulaion involving 4 robos and 4 obsacles. Large gray cubes denoe he obsacles. Trajecories are denoed by yellow lines ha end a robo goal locaions, (denoed by red cube laices).
8 BIBLIOGRAPHY [1] D. L. Akin, M. L. Bowden. EVA, Roboic, and Cooperaive Assembly of Large Sapce Srucures, Proc. IEEE Aerospace Conference, [2]R. Alami, F. Rober, F. Ingrand, & S.Suzuki. Muli-Robo Cooperaion Through Incremenal Plan-Merging, Proc. IEEE In. Conf. on Roboics and Auomaion, p , [3] T. Arai & J. Oa. Moion Planning of muliple mobile robos. Proc. IEEE/RSJ In. Conf. on Inelligen Robos and Sys., p , [4] K. Azarm & G. Schmid. Conflic-Free Moion of Muliple Mobile Robos Based on Decenralized Moion Planning and Negoiaion, Proc. IEEE In. Conf. on Roboics and Auomaion, p , [5] J. Barraquand, B. Langlois, & J.C. Laombe. Numerical Poenial Field echniques for Robo Pah Planning, IEEE Tr. On Sys., Man, and Cyb., 22(2): , [6] M. Bennewiz, W. Burgard & S. Thrun. Opimizing Schedules for Prioriized Pah Planning of Muli-Robo Sysems, Proc. In. Conf. on Roboics and Auomaion, [7] Z. Bien & Jihong Lee. A Minimum-Time Trajecory Planning Mehod for Two Robos, IEEE Tr. on Roboics and Auomaion, pg , [8] S.J. Buckley. Fas Moion Planning for Muliple Moving Robos. Proc. IEEE In. Conf. on Roboics and Auom., p , [9] C. Clark & S. Rock. Randomized Moion Planning for Groups of Nonholonomic Robos, Proc. In. Symp. of Arificial Inelligence, Roboics and Auomaion in Space, [10] C. Clark, S. Rock & J. C. Laombe. Dynamic Neworks for Moion Planning in Muli-Robo Space Sysems, Proc. In. Symp. of Arificial Inelligence, Roboics and Auomaion in Space, [11] C. Clark, T. Brel, & S. Rock. Kinodynamic Randomized Moion Planning for Muli-Robo Space Sysems, Proc. of IEEE Aerospace Conf., [12] M. Erdmann & T. Lozano-Perez. On Muliple Moving Objecs, Proc. IEEE In. Conf. on Roboics and Auomaion, p , [13] Y. Guo & L. E. Parker. A Disribued and Opimal Moion Planning Approach for Muliple Mobile Robos, Proc. IEEE In. Conf. on Roboics and Auomaion, p , [14] D. Hsu, R. Kindel, J.C. Laombe, & S. Rock. Randomized Kinodynamic Moion Planning wih Moving Obsacles, In. J. of Roboics Research, 21(3): , March [15] D. Hsu, J.C. Laombe, & R. Mowani. Pah planning in expansive configuraion spaces, Proc. IEEE In. Conf. on Roboics and Auomaion, p , [16] K. Kan & S. Zucker. Toward efficien Trajecory Planning: The pah-velociy decomposiion, In. J. of Roboics Research, 5(3):72-89,1986. [17] S. Kao, S. Nishiyama, & J. Takeno. Coordinaing mobile robos by applying raffic rules, Proc. IEEE/RSH In. Conf. on Inelligen Robos and Sysems, p , [18] J.J. Kuffner. Auonomous Agens for Real-Time Animaion. PhD Thesis, Compuer Science Dep., Sanford U., [19] S.M. LaValle & S.A. Huchinson. Opimal Moion Planning for Muliple Robos Having Independen Goals, IEEE Tr. on Roboics and Auomaion, 14: , [20] S.M. LaValle & J.J. Kufner. Randomized Kinodynamic Planning, In. J. of Roboics Research, 20(5): , [21] Lee, Lee, & Park. Trajecory Generaion and Moion Tracking for he Robo Soccer Game, Proc. IEEE In. Conf. on Inelligen Robos and Sysems, p , [22] V.J. Lumelsky & K.R. Harinarayan. Decenralized Moion Planning for Muliple Mobile Robos: The Cockail Pary Model, Auonomous Robos J., 4: , [23] P. Mouarlier & R. Chaila. Sochasic Mulisensory Daa Fusion for Mobile Robo Locaion and Environmen Modelling. Proc. In. Symp. on Roboics Research, Tokyo, [24] P. S. Schenker, T. L. Hunsberger, P. Pirjanian & E. T. Baumgarner. Planeary Rover Developmens Supporing Mars Exploraion, Sample Reurn and Fuure Human-Roboic Colonizaion, Proc. 10 h Conf. on Advanced Roboics, p , [25] D. Parsons & J. Canny. A Moion Planner for Muliple Mobile Robos, Proc. IEEE In. Conf. on Roboics and Auom., p. 8-13, 1992 [26] G. Sánchez & J.C. Laombe. On Delaying Collision Checking in PRM Planning : Applicaion o Muli-Robo Coordinaion, In. J. of Roboics Research, 21(1):5-26, Jan [27] G. Sánchez-Ane & J.C. Laombe. Using a PRM Planner o Compare Cenralized and Decoupled Planning for Muli-Robo Sysems, Proc. IEEE In. Conf. on Roboics and Auom.., [28] S. Sekhava, P. Sveska, J.P. Laumond, & M.H. Overmars. Mulilevel Pah Planning for Nonholonomic Robos Using Semiholonomic Subsysems. In. J. of Roboics Res., 17: , [29] T. Siméon, S. Leroy, & J.P. Laumond. Pah Coordinaion for Muliple Mobile Robos: a Geomeric Algorihm, Proc. In. Join Conf. on Arificial Inelligence, [30] P. Sveska, & M.H. Overmars. Coordinaed Moion Planning for Muliple Car-Like Robos Using Probabilisic Roadmaps, Proc. IEEE In. Conf. on Roboics and Auom., p , [31] C.W. Warren. Muliple Pah Coordinaion using Arificial Poenial Fields, Proc. IEEE In. Conf. on Roboics and Auom., p , 1990.
Spring Localization I. Roland Siegwart, Margarita Chli, Martin Rufli. ASL Autonomous Systems Lab. Autonomous Mobile Robots
Spring 2017 Localizaion I Localizaion I 10.04.2017 1 2 ASL Auonomous Sysems Lab knowledge, daa base mission commands Localizaion Map Building environmen model local map posiion global map Cogniion Pah
More informationP. Bruschi: Project guidelines PSM Project guidelines.
Projec guidelines. 1. Rules for he execuion of he projecs Projecs are opional. Their aim is o improve he sudens knowledge of he basic full-cusom design flow. The final score of he exam is no affeced by
More informationA WIDEBAND RADIO CHANNEL MODEL FOR SIMULATION OF CHAOTIC COMMUNICATION SYSTEMS
A WIDEBAND RADIO CHANNEL MODEL FOR SIMULATION OF CHAOTIC COMMUNICATION SYSTEMS Kalle Rui, Mauri Honanen, Michael Hall, Timo Korhonen, Veio Porra Insiue of Radio Communicaions, Helsini Universiy of Technology
More informationAutonomous Humanoid Navigation Using Laser and Odometry Data
Auonomous Humanoid Navigaion Using Laser and Odomery Daa Ricardo Tellez, Francesco Ferro, Dario Mora, Daniel Pinyol and Davide Faconi Absrac In his paper we presen a novel approach o legged humanoid navigaion
More informationMobile Robot Localization Using Fusion of Object Recognition and Range Information
007 IEEE Inernaional Conference on Roboics and Auomaion Roma, Ialy, 10-14 April 007 FrB1.3 Mobile Robo Localizaion Using Fusion of Objec Recogniion and Range Informaion Byung-Doo Yim, Yong-Ju Lee, Jae-Bok
More informationLab 3 Acceleration. What You Need To Know: Physics 211 Lab
b Lab 3 Acceleraion Wha You Need To Know: The Physics In he previous lab you learned ha he velociy of an objec can be deermined by finding he slope of he objec s posiion vs. ime graph. x v ave. = v ave.
More informationICAMechS The Navigation Mobile Robot Systems Using Bayesian Approach through the Virtual Projection Method
ICAMechS 2012 Advanced Inelligen Conrol in Roboics and Mecharonics The Navigaion Mobile Robo Sysems Using Bayesian Approach hrough he Virual Projecion Mehod Tokyo, Japan, Sepember 2012 Luige VLADAREANU,
More informationDistributed Multi-robot Exploration and Mapping
1 Disribued Muli-robo Exploraion and Mapping Dieer Fox Jonahan Ko Kur Konolige Benson Limkekai Dirk Schulz Benjamin Sewar Universiy of Washingon, Deparmen of Compuer Science & Engineering, Seale, WA 98195
More informationSocial-aware Dynamic Router Node Placement in Wireless Mesh Networks
Social-aware Dynamic Rouer Node Placemen in Wireless Mesh Neworks Chun-Cheng Lin Pei-Tsung Tseng Ting-Yu Wu Der-Jiunn Deng ** Absrac The problem of dynamic rouer node placemen (dynrnp) in wireless mesh
More informationRandomized Kinodynamic Motion Planning with Moving Obstacles
Randomized Kinodynamic Moion Planning wih Moving Obsacles David Hsu Rober Kindel Jean-Claude Laombe Sephen Rock Deparmen of Compuer Science Deparmen of Aeronauics & Asronauics Sanford Universiy Sanford,
More informationECE-517 Reinforcement Learning in Artificial Intelligence
ECE-517 Reinforcemen Learning in Arificial Inelligence Lecure 11: Temporal Difference Learning (con.), Eligibiliy Traces Ocober 8, 2015 Dr. Iamar Arel College of Engineering Deparmen of Elecrical Engineering
More informationExploration with Active Loop-Closing for FastSLAM
Exploraion wih Acive Loop-Closing for FasSLAM Cyrill Sachniss Dirk Hähnel Wolfram Burgard Universiy of Freiburg Deparmen of Compuer Science D-79110 Freiburg, Germany Absrac Acquiring models of he environmen
More informationPrediction of Pitch and Yaw Head Movements via Recurrent Neural Networks
To appear in Inernaional Join Conference on Neural Neworks, Porland Oregon, 2003. Predicion of Pich and Yaw Head Movemens via Recurren Neural Neworks Mario Aguilar, Ph.D. Knowledge Sysems Laboraory Jacksonville
More informationDURING last decade, many communication technologies
1 TeamPhone: Neworking Smarphones for isaser Recovery Zongqing Lu, Guohong ao, and Thomas La Pora and suppors daa communicaions among rescue workers in infrasrucure-consrained and infrasrucure-less scenarios.
More informationMotion-blurred star image acquisition and restoration method based on the separable kernel Honglin Yuana, Fan Lib and Tao Yuc
5h Inernaional Conference on Advanced Maerials and Compuer Science (ICAMCS 206) Moion-blurred sar image acquisiion and resoraion mehod based on he separable kernel Honglin Yuana, Fan Lib and Tao Yuc Beihang
More informationRole of Kalman Filters in Probabilistic Algorithm
Volume 118 No. 11 2018, 5-10 ISSN: 1311-8080 (prined version); ISSN: 1314-3395 (on-line version) url: hp://www.ijpam.eu doi: 10.12732/ijpam.v118i11.2 ijpam.eu Role of Kalman Filers in Probabilisic Algorihm
More informationSLAM Algorithm for 2D Object Trajectory Tracking based on RFID Passive Tags
2008 IEEE Inernaional Conference on RFID The Veneian, Las Vegas, Nevada, USA April 16-17, 2008 1C2.2 SLAM Algorihm for 2D Objec Trajecory Tracking based on RFID Passive Tags Po Yang, Wenyan Wu, Mansour
More informationDrunkWalk: Collaborative and Adaptive Planning for Navigation of Micro-Aerial Sensor Swarms
DrunkWalk: Collaboraive and Adapive Planning for Navigaion of Micro-Aerial Sensor Swarms Xinlei Chen Carnegie Mellon Universiy Pisburgh, PA, USA xinlei.chen@sv.cmu.edu Aveek Purohi Carnegie Mellon Universiy
More informationAcquiring hand-action models by attention point analysis
Acquiring hand-acion models by aenion poin analysis Koichi Ogawara Soshi Iba y Tomikazu Tanuki yy Hiroshi Kimura yyy Kasushi Ikeuchi Insiue of Indusrial Science, Univ. of Tokyo, Tokyo, 106-8558, JAPAN
More informationB-MAC Tunable MAC protocol for wireless networks
B-MAC Tunable MAC proocol for wireless neworks Summary of paper Versaile Low Power Media Access for Wireless Sensor Neworks Presened by Kyle Heah Ouline Inroducion o B-MAC Design of B-MAC B-MAC componens
More informationFuzzy Inference Model for Learning from Experiences and Its Application to Robot Navigation
Fuzzy Inference Model for Learning from Experiences and Is Applicaion o Robo Navigaion Manabu Gouko, Yoshihiro Sugaya and Hiroomo Aso Deparmen of Elecrical and Communicaion Engineering, Graduae School
More information5 Spatial Relations on Lines
5 Spaial Relaions on Lines There are number of useful problems ha can be solved wih he basic consrucion echniques developed hus far. We now look a cerain problems, which involve spaial relaionships beween
More informationLecture #7: Discrete-time Signals and Sampling
EEL335: Discree-Time Signals and Sysems Lecure #7: Discree-ime Signals and Sampling. Inroducion Lecure #7: Discree-ime Signals and Sampling Unlike coninuous-ime signals, discree-ime signals have defined
More information4.5 Biasing in BJT Amplifier Circuits
4/5/011 secion 4_5 Biasing in MOS Amplifier Circuis 1/ 4.5 Biasing in BJT Amplifier Circuis eading Assignmen: 8086 Now le s examine how we C bias MOSFETs amplifiers! f we don bias properly, disorion can
More informationECMA st Edition / June Near Field Communication Wired Interface (NFC-WI)
ECMA-373 1 s Ediion / June 2006 Near Field Communicaion Wired Inerface (NFC-WI) Sandard ECMA-373 1 s Ediion / June 2006 Near Field Communicaion Wired Inerface (NFC-WI) Ecma Inernaional Rue du Rhône 114
More informationInstalling remote sites using TCP/IP
v dc Keypad from nework Whie/ 3 Whie/ 4 v dc Keypad from nework Whie/ 3 Whie/ 4 v dc Keypad from nework Whie/ 3 Whie/ 4 +v pu +v pu +v pu v dc Keypad from nework Whie/ 3 Whie/ 4 v dc Keypad from nework
More informationISSCC 2007 / SESSION 29 / ANALOG AND POWER MANAGEMENT TECHNIQUES / 29.8
ISSCC 27 / SESSION 29 / ANALOG AND POWER MANAGEMENT TECHNIQUES / 29.8 29.8 A 3GHz Swiching DC-DC Converer Using Clock- Tree Charge-Recycling in 9nm CMOS wih Inegraed Oupu Filer Mehdi Alimadadi, Samad Sheikhaei,
More informationOptimal Navigation for a Differential Drive Disc Robot: A Game Against the Polygonal Environment
Noname manuscrip No. (will be insered by he edior) Opimal Navigaion for a Differenial Drive Disc Robo: A Game Agains he Polygonal Environmen Rigobero Lopez-Padilla, Rafael Murriea-Cid, Israel Becerra,
More informationMultiple Load-Source Integration in a Multilevel Modular Capacitor Clamped DC-DC Converter Featuring Fault Tolerant Capability
Muliple Load-Source Inegraion in a Mulilevel Modular Capacior Clamped DC-DC Converer Feauring Faul Toleran Capabiliy Faisal H. Khan, Leon M. Tolber The Universiy of Tennessee Elecrical and Compuer Engineering
More informationNegative frequency communication
Negaive frequency communicaion Fanping DU Email: dufanping@homail.com Qing Huo Liu arxiv:2.43v5 [cs.it] 26 Sep 2 Deparmen of Elecrical and Compuer Engineering Duke Universiy Email: Qing.Liu@duke.edu Absrac
More informationA Cognitive Modeling of Space using Fingerprints of Places for Mobile Robot Navigation
A Cogniive Modeling of Space using Fingerprins of Places for Mobile Robo Navigaion Adriana Tapus Roland Siegwar Ecole Polyechnique Fédérale de Lausanne (EPFL) Ecole Polyechnique Fédérale de Lausanne (EPFL)
More informationThe student will create simulations of vertical components of circular and harmonic motion on GX.
Learning Objecives Circular and Harmonic Moion (Verical Transformaions: Sine curve) Algebra ; Pre-Calculus Time required: 10 150 min. The sudens will apply combined verical ranslaions and dilaions in he
More informationReceiver-Initiated vs. Short-Preamble Burst MAC Approaches for Multi-channel Wireless Sensor Networks
Receiver-Iniiaed vs. Shor-Preamble Burs MAC Approaches for Muli-channel Wireless Sensor Neworks Crisina Cano, Boris Bellala, and Miquel Oliver Universia Pompeu Fabra, C/ Tànger 122-140, 08018 Barcelona,
More informationTable of Contents. 3.0 SMPS Topologies. For Further Research. 3.1 Basic Components. 3.2 Buck (Step Down) 3.3 Boost (Step Up) 3.4 Inverter (Buck/Boost)
Table of Conens 3.0 SMPS Topologies 3.1 Basic Componens 3.2 Buck (Sep Down) 3.3 Boos (Sep Up) 3.4 nverer (Buck/Boos) 3.5 Flyback Converer 3.6 Curren Boosed Boos 3.7 Curren Boosed Buck 3.8 Forward Converer
More informationInferring Maps and Behaviors from Natural Language Instructions
Inferring Maps and Behaviors from Naural Language Insrucions Felix Duvalle 1, Mahew R. Waler 2, Thomas Howard 2, Sachihra Hemachandra 2, Jean Oh 1, Seh Teller 2, Nicholas Roy 2, and Anhony Senz 1 1 Roboics
More informationLecture September 6, 2011
cs294-p29 Seminar on Algorihmic Game heory Sepember 6, 2011 Lecure Sepember 6, 2011 Lecurer: Chrisos H. Papadimiriou Scribes: Aloni Cohen and James Andrews 1 Game Represenaion 1.1 abular Form and he Problem
More informationEXPERIMENT #9 FIBER OPTIC COMMUNICATIONS LINK
EXPERIMENT #9 FIBER OPTIC COMMUNICATIONS LINK INTRODUCTION: Much of daa communicaions is concerned wih sending digial informaion hrough sysems ha normally only pass analog signals. A elephone line is such
More informationEstimation of Automotive Target Trajectories by Kalman Filtering
Buleinul Şiinţific al Universiăţii "Poliehnica" din imişoara Seria ELECRONICĂ şi ELECOMUNICAŢII RANSACIONS on ELECRONICS and COMMUNICAIONS om 58(72), Fascicola 1, 2013 Esimaion of Auomoive arge rajecories
More informationEffective Team-Driven Multi-Model Motion Tracking
Effecive Team-Driven Muli-Model Moion Tracking Yang Gu Compuer Science Deparmen Carnegie Mellon Universiy 5000 Forbes Avenue Pisburgh, PA 15213, USA guyang@cscmuedu Manuela Veloso Compuer Science Deparmen
More informationDesign and Implementation an Autonomous Mobile Soccer Robot Based on Omnidirectional Mobility and Modularity
Design and Implemenaion an Auonomous Mobile Soccer Robo Based on Omnidirecional Mobiliy and Modulariy S. Hamidreza Mohades Kasaei and S.Mohammadreza Mohades Kasaei Absrac The purpose of his paper is o
More informationLocalizing Objects During Robot SLAM in Semi-Dynamic Environments
Proceedings of he 2008 IEEE/ASME Inernaional Conference on Advanced Inelligen Mecharonics July 2-5, 2008, Xi'an, China Localizing Objecs During Robo SLAM in Semi-Dynamic Environmens Hongjun Zhou Tokyo
More informationMAP-AIDED POSITIONING SYSTEM
Paper Code: F02I131 MAP-AIDED POSITIONING SYSTEM Forssell, Urban 1 Hall, Peer 1 Ahlqvis, Sefan 1 Gusafsson, Fredrik 2 1 NIRA Dynamics AB, Sweden; 2 Linköpings universie, Sweden Keywords Posiioning; Navigaion;
More informationForeign Fiber Image Segmentation Based on Maximum Entropy and Genetic Algorithm
Journal of Compuer and Communicaions, 215, 3, 1-7 Published Online November 215 in SciRes. hp://www.scirp.org/journal/jcc hp://dx.doi.org/1.4236/jcc.215.3111 Foreign Fiber Image Segmenaion Based on Maximum
More informationAn off-line multiprocessor real-time scheduling algorithm to reduce static energy consumption
An off-line muliprocessor real-ime scheduling algorihm o reduce saic energy consumpion Firs Workshop on Highly-Reliable Power-Efficien Embedded Designs Shenzhen, China Vincen Legou, Mahieu Jan, Lauren
More information3D Laser Scan Registration of Dual-Robot System Using Vision
3D Laser Scan Regisraion of Dual-Robo Sysem Using Vision Ravi Kaushik, Jizhong Xiao*, William Morris and Zhigang Zhu Absrac This paper presens a novel echnique o regiser a se of wo 3D laser scans obained
More information2600 Capitol Avenue Suite 200 Sacramento, CA phone fax
26 Capiol Avenue Suie 2 Sacrameno, CA 9816 916.64.4 phone 916.64.41 fax www.esassoc.com memorandum dae Sepember 2, 216 o from subjec Richard Rich, Ciy of Sacrameno; Jeffrey Dorso, Pioneer Law Group Brian
More informationAN303 APPLICATION NOTE
AN303 APPLICATION NOTE LATCHING CURRENT INTRODUCTION An imporan problem concerning he uilizaion of componens such as hyrisors or riacs is he holding of he componen in he conducing sae afer he rigger curren
More informationModeling and Prediction of the Wireless Vector Channel Encountered by Smart Antenna Systems
Modeling and Predicion of he Wireless Vecor Channel Encounered by Smar Anenna Sysems Kapil R. Dandekar, Albero Arredondo, Hao Ling and Guanghan Xu A Kalman-filer based, vecor auoregressive (VAR) model
More informationInvestigation and Simulation Model Results of High Density Wireless Power Harvesting and Transfer Method
Invesigaion and Simulaion Model Resuls of High Densiy Wireless Power Harvesing and Transfer Mehod Jaber A. Abu Qahouq, Senior Member, IEEE, and Zhigang Dang The Universiy of Alabama Deparmen of Elecrical
More informationEFFECT OF REWARD PREDICTION ERRORS ON THE EMOTIONAL STATE OF A MOBILE ROBOT
In D. Reier & F. E. Rier (Eds.), Proceedings of he 14h Inernaional Conference on Cogniive Modeling (ICCM 16). Universiy Park, PA: Penn Sae. EFFECT OF REWARD PREDICTION ERRORS ON THE EMOTIONAL STATE OF
More informationEE 330 Lecture 24. Amplification with Transistor Circuits Small Signal Modelling
EE 330 Lecure 24 Amplificaion wih Transisor Circuis Small Signal Modelling Review from las ime Area Comparison beween BJT and MOSFET BJT Area = 3600 l 2 n-channel MOSFET Area = 168 l 2 Area Raio = 21:1
More informationIntegrated Scheduling of Multimedia and Hard Real-Time Tasks
Inegraed Scheduling of Mulimedia and Hard Real-Time Tasks Hiroyuki Kaneko, John A. Sankovic, Subhabraa Sen and Krihi Ramamriham Compuer Science Deparmen Universiy of Massachuses LGRC, Box 346 Amhers MA
More informationProceedings of International Conference on Mechanical, Electrical and Medical Intelligent System 2017
on Mechanical, Elecrical and Medical Inelligen Sysem 7 Consan On-ime Conrolled Four-phase Buck Converer via Saw-oohwave Circui and is Elemen Sensiiviy Yi Xiong a, Koyo Asaishi b, Nasuko Miki c, Yifei Sun
More informationOutdoor Navigation: Time-critical Motion Planning for Nonholonomic Mobile Robots Mohd Sani Mohamad Hashim
Oudoor Navigaion: Time-criical Moion Planning for Nonholonomic Mobile Robos Mohd Sani Mohamad Hashim School of Mechanical Engineering The Universiy of Adelaide Souh Ausralia 55 Ausralia A hesis submied
More informationarxiv: v1 [cs.ro] 19 Nov 2018
Decenralized Cooperaive Muli-Robo Localizaion wih EKF Ruihua Han, Shengduo Chen, Yasheng Bu, Zhijun Lyu and Qi Hao* arxiv:1811.76v1 [cs.ro] 19 Nov 218 Absrac Muli-robo localizaion has been a criical problem
More informationStarvation Mitigation Through Multi-Channel Coordination in CSMA Multi-hop Wireless Networks
Sarvaion Miigaion Through Muli-Channel Coordinaion in CSMA Muli-hop Wireless Neworks Jingpu Shi, Theodoros Salonidis, and Edward W. Knighly Deparmen of Elecrical and Compuer Engineering Rice Universiy,
More informationDistributed Tracking in Wireless Ad Hoc Sensor Networks
Disribued Tracing in Wireless Ad Hoc Newors Chee-Yee Chong Booz Allen Hamilon San Francisco, CA, U.S.A. chong_chee@bah.com cychong@ieee.org Feng Zhao Palo Alo Research Cener (PARC) Palo Alo, CA, U.S.A.
More informationPulse Train Controlled PCCM Buck-Boost Converter Ming Qina, Fangfang Lib
5h Inernaional Conference on Environmen, Maerials, Chemisry and Power Elecronics (EMCPE 016 Pulse Train Conrolled PCCM Buck-Boos Converer Ming Qina, Fangfang ib School of Elecrical Engineering, Zhengzhou
More informationApplication of Neural Q-Learning Controllers on the Khepera II via Webots Software
Inernaional Conference on Fascinaing Advancemen in Mechanical Engineering (FAME2008), 11-13, December 2008 Applicaion of Neural Q-Learning s on he Khepera II via Webos Sofware Velappa Ganapahy and Wen
More informationEvaluation of the Digital images of Penaeid Prawns Species Using Canny Edge Detection and Otsu Thresholding Segmentation
Inernaional Associaion of Scienific Innovaion and Research (IASIR) (An Associaion Unifying he Sciences, Engineering, and Applied Research) Inernaional Journal of Emerging Technologies in Compuaional and
More informationA-LEVEL Electronics. ELEC4 Programmable Control Systems Mark scheme June Version: 1.0 Final
A-LEVEL Elecronics ELEC4 Programmable Conrol Sysems scheme 243 June 26 Version:. Final schemes are prepared by he Lead Assessmen Wrier and considered, ogeher wih he relevan quesions, by a panel of subjec
More informationDevelopment of Temporary Ground Wire Detection Device
Inernaional Journal of Smar Grid and Clean Energy Developmen of Temporary Ground Wire Deecion Device Jing Jiang* and Tao Yu a Elecric Power College, Souh China Universiy of Technology, Guangzhou 5164,
More informationECMA-373. Near Field Communication Wired Interface (NFC-WI) 2 nd Edition / June Reference number ECMA-123:2009
ECMA-373 2 nd Ediion / June 2012 Near Field Communicaion Wired Inerface (NFC-WI) Reference number ECMA-123:2009 Ecma Inernaional 2009 COPYRIGHT PROTECTED DOCUMENT Ecma Inernaional 2012 Conens Page 1 Scope...
More informationVariation Aware Cross-Talk Aggressor Alignment by Mixed Integer Linear Programming
ariaion Aware Cross-alk Aggressor Alignmen by Mixed Ineger Linear Programming ladimir Zoloov IBM. J. Wason Research Cener, Yorkown Heighs, NY zoloov@us.ibm.com Peer Feldmann D. E. Shaw Research, New York,
More informationExamination Mobile & Wireless Networking ( ) April 12,
Page 1 of 5 Examinaion Mobile & Wireless Neworking (192620010) April 12, 2017 13.45 16.45 Noes: Only he overhead shees used in he course, 2 double-sided shees of noes (any fon size/densiy!), and a dicionary
More informationUniversal microprocessor-based ON/OFF and P programmable controller MS8122A MS8122B
COMPETENCE IN MEASUREMENT Universal microprocessor-based ON/OFF and P programmable conroller MS8122A MS8122B TECHNICAL DESCRIPTION AND INSTRUCTION FOR USE PLOVDIV 2003 1 I. TECHNICAL DATA Analog inpus
More informationA Robot Simulator Based on the Cross Architecture for the Development of Cognitive Robotics
2016 XIII Lain American Roboics Symposium and IV Brazilian Roboics Symposium A Robo Simulaor Based on he Cross Archiecure for he Developmen of Cogniive Roboics Danilo H. Perico, Thiago P. D. Homem, Aislan
More informationQ-learning Based Adaptive Zone Partition for Load Balancing in Multi-Sink Wireless Sensor Networks
Q-learning Based Adapive Zone Pariion for Load Balancing in Muli-Sink Wireless Sensor Neworks Sheng-Tzong Cheng and Tun-Yu Chang Deparmen of Compuer Science and Informaion Engineering, Naional Cheng Kung
More informationRobot Control using Genetic Algorithms
Robo Conrol using Geneic Algorihms Summary Inroducion Robo Conrol Khepera Simulaor Geneic Model for Pah Planning Chromosome Represenaion Evaluaion Funcion Case Sudies Conclusions The Robo Conroller Problem
More informationPointwise Image Operations
Poinwise Image Operaions Binary Image Analysis Jana Kosecka hp://cs.gmu.edu/~kosecka/cs482.hml - Lookup able mach image inensiy o he displayed brighness values Manipulaion of he lookup able differen Visual
More informationElectrical connection
Reference scanner Dimensioned drawing en 02-2014/06 50117040-01 200 500mm Disance on background/reference 10-30 V DC We reserve he righ o make changes DS_HRTR46Bref_en_50117040_01.fm Robus objec deecion
More informationLocation Tracking in Mobile Ad Hoc Networks using Particle Filter
Locaion Tracking in Mobile Ad Hoc Neworks using Paricle Filer Rui Huang and Gergely V. Záruba Compuer Science and Engineering Deparmen The Universiy of Texas a Arlingon 46 Yaes, 3NH, Arlingon, TX 769 email:
More informationPerformance Analysis of High-Rate Full-Diversity Space Time Frequency/Space Frequency Codes for Multiuser MIMO-OFDM
Performance Analysis of High-Rae Full-Diversiy Space Time Frequency/Space Frequency Codes for Muliuser MIMO-OFDM R. SHELIM, M.A. MATIN AND A.U.ALAM Deparmen of Elecrical Engineering and Compuer Science
More informationR. Stolkin a *, A. Greig b, J. Gilby c
MESURING COMPLETE GROUND-TRUTH DT ND ERROR ESTIMTES FOR REL VIDEO SEQUENCES, FOR PERFORMNCE EVLUTION OF TRCKING, CMER POSE ND MOTION ESTIMTION LGORITHMS R Solkin a *, Greig b, J Gilby c a Cener for Mariime
More informationTHE OSCILLOSCOPE AND NOISE. Objectives:
-26- Preparaory Quesions. Go o he Web page hp://www.ek.com/measuremen/app_noes/xyzs/ and read a leas he firs four subsecions of he secion on Trigger Conrols (which iself is a subsecion of he secion The
More informationMoving Object Localization Based on UHF RFID Phase and Laser Clustering
sensors Aricle Moving Objec Localizaion Based on UHF RFID Phase and Laser Clusering Yulu Fu 1, Changlong Wang 1, Ran Liu 1,2, * ID, Gaoli Liang 1, Hua Zhang 1 and Shafiq Ur Rehman 1,3 1 School of Informaion
More informationA Segmentation Method for Uneven Illumination Particle Images
Research Journal of Applied Sciences, Engineering and Technology 5(4): 1284-1289, 2013 ISSN: 2040-7459; e-issn: 2040-7467 Maxwell Scienific Organizaion, 2013 Submied: July 17, 2012 Acceped: Augus 15, 2012
More informationInternational Journal of Electronics and Electrical Engineering Vol. 4, No. 2, April Supercapacitors
Inernaional Journal of Elecronics and Elecrical Engineering Vol. 4, No., April 16 Equalizaion Chargers Using Parallel- or SeriesParallel-Resonan Inverer for Series-Conneced Supercapaciors Yifan Zhou and
More informationNotes on the Fourier Transform
Noes on he Fourier Transform The Fourier ransform is a mahemaical mehod for describing a coninuous funcion as a series of sine and cosine funcions. The Fourier Transform is produced by applying a series
More informationRevision: June 11, E Main Suite D Pullman, WA (509) Voice and Fax
2.5.3: Sinusoidal Signals and Complex Exponenials Revision: June 11, 2010 215 E Main Suie D Pullman, W 99163 (509) 334 6306 Voice and Fax Overview Sinusoidal signals and complex exponenials are exremely
More informationThe vslam Algorithm for Navigation in Natural Environments
로봇기술및동향 The vslam Algorihm for Navigaion in Naural Environmens Evoluion Roboics, Inc. Niklas Karlsson, Luis Goncalves, Mario E. Munich, and Paolo Pirjanian Absrac This aricle describes he Visual Simulaneous
More informationSafe and Efficient Robotic Space Exploration with Tele-Supervised Autonomous Robots
Safe and Efficien Roboic Space Exploraion wih Tele-Supervised Auonomous Robos Albero Elfes*, John M. Dolan, Gregg Podnar, Sandra Mau, Marcel Bergerman *Je Propulsion Laboraory, 4800 Oak Grove Drive, Pasadena,
More information16.5 ADDITIONAL EXAMPLES
16.5 ADDITIONAL EXAMPLES For reiew purposes, more examples of boh piecewise linear and incremenal analysis are gien in he following subsecions. No new maerial is presened, so readers who do no need addiional
More informationNetwork Design and Optimization for Quality of Services in Wireless Local Area Networks using Multi-Objective Approach
Chuima Prommak and Naruemon Waanapongsakorn Nework Design and Opimizaion for Qualiy of Services in Wireless Local Area Neworks using Muli-Objecive Approach CHUTIMA PROMMAK, NARUEMON WATTANAPONGSAKORN *
More informationPerson Tracking in Urban Scenarios by Robots Cooperating with Ubiquitous Sensors
Person Tracking in Urban Scenarios by Robos Cooperaing wih Ubiquious Sensors Luis Merino Jesús Capián Aníbal Ollero Absrac The inroducion of robos in urban environmens opens a wide range of new poenial
More informationComparing image compression predictors using fractal dimension
Comparing image compression predicors using fracal dimension RADU DOBRESCU, MAEI DOBRESCU, SEFA MOCAU, SEBASIA ARALUGA Faculy of Conrol & Compuers POLIEHICA Universiy of Buchares Splaiul Independenei 313
More informationPARTICLE FILTER APPROACH TO UTILIZATION OF WIRELESS SIGNAL STRENGTH FOR MOBILE ROBOT LOCALIZATION IN INDOOR ENVIRONMENTS
PARTICLE FILTER APPROACH TO UTILIZATION OF WIRELESS SIGNAL STRENGTH FOR MOBILE ROBOT LOCALIZATION IN INDOOR ENVIRONMENTS Samuel L. Shue 1, Nelyadi S. Shey 1, Aidan F. Browne 1 and James M. Conrad 1 1 The
More informationCommunication Systems. Department of Electronics and Electrical Engineering
COMM 704: Communicaion Lecure : Analog Mulipliers Dr Mohamed Abd El Ghany Dr. Mohamed Abd El Ghany, Mohamed.abdel-ghany@guc.edu.eg nroducion Nonlinear operaions on coninuous-valued analog signals are ofen
More informationDirect Analysis of Wave Digital Network of Microstrip Structure with Step Discontinuities
Direc Analysis of Wave Digial Nework of Microsrip Srucure wih Sep Disconinuiies BILJANA P. SOŠIĆ Faculy of Elecronic Engineering Universiy of Niš Aleksandra Medvedeva 4, Niš SERBIA MIODRAG V. GMIROVIĆ
More informationACTIVITY BASED COSTING FOR MARITIME ENTERPRISES
ACTIVITY BASED COSTING FOR MARITIME ENTERPRISES 1, a 2, b 3, c 4, c Sualp Omer Urkmez David Sockon Reza Ziarai Erdem Bilgili a, b De Monfor Universiy, UK, c TUDEV, Insiue of Mariime Sudies, Turkey 1 sualp@furrans.com.r
More informationHIGH THROUGHPUT EVALUATION OF SHA-1 IMPLEMENTATION USING UNFOLDING TRANSFORMATION
VOL., NO. 5, MARCH 26 ISSN 89-668 26-26 Asian Research Publishing Nework (ARPN). All righs reserved. HIGH THROUGHPUT EVALUATION OF SHA- IMPLEMENTATION USING UNFOLDING TRANSFORMATION Shamsiah Bini Suhaili
More information4 20mA Interface-IC AM462 for industrial µ-processor applications
Because of he grea number of indusrial buses now available he majoriy of indusrial measuremen echnology applicaions sill calls for he sandard analog curren nework. The reason for his lies in he fac ha
More informationArchitectures for Resource Reservation Modules for Optical Burst Switching Core Nodes *
4. ITG-Fachagung Phoonic Neworks, May 5. - 6., 2003, Leipzig, Germany Archiecures for Resource Reservaion Modules for Opical Burs Swiching Core Nodes * Sascha Junghans, Chrisoph M. Gauger Universiy of
More informationDynamic Hybrid Topology Design for Integrated Traffic Support in WDM Mesh Networks 1 (Invited Paper)
Dynamic Hybrid Topology Design for Inegraed Traffic Suppor in WDM Mesh Neworks 1 (Invied Paper) Mina Youssef Elecrical and Compuer Engineering Kansas Sae Universiy Manhaan KS, 66502 USA Baek-Young Choi
More informationAutonomous Robotics 6905
6 Simulaneous Localizaion and Mapping (SLAM Auonomous Roboics 6905 Inroducion SLAM Formulaion Paricle Filer Underwaer SLAM Lecure 6: Simulaneous Localizaion and Mapping Dalhousie Universiy i Ocober 14,
More informationComparitive Analysis of Image Segmentation Techniques
ISSN: 78 33 Volume, Issue 9, Sepember 3 Compariive Analysis of Image Segmenaion echniques Rohi Sardana Pursuing Maser of echnology (Compuer Science and Engineering) GJU S& Hissar, Haryana Absrac Image
More informationA Smart Sensor with Hyperspectral/Range Fovea and Panoramic Peripheral View
A Smar Sensor wih Hyperspecral/Range Fovea and Panoramic Peripheral View Tao Wang,2, Zhigang Zhu,2 and Harvey Rhody 3 Deparmen of Compuer Science, The Ciy College of New York 38 h Sree and Conven Avenue,
More information(This lesson plan assumes the students are using an air-powered rocket as described in the Materials section.)
The Mah Projecs Journal Page 1 PROJECT MISSION o MArs inroducion Many sae mah sandards and mos curricula involving quadraic equaions require sudens o solve "falling objec" or "projecile" problems, which
More informationIndustrial, High Repetition Rate Picosecond Laser
RAPID Indusrial, High Repeiion Rae Picosecond Laser High Power: RAPID is a very cos efficien, compac, diode pumped Nd:YVO4 picosecond laser wih 2 W average power a 1064 nm. Is 10 ps-pulses have high pulse
More informationA New Voltage Sag and Swell Compensator Switched by Hysteresis Voltage Control Method
Proceedings of he 8h WSEAS Inernaional Conference on ELECTRIC POWER SYSTEMS, HIGH VOLTAGES, ELECTRIC MACHINES (POWER '8) A New Volage Sag and Swell Compensaor Swiched by Hyseresis Volage Conrol Mehod AMIR
More information