درست في البحث الآليات اللازمة لجعل عربة روبوتية تقوم بملاحقة مسار محدد مسبقاً كي تسير عليه بحيث تتمكن تلك العربة من سلوك ذلك المسار و العودة إليه في حال انحرفت عنه في أثناء حركتها. و قد استخدمت في البحث الخوارزميات الآتية لملاحقة المسار:
1- خوارزمية ملاحقة الجزرة
2- خوارزمية الملاحقة الصافية
3- خوارزمية ملاحقة الماضي
و قد استخدم برنامج التحليل الإحصائي (MATLAB) لعمل محاكي لحركة العربة الروبوتية التي تستخدم تلك الخوارزميات. و قد وجدنا نتيجة للدراسة أن خوارزمية ملاحقة الجزرة تتميز ببساطتها في الفهم و التطبيق، إلا أنها تؤدي إلى أخطاء أكبر في الموقع و انحراف أكبر عن المسار، و من مشكلاتها أيضاً أنها تؤدي إلى ميل العربة إلى أخذ الاختصارات إِذ تسير العربة متوجهة مباشرةً إلى النقطة الهدف بدلاً من سلوك انحناءات المسار. و تعاني خوارزمية الملاحقة الصافية من المشكلات نفسها و لكن على نحو أقل حدية، في حين أن خوارزمية ملاحقة الماضي تقوم بملاحقة مثالية للمسار؛ و ذلك من أجل شروط و معاملات دراسة محددة.
In this research a review of methods needed to make a vehicle follow a predefined path has been done where
the vehicle can follow the path and return to it if any deviation happened. The following Algorithms have
been applied to follow the path:
1- Follow The Carrot [1] Algorithm
2- Pure Pursuit [2] Algorithm
3- Follow The Past [3] Algorithm
The implementation of these algorithms has been done by using statistical analysis software (MATLAB) to
make a robotic vehicle movement simulator that uses algorithms to follow a predefined path (recorded path).
We have found as a result that the (Follow the Carrot) algorithm is simple for understanding and applying,
on the other hand it causes larger errors in position and larger deviation from the path.
Also in the (Follow the Carrot) algorithm, the vehicle tends to take short cuts and moves directly towards the
goal point instead of moving on path curves.
Pure Pursuit algorithm also suffers from the same problems, but not in the same critical way, where we can
get better proportion results .Whereas the (Follow the Past) algorithm achieves a perfect path tracking for
applying certain conditions and study parameters.
References used
MATTHEW J.BARTON. Controller Development and Implementation for Path Planning and Following in an Autonomous Urban Vehicle. Undergraduate thesis, University of Sydney, November 2001
R.CRAIG COULTER. Implementation of the Pure Pursuit Path Tracking Algorithms. Technical Report CMU-RI-TR-92-01, Robotic Institute, Carnegie Mellon University, Pittsburgh، PA, January 1992
THOMAS HELLSTROM, OLA RINGDAHL. Follow the Past- a Path Tracking Algorithm for Autonomous Forest Vehicle. SE-901 87, University of Ume، Sweden, April 2004
THOMAS HELLSTROM. Autonomous Navigation for Forest Machines. Pre-study, University of Umea, Aug 200
The shortest path problem can be categorized in to two
different problems; single source shortest path problem (SSSP) and
all pair shortest algorithm (APSP). In this paper, analysis and
comparison between complexity of the famous shortest path
al
The purpose of this research is to enhance fractional numbers precision
according to the new representation of fractional numbers, adding some extra
cost to the hardware so we suggest a new number system per representing of
fractional numbers in c
In this paper we review and list, the advantages and limitations of the significant
effective techniques employed or developed in text plagiarism detection. It was found that
many of the proposed methods for plagiarism detection have a weakness poi
The sound is an essential component of multimedia, and due to the needto be used in
many life applications such as television broadcasting andcommunication programs, so it
was necessary for the existence of audio signal processing techniquessuch as
The results of social market economy exercise in Syria have been arguably debated. Some took a firm stand in defending it, while others harshly criticized it. This research aims at providing an unbiased assessment of the social market economy exercis