Improving Processing Time for the Location Algorithm of Robots

المؤلفون المشاركون

Chen, Jing
Chen, Liwen

المصدر

Discrete Dynamics in Nature and Society

العدد

المجلد 2020، العدد 2020 (31 ديسمبر/كانون الأول 2020)، ص ص. 1-6، 6ص.

الناشر

Hindawi Publishing Corporation

تاريخ النشر

2020-09-02

دولة النشر

مصر

عدد الصفحات

6

التخصصات الرئيسية

الرياضيات

الملخص EN

The paper proposes an algorithm based on the Multi-State Constraint Kalman Filter (MSCKF) algorithm to construct the map for robots special in the poor GPS signal environment.

We can calculate the position of the robots with the data collected by inertial measurement unit and the features extracted by the camera with MSCKF algorithm in a tight couple way.

The paper focuses on the way of optimizing the position because we adopt it to compute Kalman gain for updating the state of robots.

In order to reduce the processing time, we design a novel fast Gauss–Newton MSCKF algorithm to complete the nonlinear optimization.

Compared with the performance of conventional MSCKF algorithm, the novel fast-location algorithm can reduce the processing time with the kitti datasets.

نمط استشهاد جمعية علماء النفس الأمريكية (APA)

Chen, Jing& Chen, Liwen. 2020. Improving Processing Time for the Location Algorithm of Robots. Discrete Dynamics in Nature and Society،Vol. 2020, no. 2020, pp.1-6.
https://search.emarefa.net/detail/BIM-1152839

نمط استشهاد الجمعية الأمريكية للغات الحديثة (MLA)

Chen, Jing& Chen, Liwen. Improving Processing Time for the Location Algorithm of Robots. Discrete Dynamics in Nature and Society No. 2020 (2020), pp.1-6.
https://search.emarefa.net/detail/BIM-1152839

نمط استشهاد الجمعية الطبية الأمريكية (AMA)

Chen, Jing& Chen, Liwen. Improving Processing Time for the Location Algorithm of Robots. Discrete Dynamics in Nature and Society. 2020. Vol. 2020, no. 2020, pp.1-6.
https://search.emarefa.net/detail/BIM-1152839

نوع البيانات

مقالات

لغة النص

الإنجليزية

الملاحظات

Includes bibliographical references

رقم السجل

BIM-1152839