{"title":"Real time obstacle motion prediction using neural network based extended Kalman filter for robot path planning","authors":"Najva Hassan, Abdulrahman Saleem","doi":"10.48129/kjs.18361","DOIUrl":null,"url":null,"abstract":"Navigation in dynamic environments for mobile robots is a difficult problem as it involves estimating the path of moving obstacles. The measured data usually contains a bias and noise in addition to its true value. Based on a stacked denoising autoencoder (SDAE), the enhanced Kalman filter developed in this paper can estimate the obstacle position from any type of noisy input. The extended Kalman filter's ability to predict an error-free path is impacted by the measurement noise covariance matrix employed. The SDAE is a neural network topology based on deep learning that can be used to determine the optimum covariance matrix. Both Adam and stochastic gradient learning algorithms are used to train the neural network. The robot's path is re-planned based on the predicted obstacle path to ensure safe navigation. MATLAB-based numerical simulations are used to demonstrate the utility and superiority of the proposed method over the traditional Kalman filter and Particle filter methodologies. The simulation results show that in the presence of any sort of noise, the proposed technique is exceptionally durable and reliable. The simulation findings also reveal that when it comes to denoising the measured data, the stacked denoising autoencoder with Adam optimizer is more efficient than the stochastic approach. The performance of the developed algorithm is validated in MATLAB simulated environments, and it can be extended for navigation tasks. In terms of computation time and robustness in closely spaced obstacles, simulation experiments demonstrated that the path planning using the proposed algorithm outperforms the hybrid A star, artificial potential field, and decision algorithms.","PeriodicalId":49933,"journal":{"name":"Kuwait Journal of Science & Engineering","volume":"6 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Kuwait Journal of Science & Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.48129/kjs.18361","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Navigation in dynamic environments for mobile robots is a difficult problem as it involves estimating the path of moving obstacles. The measured data usually contains a bias and noise in addition to its true value. Based on a stacked denoising autoencoder (SDAE), the enhanced Kalman filter developed in this paper can estimate the obstacle position from any type of noisy input. The extended Kalman filter's ability to predict an error-free path is impacted by the measurement noise covariance matrix employed. The SDAE is a neural network topology based on deep learning that can be used to determine the optimum covariance matrix. Both Adam and stochastic gradient learning algorithms are used to train the neural network. The robot's path is re-planned based on the predicted obstacle path to ensure safe navigation. MATLAB-based numerical simulations are used to demonstrate the utility and superiority of the proposed method over the traditional Kalman filter and Particle filter methodologies. The simulation results show that in the presence of any sort of noise, the proposed technique is exceptionally durable and reliable. The simulation findings also reveal that when it comes to denoising the measured data, the stacked denoising autoencoder with Adam optimizer is more efficient than the stochastic approach. The performance of the developed algorithm is validated in MATLAB simulated environments, and it can be extended for navigation tasks. In terms of computation time and robustness in closely spaced obstacles, simulation experiments demonstrated that the path planning using the proposed algorithm outperforms the hybrid A star, artificial potential field, and decision algorithms.