Melola Discovery

← Melola Discovery

Jurnal SINTA 1

A MAPAEKF-SLAM ALGORITHM WITH RECURSIVE MEAN AND COVARIANCE OF PROCESS AND MEASUREMENT NOISE STATISTIC

Sinergi · Vol. 24 No. 1 (2019) · hlm. 37–48

DOI
10.22441/sinergi.2020.1.006
ISSN
2460-1217, 1410-2331
Terbit
2019-12-30
Penerbit
Universitas Mercu Buana
Bahasa
eng

Abstrak

The most popular filtering method used for solving a Simultaneous Localization and Mapping is the Extended Kalman Filter. Essentially, it requires prior stochastic knowledge both the process and measurement noise statistic. In order to avoid this requirement, these noise statistics have been defined at the beginning and kept to be fixed for the whole process. Indeed, it will satisfy the desired robustness in the case of simulation. Oppositely, due to the continuous uncertainty affected by the dynamic system under time integration, this manner is strongly not recommended. The reason is, improperly defined noise will not only degrade the filter performance but also might lead the filter to divergence condition. For this reason, there has been a strong manner well-termed as an adaptive-based strategy that commonly used to equip the classical filter for having an ability to approximate the noise statistic. Of course, by knowing the closely responsive noise statistic, the robustness and accuracy of an EKF can increase. However, most of the existed Adaptive-EKF only considered that the process and measurement noise statistic are characteristically zero-mean and responsive covariances. Accordingly, the robustness of EKF can still be enhanced. This paper presents a proposed method named as a MAPAEKF-SLAM algorithm used for solving the SLAM problem of a mobile robot, Turtlebot2. Sequentially, a classical EKF was estimated using Maximum a Posteriori. However, due to the existence of unobserved value, EKF was also smoothed one time based on the fixed-interval smoothing method. This smoothing step aims to keep-up the derivation process under MAP creation. Realistically, this proposed method was simulated and compared to the conventional one. Finally, it has been showing better accuracy in terms of Root Mean Square Error (RMSE) of both Estimated Map Coordinate (EMC) and Estimated Path Coordinate (EPC).

Kata kunci

Jaringan kolaborasi para penulis

19 penulis · 55 tautan kepenulisan bersama · 27 lintas organisasi

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • Mercu Buana University
  • Shanghai University
  • Shenzhen Polytechnic University
  • University of Technology Malaysia
  • Tun Hussein Onn University of Malaysia
  • Universitas Muhammadiyah Prof Dr Hamka
  • Yuan Ze University
  • Afiliasi tidak diketahui
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
Julpri AndikaMercu Buana University10
Andi AdriansyahMercu Buana University6
Muhammad Hafizd Ibnu HajarMercu Buana University6
Achmad BurhanudinMercu Buana University4
Ahmad Athif Mohd FaudziUniversity of Technology Malaysia3
Yudhi GunardiMercu Buana University3
Abu Ubaidah ShamsudinTun Hussein Onn University of Malaysia2
Nur Aziz TaufikurohmanMercu Buana University2
January Dwidasa WiniyogaMercu Buana University1
Prastika IndriyantiMercu Buana University1
Arafat FebriandirzaUniversitas Muhammadiyah Prof Dr Hamka1
Yudi HastomiMercu Buana University1
Fina SupeginaMercu Buana University1
Isack FaradyYuan Ze University1

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OAI-PMH (metadata jurnal) https://publikasi.mercubuana.ac.id/index.php/sinergi/oai, pertama di-harvest 10 Nov 2026, terakhir terlihat 16 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">A MAPAEKF-SLAM ALGORITHM WITH RECURSIVE MEAN AND COVARIANCE OF PROCESS AND MEASUREMENT NOISE STATISTIC</dc:title>
	<dc:creator>Suwoyo, Heru</dc:creator>
	<dc:creator>Tian, Yingzhong</dc:creator>
	<dc:creator>Wang, Wenbin</dc:creator>
	<dc:creator>Hossain, Md Musabbir</dc:creator>
	<dc:creator>Li, Long</dc:creator>
	<dc:subject xml:lang="en-US">Simultaneous Localization and Mapping</dc:subject>
	<dc:subject xml:lang="en-US">Adaptive Extended Kalman Filter</dc:subject>
	<dc:subject xml:lang="en-US">Maximum a Posteriori</dc:subject>
	<dc:subject xml:lang="en-US">Fixed-Interval Smoothing Method</dc:subject>
	<dc:subject xml:lang="en-US">Root Mean Square Error</dc:subject>
	<dc:description xml:lang="en-US">The most popular filtering method used for solving a Simultaneous Localization and Mapping is the Extended Kalman Filter. Essentially, it requires prior stochastic knowledge both the process and measurement noise statistic. In order to avoid this requirement, these noise statistics have been defined at the beginning and kept to be fixed for the whole process. Indeed, it will satisfy the desired robustness in the case of simulation. Oppositely, due to the continuous uncertainty affected by the dynamic system under time integration, this manner is strongly not recommended. The reason is, improperly defined noise will not only degrade the filter performance but also might lead the filter to divergence condition. For this reason, there has been a strong manner well-termed as an adaptive-based strategy that commonly used to equip the classical filter for having an ability to approximate the noise statistic. Of course, by knowing the closely responsive noise statistic, the robustness and accuracy of an EKF can increase. However, most of the existed Adaptive-EKF only considered that the process and measurement noise statistic are characteristically zero-mean and responsive covariances. Accordingly, the robustness of EKF can still be enhanced. This paper presents a proposed method named as a MAPAEKF-SLAM algorithm used for solving the SLAM problem of a mobile robot, Turtlebot2. Sequentially, a classical EKF was estimated using Maximum a Posteriori. However, due to the existence of unobserved value, EKF was also smoothed one time based on the fixed-interval smoothing method. This smoothing step aims to keep-up the derivation process under MAP creation. Realistically, this proposed method was simulated and compared to the conventional one. Finally, it has been showing better accuracy in terms of Root Mean Square Error (RMSE) of both Estimated Map Coordinate (EMC) and Estimated Path Coordinate (EPC).       </dc:description>
	<dc:publisher xml:lang="en-US">Universitas Mercu Buana</dc:publisher>
	<dc:date>2019-12-30</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://publikasi.mercubuana.ac.id/index.php/sinergi/article/view/6066</dc:identifier>
	<dc:identifier>10.22441/sinergi.2020.1.006</dc:identifier>
	<dc:source xml:lang="en-US">SINERGI; Vol. 24 No. 1 (2020); 37-48</dc:source>
	<dc:source>2460-1217</dc:source>
	<dc:source>1410-2331</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://publikasi.mercubuana.ac.id/index.php/sinergi/article/view/6066/3202</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2020 SINERGI</dc:rights>
</oai_dc:dc>