Pub Date : 2016-10-01DOI: 10.1109/ICCAIS.2016.7822437
S. Awan, Sidra Rashid, Mingze Gao, G. Qu
Obfuscation has emerged as a promising approach to ensure supply chain security by countering the reverse engineering (RE) based attacks on integrated circuits that violate intellectual property rights of the circuit designer. However, current obfuscation methods either rely on secure memory to store the key or incur large design overhead with camouflaged gates. We propose a set of don't care based obfuscation primitives and show how they can be used to make the design IP secure with little area and delay overhead. While existing logic obfuscation techniques rely on hiding layout information from circuit attackers, our approach is different in that we introduce confusion in the sub-circuit functionality in order to increase the RE complexity while meeting the overall circuit specification. We also study how to maximize the complexity of the RE attacks and incorporate the conclusion of such a study into the proposed don't care based obfuscation method. Simulation results for ISCAS-85 benchmarks confirm that we can achieve circuit obfuscation with very high RE complexity and small design overhead, more specifically, an average 7.73% delay overhead and 5.51% area overhead.
{"title":"Security through obscurity: Integrated circuit obfuscation using don't care conditions","authors":"S. Awan, Sidra Rashid, Mingze Gao, G. Qu","doi":"10.1109/ICCAIS.2016.7822437","DOIUrl":"https://doi.org/10.1109/ICCAIS.2016.7822437","url":null,"abstract":"Obfuscation has emerged as a promising approach to ensure supply chain security by countering the reverse engineering (RE) based attacks on integrated circuits that violate intellectual property rights of the circuit designer. However, current obfuscation methods either rely on secure memory to store the key or incur large design overhead with camouflaged gates. We propose a set of don't care based obfuscation primitives and show how they can be used to make the design IP secure with little area and delay overhead. While existing logic obfuscation techniques rely on hiding layout information from circuit attackers, our approach is different in that we introduce confusion in the sub-circuit functionality in order to increase the RE complexity while meeting the overall circuit specification. We also study how to maximize the complexity of the RE attacks and incorporate the conclusion of such a study into the proposed don't care based obfuscation method. Simulation results for ISCAS-85 benchmarks confirm that we can achieve circuit obfuscation with very high RE complexity and small design overhead, more specifically, an average 7.73% delay overhead and 5.51% area overhead.","PeriodicalId":407031,"journal":{"name":"2016 International Conference on Control, Automation and Information Sciences (ICCAIS)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126296909","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-10-01DOI: 10.1109/ICCAIS.2016.7822451
Xiaojing Yu, Xiaoqi Tang, Bosheng Ye, Bao Song, Xiangdong Zhou
Path tracking, as a subproblem in trajectory planning, is one of the most significant topics in robot researches. In this paper, a time-optimal trajectory planner is proposed, which tracks the specified B-spline path with limit jerk. This planner utilizes the master-slave strategy to plan trajectory for all axes. In the preprocessing stage, switching points are divided into two types: critical points and axis switching points. By detailed classification and S-shape velocity planning of adjacent critical points, the continuous turning problem in B-spline curves is solved. In order to reduce the global execution time under the physical constraints, an iterative optimization method is employed in the velocity profile and the bang-bang control with limit jerk is realized. The proposed algorithms are simulated on a manipulator model with three links. The result shows that the algorithms can be applied to complex B-spline path tracking and generate trajectory for each axis under jerk constraint, which reduces the vibration effectively.
{"title":"Time-optimal path tracking for articulated robot along spline curves based on master-slave strategy","authors":"Xiaojing Yu, Xiaoqi Tang, Bosheng Ye, Bao Song, Xiangdong Zhou","doi":"10.1109/ICCAIS.2016.7822451","DOIUrl":"https://doi.org/10.1109/ICCAIS.2016.7822451","url":null,"abstract":"Path tracking, as a subproblem in trajectory planning, is one of the most significant topics in robot researches. In this paper, a time-optimal trajectory planner is proposed, which tracks the specified B-spline path with limit jerk. This planner utilizes the master-slave strategy to plan trajectory for all axes. In the preprocessing stage, switching points are divided into two types: critical points and axis switching points. By detailed classification and S-shape velocity planning of adjacent critical points, the continuous turning problem in B-spline curves is solved. In order to reduce the global execution time under the physical constraints, an iterative optimization method is employed in the velocity profile and the bang-bang control with limit jerk is realized. The proposed algorithms are simulated on a manipulator model with three links. The result shows that the algorithms can be applied to complex B-spline path tracking and generate trajectory for each axis under jerk constraint, which reduces the vibration effectively.","PeriodicalId":407031,"journal":{"name":"2016 International Conference on Control, Automation and Information Sciences (ICCAIS)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123031024","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-10-01DOI: 10.1109/ICCAIS.2016.7822434
Yanjia Cao, Jing Hu, Tiecheng Song, H. Zhang, Jinghong Guo
An aggregation terminal of the power communication system is proposed in this paper. The terminal takes Samsung Corporation's ARM9 S5PV210 processor as the hardware core, embedded Linux as the operating system. The high-definition network camera is used as the video monitor device, whose interface is Ethernet. The terminal is equipped with 3G/4G LTE and various communication modules and the drivers are transplanted on the ARM Linux system. Based on the link aggregation and the SOCKET communication technology, the software program is designed as the C/S mode using multiple threads of C language. According to experiment results, the terminal can meet the requirements of the video service in the process of electric power communication, improving the efficiency and saving the cost of construction.
{"title":"Design and implementation of power communication terminal based on link aggregation technology","authors":"Yanjia Cao, Jing Hu, Tiecheng Song, H. Zhang, Jinghong Guo","doi":"10.1109/ICCAIS.2016.7822434","DOIUrl":"https://doi.org/10.1109/ICCAIS.2016.7822434","url":null,"abstract":"An aggregation terminal of the power communication system is proposed in this paper. The terminal takes Samsung Corporation's ARM9 S5PV210 processor as the hardware core, embedded Linux as the operating system. The high-definition network camera is used as the video monitor device, whose interface is Ethernet. The terminal is equipped with 3G/4G LTE and various communication modules and the drivers are transplanted on the ARM Linux system. Based on the link aggregation and the SOCKET communication technology, the software program is designed as the C/S mode using multiple threads of C language. According to experiment results, the terminal can meet the requirements of the video service in the process of electric power communication, improving the efficiency and saving the cost of construction.","PeriodicalId":407031,"journal":{"name":"2016 International Conference on Control, Automation and Information Sciences (ICCAIS)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127288021","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-10-01DOI: 10.1109/ICCAIS.2016.7822469
S. Memon, W. Lee, T. Song
This paper extends the smoothing algorithm based on integrated probabilistic data association to track multiple maneuvering targets by applying smoothing to joint integrated probabilistic data association (JIPDA). The proposed algorithm utilizes smoothing data association to obtain smoothing prediction which is needed to calculate the smoothing data association probabilities, the smoothing target trajectory state estimates and the smoothing target existence probability. The smoothing data association probabilities are used to update and propagate the forward tracks for tracking multiple maneuvering targets in clutter. This algorithm is called fixed-interval smoothing JIPDA (JIPDAS). Simulation is carried out to show improved false track discrimination performance over the existing algorithms for tracking multiple maneuvering targets in a heavy cluttered environment.
{"title":"Efficient smoothing for multiple maneuvering targets in heavy clutter","authors":"S. Memon, W. Lee, T. Song","doi":"10.1109/ICCAIS.2016.7822469","DOIUrl":"https://doi.org/10.1109/ICCAIS.2016.7822469","url":null,"abstract":"This paper extends the smoothing algorithm based on integrated probabilistic data association to track multiple maneuvering targets by applying smoothing to joint integrated probabilistic data association (JIPDA). The proposed algorithm utilizes smoothing data association to obtain smoothing prediction which is needed to calculate the smoothing data association probabilities, the smoothing target trajectory state estimates and the smoothing target existence probability. The smoothing data association probabilities are used to update and propagate the forward tracks for tracking multiple maneuvering targets in clutter. This algorithm is called fixed-interval smoothing JIPDA (JIPDAS). Simulation is carried out to show improved false track discrimination performance over the existing algorithms for tracking multiple maneuvering targets in a heavy cluttered environment.","PeriodicalId":407031,"journal":{"name":"2016 International Conference on Control, Automation and Information Sciences (ICCAIS)","volume":"131 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131589481","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-10-01DOI: 10.1109/ICCAIS.2016.7822435
Dan Li, Hongjian Sun, Wei-Yu Chiu
Smart grid (SG) represents intelligent technologies used to address the climate change. Demand side management (DSM) is an essential part of the SG. This paper establishes a layered model for the DSM. The model involves three participants: power generators, including renewable energy sources, demand response (DR) aggregator, and consumers. The revenue of the DR aggregator is analyzed. The discomfortable level caused by the DSM is considered for consumers. This model leads to a multiobjective (MO) problem. An MO evolutionary algorithm is used to find the Pareto front, facilitating the selection of a fair solution. Simulation results illustrate the feasibility of the proposed approach.
{"title":"A layered approach for enabling demand side management in smart grid","authors":"Dan Li, Hongjian Sun, Wei-Yu Chiu","doi":"10.1109/ICCAIS.2016.7822435","DOIUrl":"https://doi.org/10.1109/ICCAIS.2016.7822435","url":null,"abstract":"Smart grid (SG) represents intelligent technologies used to address the climate change. Demand side management (DSM) is an essential part of the SG. This paper establishes a layered model for the DSM. The model involves three participants: power generators, including renewable energy sources, demand response (DR) aggregator, and consumers. The revenue of the DR aggregator is analyzed. The discomfortable level caused by the DSM is considered for consumers. This model leads to a multiobjective (MO) problem. An MO evolutionary algorithm is used to find the Pareto front, facilitating the selection of a fair solution. Simulation results illustrate the feasibility of the proposed approach.","PeriodicalId":407031,"journal":{"name":"2016 International Conference on Control, Automation and Information Sciences (ICCAIS)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117300005","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-10-01DOI: 10.1109/ICCAIS.2016.7822455
Demeng Li, Benlian Xu, Jian Shi
This paper proposes an ant system based state estimation approach for simultaneous localization and mapping (SLAM) in the case of ambiguities both in the feature number and data correspondence. Inspired by the random finite sets (RFS) and its derivative, i.e., probability hypothesis density (PHD), an ant-PHD filtering is proposed to jointly estimate the locations and number of features, moreover, a fast moving ant estimator (F-MAE) is developed for estimating maneuvering vehicle trajectory. In contrast to the state-of-the-art approaches, our algorithm employs the artificial ants instead of simple particles to cluster around their favored regions through ants' positive feedback search mechanism, and also builds a seamless from the filter itself to implementation. Simulated results demonstrate the merits of the proposed approach, which outperforms both the Fast-SLAM and the PHD-SLAM by providing a more accurate map as well as an improved estimate accuracy of the vehicle's trajectory.
{"title":"Ant system based state estimation approach to SLAM","authors":"Demeng Li, Benlian Xu, Jian Shi","doi":"10.1109/ICCAIS.2016.7822455","DOIUrl":"https://doi.org/10.1109/ICCAIS.2016.7822455","url":null,"abstract":"This paper proposes an ant system based state estimation approach for simultaneous localization and mapping (SLAM) in the case of ambiguities both in the feature number and data correspondence. Inspired by the random finite sets (RFS) and its derivative, i.e., probability hypothesis density (PHD), an ant-PHD filtering is proposed to jointly estimate the locations and number of features, moreover, a fast moving ant estimator (F-MAE) is developed for estimating maneuvering vehicle trajectory. In contrast to the state-of-the-art approaches, our algorithm employs the artificial ants instead of simple particles to cluster around their favored regions through ants' positive feedback search mechanism, and also builds a seamless from the filter itself to implementation. Simulated results demonstrate the merits of the proposed approach, which outperforms both the Fast-SLAM and the PHD-SLAM by providing a more accurate map as well as an improved estimate accuracy of the vehicle's trajectory.","PeriodicalId":407031,"journal":{"name":"2016 International Conference on Control, Automation and Information Sciences (ICCAIS)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131616825","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-10-01DOI: 10.1109/ICCAIS.2016.7822432
D. Kim
In this paper, we consider a single object visual tracking problem using multi-object filtering technique. We represent object appearance as a multi-object distribution of keypoints. Hidden positions of keypoints are observed by using SURF feature detectors and multi-Bernoulli filtering is used for tracking of keypoints. Unlike other feature matching based object trackers, multi-Bernoulli filtering based tracker is free from combinatorial matching problem. The estimated number of keypoints can be used as a quality measure to determine track re-initialization when it is necessary. Experimental results show that multi-object filtering can be one of effective solutions for single object visual tracking.
{"title":"Multi-Bernoulli filtering for keypoint-based visual tracking","authors":"D. Kim","doi":"10.1109/ICCAIS.2016.7822432","DOIUrl":"https://doi.org/10.1109/ICCAIS.2016.7822432","url":null,"abstract":"In this paper, we consider a single object visual tracking problem using multi-object filtering technique. We represent object appearance as a multi-object distribution of keypoints. Hidden positions of keypoints are observed by using SURF feature detectors and multi-Bernoulli filtering is used for tracking of keypoints. Unlike other feature matching based object trackers, multi-Bernoulli filtering based tracker is free from combinatorial matching problem. The estimated number of keypoints can be used as a quality measure to determine track re-initialization when it is necessary. Experimental results show that multi-object filtering can be one of effective solutions for single object visual tracking.","PeriodicalId":407031,"journal":{"name":"2016 International Conference on Control, Automation and Information Sciences (ICCAIS)","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132556880","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-10-01DOI: 10.1109/ICCAIS.2016.7822444
Jongmin Yu, Jeonghwan Gwak, M. Jeon
This paper presents a Gaussian-Poisson mixture model (GPMM) which can reflect a frequency of event occurrence, for detecting anomaly of crowd behaviours. GPMM exploits the complementary information of both a statistics of crowd behaviour patterns and a count of the observed behaviour, and we learn the statistics of normal crowd behaviours for behaviours that occur frequently in the past by placing different weights, depending on the frequency occur. GPMM implicitly accounts for the motion patterns and the count of occurrence. The dense optical flow and an interactive force are used to represent a scene. We demonstrate the proposed method on a publicly available dataset, and the experimental results show that the proposed method could achieves competitive performances with respect to state-of-the-art approaches.
{"title":"Gaussian-Poisson mixture model for anomaly detection of crowd behaviour","authors":"Jongmin Yu, Jeonghwan Gwak, M. Jeon","doi":"10.1109/ICCAIS.2016.7822444","DOIUrl":"https://doi.org/10.1109/ICCAIS.2016.7822444","url":null,"abstract":"This paper presents a Gaussian-Poisson mixture model (GPMM) which can reflect a frequency of event occurrence, for detecting anomaly of crowd behaviours. GPMM exploits the complementary information of both a statistics of crowd behaviour patterns and a count of the observed behaviour, and we learn the statistics of normal crowd behaviours for behaviours that occur frequently in the past by placing different weights, depending on the frequency occur. GPMM implicitly accounts for the motion patterns and the count of occurrence. The dense optical flow and an interactive force are used to represent a scene. We demonstrate the proposed method on a publicly available dataset, and the experimental results show that the proposed method could achieves competitive performances with respect to state-of-the-art approaches.","PeriodicalId":407031,"journal":{"name":"2016 International Conference on Control, Automation and Information Sciences (ICCAIS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130088125","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-10-01DOI: 10.1109/ICCAIS.2016.7822436
Long Ge, Jian Shi, Peiyi Zhu
Melt index is considered one of the most important variables in determining chemical product quality and thus reliable prediction of melt index (MI) is essential in practical propylene polymerization processes. In this paper, a fuzzy support vector regression (FSVR) based model for propylene polymerization process is developed to predict the MI of polypropylene from other easily measured process variables. Support vector data description (SVDD) is introduced in this model as a novel fuzzy membership function and to reducing the effect of outliers and noises. A detailed comparison between the standard SVR and SVDD-FSVR models is carried out on a real plant. The research results have confirmed the effectiveness of the presented method.
{"title":"Melt index prediction by support vector regression","authors":"Long Ge, Jian Shi, Peiyi Zhu","doi":"10.1109/ICCAIS.2016.7822436","DOIUrl":"https://doi.org/10.1109/ICCAIS.2016.7822436","url":null,"abstract":"Melt index is considered one of the most important variables in determining chemical product quality and thus reliable prediction of melt index (MI) is essential in practical propylene polymerization processes. In this paper, a fuzzy support vector regression (FSVR) based model for propylene polymerization process is developed to predict the MI of polypropylene from other easily measured process variables. Support vector data description (SVDD) is introduced in this model as a novel fuzzy membership function and to reducing the effect of outliers and noises. A detailed comparison between the standard SVR and SVDD-FSVR models is carried out on a real plant. The research results have confirmed the effectiveness of the presented method.","PeriodicalId":407031,"journal":{"name":"2016 International Conference on Control, Automation and Information Sciences (ICCAIS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130192097","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-10-01DOI: 10.1109/ICCAIS.2016.7822454
Yingbo Cai, Qian Sun, Ya Zhang, Chunzhu Yu, Hongmei Bai
To improve the positioning accuracy in indoor environments, we use the Inertial Navigation System (INS) algorithm to perform the pedestrian tracking, and the measurements consist of two parts: the velocity error and the heading error. The velocity error can be gotten from the navigation result. Meanwhile, we get the heading error in two ways. First, taking the magnetometer as the heading resource, the magnetic perturbations can be eliminated through a new ellipsoid fitting based calibration algorithm. Furthermore, the building heading algorithm(BHA) is also adopted to aid the Inertial Measurement Unit (IMU), the corresponding building heading can be derived based on the motion path. Finally, the Kalman filter (KF) is utilized to fuse the data in order to compensate the sensor error and navigation solution through a 15-dimentional state vector. As a result, some field trials were taken to prove the validity of the proposed algorithm. By contrast the result of Magnetometer (MAG)/BHA/INS and the Zero Velocity update (ZUPT) algorithms, we proved that the algorithm of MAG/BHA aiding INS can effectively improve the indoor positioning accuracy which shows better performance.
{"title":"Integrated navigation for pedestrian with building heading algorithm and inertial measurement unit","authors":"Yingbo Cai, Qian Sun, Ya Zhang, Chunzhu Yu, Hongmei Bai","doi":"10.1109/ICCAIS.2016.7822454","DOIUrl":"https://doi.org/10.1109/ICCAIS.2016.7822454","url":null,"abstract":"To improve the positioning accuracy in indoor environments, we use the Inertial Navigation System (INS) algorithm to perform the pedestrian tracking, and the measurements consist of two parts: the velocity error and the heading error. The velocity error can be gotten from the navigation result. Meanwhile, we get the heading error in two ways. First, taking the magnetometer as the heading resource, the magnetic perturbations can be eliminated through a new ellipsoid fitting based calibration algorithm. Furthermore, the building heading algorithm(BHA) is also adopted to aid the Inertial Measurement Unit (IMU), the corresponding building heading can be derived based on the motion path. Finally, the Kalman filter (KF) is utilized to fuse the data in order to compensate the sensor error and navigation solution through a 15-dimentional state vector. As a result, some field trials were taken to prove the validity of the proposed algorithm. By contrast the result of Magnetometer (MAG)/BHA/INS and the Zero Velocity update (ZUPT) algorithms, we proved that the algorithm of MAG/BHA aiding INS can effectively improve the indoor positioning accuracy which shows better performance.","PeriodicalId":407031,"journal":{"name":"2016 International Conference on Control, Automation and Information Sciences (ICCAIS)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129092547","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}