Qingmei Yang, Qingxin Meng, Jianmin Sun, Zhixing Wang
{"title":"Research on location system of move-in-mud robot based on Kalman filter","authors":"Qingmei Yang, Qingxin Meng, Jianmin Sun, Zhixing Wang","doi":"10.1109/WCICA.2004.1342413","DOIUrl":"https://doi.org/10.1109/WCICA.2004.1342413","url":null,"abstract":"Data fusion methods are widely used in autonomous robots' measurement system in order to acquire more comprehensive and more exact information. Move-in-mud Robot is a kind of autonomous robots, which is used to substitute for excavating hole underwater in wreck salvage by diver according to a planned trajectory. Location of the robot is one of keys in study on Move-in-mud Robot, which is the base of move according to planned trajectory. Based on the analysis of automotive robot orientation ways, location system is designed in the paper and location principle of move-in-mud robot is analyzed. Kalman filter is used to fuse redundant depth information of the robot. The fusion arithmetic is simulated and the result of simulation showed that the fusion not only improve location precision efficiently, but also improve reliability of location.","PeriodicalId":331407,"journal":{"name":"Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788)","volume":"163 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116119555","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}
{"title":"A human vision inspired optical wavelet filter for image data compression","authors":"F. Tian, Yunhong Liu, S.X. Yang, Xiujian Chen","doi":"10.1109/WCICA.2004.1342253","DOIUrl":"https://doi.org/10.1109/WCICA.2004.1342253","url":null,"abstract":"An optical wavelet filter is proposed for fast image data compression, which is inspired from the error tolerance ability in human visual system. The upper boundary estimation of the filter is given, which is the criterion for the design of the optical filter. Experiments show that the accuracy reached by jet printer can only satisfy the requirement of pattern recognizing rather than that of image data compression.","PeriodicalId":331407,"journal":{"name":"Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788)","volume":"186 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116136181","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}
{"title":"Performance comparison of two synchronization schemes for Colpitts circuits based chaotic communication system over noise channel","authors":"Zhiguo Shi, J. Huangfu, L. Ran","doi":"10.1109/WCICA.2004.1340842","DOIUrl":"https://doi.org/10.1109/WCICA.2004.1340842","url":null,"abstract":"The synchronization performance of the Pecora-Carroll scheme and the error feedback scheme was investigated for two coupled chaotic Colpitts circuits. Both the mathematical derivation and numeric simulations indicate that the error feedback synchronization scheme outperforms the Pecora-Carroll synchronization scheme when the chaotic signal is transmitted over a noisy channel in which there exist an additive white Gaussian noise source and a channel filter. As a result, the information embedded in the chaotic signal, which passes a noisy channel from the transmitter to the receiver, can be recovered in a better way when the error feedback synchronization scheme is used.","PeriodicalId":331407,"journal":{"name":"Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116397455","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}
{"title":"Application of image monitoring technique in remote monitoring system for insulators","authors":"Min Li, Wei Cai, Zheng Tan","doi":"10.1109/WCICA.2004.1343698","DOIUrl":"https://doi.org/10.1109/WCICA.2004.1343698","url":null,"abstract":"Based on the telemetry system for insulators, an image monitoring strategy adopting global system for mobile communication short message service data transfer technology is presented to monitor the towers, insulators, and the situation of ice-covered power transmission lines. Considering the characteristics of the monitoring images, a JPEG-like algorithm was designed to achieve high compression ratio. A quantization model based on expected compression ratio was adopted and improved. Two instances, brightness variation and insulators' flashover, were adopted and compressed. According to the results, the image data are compressed to tens or hundreds of bytes, only one piece or several pieces of SMS are needed to transmit them. The techniques discussed in this paper can be used in still image monitoring for other equipments in power system, which give scientific support for transition from plan maintenance to state maintenance.","PeriodicalId":331407,"journal":{"name":"Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122318202","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}
{"title":"Scheduling a no-wait flowshop with separated setup and removal times","authors":"Jun-lin Chang, Zhengjun Xing, Hui-he Shao, Bingzhen Pei","doi":"10.1109/WCICA.2004.1343040","DOIUrl":"https://doi.org/10.1109/WCICA.2004.1343040","url":null,"abstract":"Consider the two-machine no-wait flowshop problem where the setup and removal times of a job at each machine are separated from the processing time. The scheduling objective is to minimize the sum of the total flowtime. Two optimization properties are first developed. In view of the NP-hard of this problem, optimal solutions seem unnecessary especially when the number of jobs is large. Then, combined the developed optimization properties with the greedy search a heuristic algorithm is developed. Computational experience demonstrates the effectiveness of the heuristic algorithm in finding near optimal schedules.","PeriodicalId":331407,"journal":{"name":"Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122646073","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}
{"title":"Research on modeling method of artificial neural network based on DEA","authors":"Caicong Wu, Xiuwan Chen, Yin-sheng Yang","doi":"10.1109/WCICA.2004.1341933","DOIUrl":"https://doi.org/10.1109/WCICA.2004.1341933","url":null,"abstract":"A modeling method of artificial neural network (ANN) is proposed. Experimental data were evaluated and projected by using data envelopment analysis (DEA), a widely used method to evaluate relative efficiency between decision making units. The data would become more scientific and reasonable, and all of them could be used for the modeling of ANN. Example shows that the model of ANN, which is gained by training these data, is DEA effective. Hence, it is a new method for optimal data utilizing and modeling. This method is useful to the research, which may only get limited and high cost data after several times or several years of experiments.","PeriodicalId":331407,"journal":{"name":"Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122728938","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}
{"title":"A Pr/T-Net model for context-free language parsing","authors":"Erqing Xu","doi":"10.1109/WCICA.2004.1341913","DOIUrl":"https://doi.org/10.1109/WCICA.2004.1341913","url":null,"abstract":"This paper presents a Context-Free Grammar-Predicate/Transition-Net (CFG-Pr/T-Net) model for the parsing of context-free language. The places are defined to represent the states of the parsing process. The conditions and actions carried by the transitions are defined such that non-terminal symbols being processed can be rewritten and the derivation can be made to grow. Data structures, as the personalities of the token, are defined such that the growing derivation can be stored in the token. An application example was examined and the result shows that the Pr/T-Net model can do syntactic parsing successfully. The CFG-Pr/T-Net overcomes the limitation of pushdown automata, which only judged whether a string belonged to a given context free language, but were not able to answer the question concerning syntactic structure.","PeriodicalId":331407,"journal":{"name":"Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122755008","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}
{"title":"A kind of shortest time limit transportation problem with cost constraints","authors":"Zhenning Dong, Jianhua Ma","doi":"10.1109/WCICA.2004.1343060","DOIUrl":"https://doi.org/10.1109/WCICA.2004.1343060","url":null,"abstract":"This paper considers the shortest time limit transportation problem with storage cost upper limitation on bipartite graph. The authors prove that its feasible solution corresponds to that of transportation problem uniquely, the basic feasible solution of transportation problem corresponds to its basic solution, and the optimal solution of transportation problem is one of its optimal solutions. Then we revise the transportation cost of the edge with longer transportation time into /spl infin/ continuously, and get its optimal solution by solving the transportation problem. Finally, the authors present an example to show that the algorithm runs easily and quickly.","PeriodicalId":331407,"journal":{"name":"Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122926892","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}
{"title":"Torque ripple minimization in PM synchronous motors based on backstepping neural network","authors":"Z. Xiangdong, Wang Jiang, Li Huiyan","doi":"10.1109/WCICA.2004.1342350","DOIUrl":"https://doi.org/10.1109/WCICA.2004.1342350","url":null,"abstract":"The electromagnetic torque introduces ripples into the system due to the nonlinearity of the permanent magnetic field and the change of the stator winding, which generate speed oscillations and deteriorate the performance of PM synchronous motor (PMSM). In this paper, we have given the numerical description of the ripples and proposed backstepping Neural Network (NN) control scheme to minimize them. First, online weight-tuning based NNs compensate the torque nonlinearity and external disturbances with its approximation characteristic, and make them satisfy the linear parameter requirement of backstepping; Second, backstepping is applied based on the model of PMSM; At last, the comparison simulation with PID are added to demonstrate the effectiveness of the proposed method.","PeriodicalId":331407,"journal":{"name":"Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122937638","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}
{"title":"A modified fair aggregate marking algorithm in DiffServ","authors":"Qinghua Xiao, Ling-di Ping, Xuezeng Pan","doi":"10.1109/WCICA.2004.1340889","DOIUrl":"https://doi.org/10.1109/WCICA.2004.1340889","url":null,"abstract":"With the emergence of network real time application, the need for quality of service (QoS) in the Internet has been given a rise. IETF has proposed a service model - DiffServ, which for its extensibility, has been widely accepted as a promising model. However, researchers found unfairness in DiffServ network. To solve this problem, this paper analyzed the inherent shortcomings of marker based on token bucket (TB) and time sliding window (TSW) in DiffServ, and proposed a new traffic rate estimator algorithm. This algorithm can tolerate the short-term burst of IP flows as well as reflecting the flows' temporal-behavior. Afterwards, a modified fair aggregate marking (MFAM) algorithm was presented based on the traffic rate estimator algorithm mentioned above. It contributes to fair sharing of excess bandwidth among aggregates. The author validated MFAM algorithm through simulation experimentation, and compared its performance with some other marking algorithms. The results show that MFAM algorithm has better fairness than others.","PeriodicalId":331407,"journal":{"name":"Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114245635","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}