Severity: Warning
Message: file_get_contents(https://...@gmail.com&api_key=61f08fa0b96a73de8c900d749fcb997acc09&a=1): Failed to open stream: HTTP request failed! HTTP/1.1 429 Too Many Requests
Filename: helpers/my_audit_helper.php
Line Number: 176
Backtrace:
File: /var/www/html/application/helpers/my_audit_helper.php
Line: 176
Function: file_get_contents
File: /var/www/html/application/helpers/my_audit_helper.php
Line: 250
Function: simplexml_load_file_from_url
File: /var/www/html/application/helpers/my_audit_helper.php
Line: 1034
Function: getPubMedXML
File: /var/www/html/application/helpers/my_audit_helper.php
Line: 3152
Function: GetPubMedArticleOutput_2016
File: /var/www/html/application/controllers/Detail.php
Line: 575
Function: pubMedSearch_Global
File: /var/www/html/application/controllers/Detail.php
Line: 489
Function: pubMedGetRelatedKeyword
File: /var/www/html/index.php
Line: 316
Function: require_once
In most practical applications, the tracking process needs to update the data constantly. However, outliers may occur frequently in the process of sensors' data collection and sending, which affects the performance of the system state estimate. In order to suppress the impact of observation outliers in the process of target tracking, a novel filtering algorithm, namely a robust adaptive unscented Kalman filter, is proposed. The cost function of the proposed filtering algorithm is derived based on fading factor and maximum correntropy criterion. In this paper, the derivations of cost function and fading factor are given in detail, which enables the proposed algorithm to be robust. Finally, the simulation results show that the presented algorithm has good performance, and it improves the robustness of a general unscented Kalman filter and solves the problem of outliers in system.
Download full-text PDF |
Source |
---|---|
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC6112039 | PMC |
http://dx.doi.org/10.3390/s18082406 | DOI Listing |
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!