شماره مدرك :
8052
شماره راهنما :
7487
پديد آورنده :
صادقي، علي
عنوان :

ارائه ي روشي جديد به منظور بهبود حافظه اي اشغالي الگوريتم مسير يابي * Delayed D

مقطع تحصيلي :
كارشناسي ارشد
گرايش تحصيلي :
معماري كامپيوتر
محل تحصيل :
اصفهان: دانشگاه صنعتي اصفهان، دانشكده برق و كامپيوتر
سال دفاع :
1391
صفحه شمار :
ده،86ص.: مصور،جدول،نمودار
يادداشت :
ص.ع.به فارسي و انگليسي
استاد راهنما :
مازيار پالهنگ
توصيفگر ها :
ناوبري ربات , الگوريتم هاي حافظه - محدود
تاريخ نمايه سازي :
30/7/92
استاد داور :
محمدعلي منتظري، رسول موسوي
دانشكده :
مهندسي برق و كامپيوتر
كد ايرانداك :
ID7487
چكيده فارسي :
به فارسي و انگليسي: قابل رويت در نسخه ديجيتالي
چكيده انگليسي :
New Method for Improvement Memory usages of Delayed D Algorithm Ali Sadeghi ali sadeghi@ec iut ac ir Date of Submission 2013 01 23 Department of Electrical and Computer Engineering Isfahan University of Technology Isfahan 84156 83111 Iran Degree M Sc Language Farsi Supervisor Maziar Palhang palhang@cc iut ac ir Abstract In simple words path planning is the method an agent uses to determine how to move from point A to point B Path planning is a very important field within artificial intelligence For example path planning algorithms are being used by NASA researches for the Mars Rover Some of the most popular computer games involve the use of path planning algorithms for non player characters Path planning algorithms also are used in communication networks The alignment of multiple DNA or protein sequences can be formalized as a shortest path problem In short each time that the agent needs to move from one place to another in an environment finding the shortest path would be important For this purpose many algorithms are offered such as SMA and MD for static and dynamic environments respectively However MD uses little memory for implementing path planning algorithms but its runtime is too much As time is an important factor in path planning algorithms we presented an algorithm for dynamic environments that obviated the speed problem of MD that is called MDelayed D Our algorithm is about two times faster than MD Also presented algorithm is compared with Delayed D Delayed D uses only about 0 15 memories that Delayed D uses and is proper for dynamic environments that memory is limited Keywords Robot Navigation Path Planning algorithms Memory Bounded algorithms Delayed D algorithm PDF created with pdfFactory trial version www pdffactory com
استاد راهنما :
مازيار پالهنگ
استاد داور :
محمدعلي منتظري، رسول موسوي
لينک به اين مدرک :

بازگشت