تخطي إلى التنقل الرئيسي تخطي إلى البحث تخطي إلى المحتوى الرئيسي

Optimal obstacle avoidance based on the Hamilton-Jacobi-Bellman equation

نتاج البحث: فصل من :كتاب / تقرير / مؤتمر › منشور من مؤتمر › مراجعة النظراء

12 اقتباسات (Scopus)

ملخص

This paper presents a method for generating shortest paths in cluttered environments, based on the Hamilton-Jacobi-Bellman (HJB) equation. Formulating the shortest obstacle avoidance problem as a time optimal control problem, the shortest paths are generated by following the negative gradient of the return function, which satisfies the HJB equation. A method to generate near-optimal paths is also presented, based on a pseudo return function. Paths generated by this method are guaranteed to reach the goal, at which the pseudo return function is shown to have a unique minimum. The computation required to generate the nearoptimal paths is substantially lower than those of traditional potential field methods, making it applicable to on-line obstacle avoidance. Examples with circular obstacles demonstrate close correlation between the near-optimal and optimal paths, and the advantages of the proposed approach over traditional potential field methods.

اللغة الأصليةالإنجليزيّة
عنوان منشور المضيفProceedings - IEEE International Conference on Robotics and Automation
المحررون Anon
الصفحاتVar pagings
طبعةpt 3
حالة النشرنُشِر - 1994
منشور خارجيًانعم
الحدثProceedings of the 1994 IEEE International Conference on Robotics and Automation. Part 3 (of 4) - San Diego, CA, USA
المدة: 8 مايو 1994 → 13 مايو 1994

سلسلة المنشورات

الاسمProceedings - IEEE International Conference on Robotics and Automation
الرقمpt 3
رقم المعيار الدولي للدوريات (المطبوع)1050-4729

!!Conference

!!ConferenceProceedings of the 1994 IEEE International Conference on Robotics and Automation. Part 3 (of 4)
المدينةSan Diego, CA, USA
المدة8/05/94 → 13/05/94

بصمة

أدرس بدقة موضوعات البحث “Optimal obstacle avoidance based on the Hamilton-Jacobi-Bellman equation'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا