Pub Date : 2013-06-12DOI: 10.1109/ICCA.2013.6565035
Haolin Feng, X. Chen, Zhijiang Shao
Process model with high fidelity plays an extremely important role in the design and operation for chemical plant. Yet the growing complexity along with fidelity increases the computational time, causing decision delay in RTO (real-time optimization). This study demonstrates a systematical method of model reduction in the application of RTO. The reduced model could get the optimization results much faster without breaking the model structure and keep the model accuracy under an acceptable error tolerance. In this method, a chemical model is first classified as layers according to its structure and the inner layer which is kinetics and thermodynamics layer is mainly chosen for reduction since it takes the most CPU time during simulation and optimization. In the reduction of kinetics, the DRG method is used, and in the reduction of thermodynamics, a Kriging method is used to map the input and output. A numerical case study on an industrial P-Xylene oxidation process problem is applied to validate the method.
{"title":"Structure based model reduction in real-time optimization","authors":"Haolin Feng, X. Chen, Zhijiang Shao","doi":"10.1109/ICCA.2013.6565035","DOIUrl":"https://doi.org/10.1109/ICCA.2013.6565035","url":null,"abstract":"Process model with high fidelity plays an extremely important role in the design and operation for chemical plant. Yet the growing complexity along with fidelity increases the computational time, causing decision delay in RTO (real-time optimization). This study demonstrates a systematical method of model reduction in the application of RTO. The reduced model could get the optimization results much faster without breaking the model structure and keep the model accuracy under an acceptable error tolerance. In this method, a chemical model is first classified as layers according to its structure and the inner layer which is kinetics and thermodynamics layer is mainly chosen for reduction since it takes the most CPU time during simulation and optimization. In the reduction of kinetics, the DRG method is used, and in the reduction of thermodynamics, a Kriging method is used to map the input and output. A numerical case study on an industrial P-Xylene oxidation process problem is applied to validate the method.","PeriodicalId":336534,"journal":{"name":"2013 10th IEEE International Conference on Control and Automation (ICCA)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134498450","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 : 2013-06-12DOI: 10.1109/ICCA.2013.6565082
Shunxiang Wu, Lixiao Zhang, Wenlong Xu, Ting Zhou, D. Luo
Unmanned Aerial Vehicle (UAV) has many advantages, such as miniature,light weight, low cost, excellent and maneuverability and so on, which make it get more and more attention from the military of many countries. A critical limitation for the current use of UAV is their limited range. This paper describes the results of an effort on the modeling of the UAV aerial refueling problem and on how to realize the docking procedure accurately without considering wake effects and natural oscillation of the probe-drogue refueling system. Desirable performances are achieved by the LQR-based control laws for the docking of the UAV to the probe-drogue refueling system. By using the simulation platform of Matlab/Simulink, the simulation results of the tracks of probe and drogue in the docking phrase of aerial refueling are verified. This simulations reveal that the design of the full state feedback controller can realize docking between the tanker and the unmanned aerial vehicle fast and smoothly.
{"title":"Docking control of autonomous aerial refueling for UAV based on LQR","authors":"Shunxiang Wu, Lixiao Zhang, Wenlong Xu, Ting Zhou, D. Luo","doi":"10.1109/ICCA.2013.6565082","DOIUrl":"https://doi.org/10.1109/ICCA.2013.6565082","url":null,"abstract":"Unmanned Aerial Vehicle (UAV) has many advantages, such as miniature,light weight, low cost, excellent and maneuverability and so on, which make it get more and more attention from the military of many countries. A critical limitation for the current use of UAV is their limited range. This paper describes the results of an effort on the modeling of the UAV aerial refueling problem and on how to realize the docking procedure accurately without considering wake effects and natural oscillation of the probe-drogue refueling system. Desirable performances are achieved by the LQR-based control laws for the docking of the UAV to the probe-drogue refueling system. By using the simulation platform of Matlab/Simulink, the simulation results of the tracks of probe and drogue in the docking phrase of aerial refueling are verified. This simulations reveal that the design of the full state feedback controller can realize docking between the tanker and the unmanned aerial vehicle fast and smoothly.","PeriodicalId":336534,"journal":{"name":"2013 10th IEEE International Conference on Control and Automation (ICCA)","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134549096","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 : 2013-06-12DOI: 10.1109/ICCA.2013.6564957
Guo-Wei Hong, K. Lum, Jung-Shan Lin
This paper proposes a fuzzy-grey sliding-mode control (FGSMC) strategy for maximum power point (MPP) tracking in photovoltaic (PV) systems. The problem to be addressed is that the linear reaching law in a previous SMC design has limited reaching speed if control saturation is to be avoided. Hence, a nonlinear reaching law is proposed by means of fuzzy-logic control which employs as inputs the sliding function, and its predicted forward difference provided by a grey-prediction algorithm. Control design is performed on an averaged system model, whereas the performances of FGSMC and SMC are compared in simulation on both the averaged model and the true switching PV system.
{"title":"Fuzzy grey sliding mode control for maximum power point tracking of photovoltaic systems","authors":"Guo-Wei Hong, K. Lum, Jung-Shan Lin","doi":"10.1109/ICCA.2013.6564957","DOIUrl":"https://doi.org/10.1109/ICCA.2013.6564957","url":null,"abstract":"This paper proposes a fuzzy-grey sliding-mode control (FGSMC) strategy for maximum power point (MPP) tracking in photovoltaic (PV) systems. The problem to be addressed is that the linear reaching law in a previous SMC design has limited reaching speed if control saturation is to be avoided. Hence, a nonlinear reaching law is proposed by means of fuzzy-logic control which employs as inputs the sliding function, and its predicted forward difference provided by a grey-prediction algorithm. Control design is performed on an averaged system model, whereas the performances of FGSMC and SMC are compared in simulation on both the averaged model and the true switching PV system.","PeriodicalId":336534,"journal":{"name":"2013 10th IEEE International Conference on Control and Automation (ICCA)","volume":"112 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114017930","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 : 2013-06-12DOI: 10.1109/ICCA.2013.6564990
Shouheng Zhang, Shan'an Zhu
This paper describes a server structure based on Netty for an internet-based laboratory. It contains 3 subsystems: the configuration, the user and the experiment, with universal modules. The system has a special communication protocol based on TCP/IP. Because of the excellent scalability, the server can be expended into an integrative system for both virtual and physical experiments.
{"title":"Server structure based on netty framework for internet-based laboratory","authors":"Shouheng Zhang, Shan'an Zhu","doi":"10.1109/ICCA.2013.6564990","DOIUrl":"https://doi.org/10.1109/ICCA.2013.6564990","url":null,"abstract":"This paper describes a server structure based on Netty for an internet-based laboratory. It contains 3 subsystems: the configuration, the user and the experiment, with universal modules. The system has a special communication protocol based on TCP/IP. Because of the excellent scalability, the server can be expended into an integrative system for both virtual and physical experiments.","PeriodicalId":336534,"journal":{"name":"2013 10th IEEE International Conference on Control and Automation (ICCA)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115030841","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 : 2013-06-12DOI: 10.1109/ICCA.2013.6565024
Li Chen, X. Chen, Jixin Qian, Zhen Yao
A new method is proposed for analyzing the parameter identifiability of the dynamic systems described by differential-algebraic equations (DAEs). According to the features of DAEs, the proposed method uses the space transformation to eliminate the algebraic variables of the original DAE system, and derive a lower ODE system. As the parameter identifiability of the ODE system is equivalent to that of the lower DAE system, the differential algebraic (D-A) approach can be used to test the unknown parameter identifiability of the DAE system.
{"title":"A new method for parameter identifiability of DAE systems","authors":"Li Chen, X. Chen, Jixin Qian, Zhen Yao","doi":"10.1109/ICCA.2013.6565024","DOIUrl":"https://doi.org/10.1109/ICCA.2013.6565024","url":null,"abstract":"A new method is proposed for analyzing the parameter identifiability of the dynamic systems described by differential-algebraic equations (DAEs). According to the features of DAEs, the proposed method uses the space transformation to eliminate the algebraic variables of the original DAE system, and derive a lower ODE system. As the parameter identifiability of the ODE system is equivalent to that of the lower DAE system, the differential algebraic (D-A) approach can be used to test the unknown parameter identifiability of the DAE system.","PeriodicalId":336534,"journal":{"name":"2013 10th IEEE International Conference on Control and Automation (ICCA)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116715069","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 : 2013-06-12DOI: 10.1109/ICCA.2013.6565142
Yu Pan, Li Chai, Yuxia Sheng
The upper (lower) bound of a frame is an important index in the analysis and design of filter bank frames. There is lack of effectively numerical methods to compute the frame bounds for two-dimensional (2-D) filter banks (FBs). This paper investigates the computation problem of frame bounds and provides a frequency-independent solution. Firstly, the state space realization of 2-D FIR discrete FBs is given in the form of Roesser model. Then an LMI based optimization method is presented by using the generalized Kalman-Yakubovich-Popov (KYP) lemma. Finally, various examples are given on wavelet and Laplacian pyramid frames to demonstrate the effectiveness of the proposed method for 2-D frames.
{"title":"Frame bound computation of two-dimensional filter bank frames","authors":"Yu Pan, Li Chai, Yuxia Sheng","doi":"10.1109/ICCA.2013.6565142","DOIUrl":"https://doi.org/10.1109/ICCA.2013.6565142","url":null,"abstract":"The upper (lower) bound of a frame is an important index in the analysis and design of filter bank frames. There is lack of effectively numerical methods to compute the frame bounds for two-dimensional (2-D) filter banks (FBs). This paper investigates the computation problem of frame bounds and provides a frequency-independent solution. Firstly, the state space realization of 2-D FIR discrete FBs is given in the form of Roesser model. Then an LMI based optimization method is presented by using the generalized Kalman-Yakubovich-Popov (KYP) lemma. Finally, various examples are given on wavelet and Laplacian pyramid frames to demonstrate the effectiveness of the proposed method for 2-D frames.","PeriodicalId":336534,"journal":{"name":"2013 10th IEEE International Conference on Control and Automation (ICCA)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116277213","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 : 2013-06-12DOI: 10.1109/ICCA.2013.6564923
Changfan Zhang, Long Wen, Yuanyuan Xiao, Jing He
Multi-shaft synchronous control is a key topic of shaft-less drive printing press. It's difficult to obtain high synchronization performance and robustness by conventional synchronization strategy. The paper improves adjacent cross coupling error equation and designs sliding mode variable structure controller so that the synchronous error can be converged to zero based on the concept of adjacent cross coupling strategy. Thus multi-shaft synchronous running is realized. The simulation results of four-shaft printing system demonstrate that the control algorithm has good synchronous performance, fast dynamic response and strong robustness and it has high engineering application value as well.
{"title":"Sliding mode variable structure-based multi-shaft synchronous control method and its application in printing press","authors":"Changfan Zhang, Long Wen, Yuanyuan Xiao, Jing He","doi":"10.1109/ICCA.2013.6564923","DOIUrl":"https://doi.org/10.1109/ICCA.2013.6564923","url":null,"abstract":"Multi-shaft synchronous control is a key topic of shaft-less drive printing press. It's difficult to obtain high synchronization performance and robustness by conventional synchronization strategy. The paper improves adjacent cross coupling error equation and designs sliding mode variable structure controller so that the synchronous error can be converged to zero based on the concept of adjacent cross coupling strategy. Thus multi-shaft synchronous running is realized. The simulation results of four-shaft printing system demonstrate that the control algorithm has good synchronous performance, fast dynamic response and strong robustness and it has high engineering application value as well.","PeriodicalId":336534,"journal":{"name":"2013 10th IEEE International Conference on Control and Automation (ICCA)","volume":"207 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115451022","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 : 2013-06-12DOI: 10.2316/Journal.201.2014.3.201-2583
M. Aurangzeb, F. Lewis, M. Huber
This paper addresses the problem of steering a swarm of autonomous agents out of an unknown maze to some goal located at an unknown location. This is particularly the case in situations where no direct communication between the agents is possible and all information exchange between agents has to occur indirectly through information “deposited” in the environment. To address this task, an ε-greedy, collaborative reinforcement learning method using only local information exchanges is introduced in this paper to balance exploitation and exploration in the unknown maze and to optimize the ability of the swarm to exit from the maze. The learning and routing algorithm given here provides a mechanism for storing data needed to represent the collaborative utility function based on the experiences of previous agents visiting a node that results in routing decisions that improve with time. Two theorems show the theoretical soundness of the proposed learning method and illustrate the importance of the stored information in improving decision-making for routing. Simulation examples show that the introduced simple rules of learning from past experience significantly improve performance over random search and search based on Ant Colony Optimization, a metaheuristic algorithm.
{"title":"Efficient, swarm-based path finding in unknown graphs using reinforcement learning","authors":"M. Aurangzeb, F. Lewis, M. Huber","doi":"10.2316/Journal.201.2014.3.201-2583","DOIUrl":"https://doi.org/10.2316/Journal.201.2014.3.201-2583","url":null,"abstract":"This paper addresses the problem of steering a swarm of autonomous agents out of an unknown maze to some goal located at an unknown location. This is particularly the case in situations where no direct communication between the agents is possible and all information exchange between agents has to occur indirectly through information “deposited” in the environment. To address this task, an ε-greedy, collaborative reinforcement learning method using only local information exchanges is introduced in this paper to balance exploitation and exploration in the unknown maze and to optimize the ability of the swarm to exit from the maze. The learning and routing algorithm given here provides a mechanism for storing data needed to represent the collaborative utility function based on the experiences of previous agents visiting a node that results in routing decisions that improve with time. Two theorems show the theoretical soundness of the proposed learning method and illustrate the importance of the stored information in improving decision-making for routing. Simulation examples show that the introduced simple rules of learning from past experience significantly improve performance over random search and search based on Ant Colony Optimization, a metaheuristic algorithm.","PeriodicalId":336534,"journal":{"name":"2013 10th IEEE International Conference on Control and Automation (ICCA)","volume":"172 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123196201","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 : 2013-06-12DOI: 10.1109/ICCA.2013.6565000
Chao Zhai, Yiguang Hong
This paper addresses the coverage problem of multiple mobile agents in the environment. A new formulation is proposed for some coverage problems. Meanwhile, a distributed control method is developed for each agent to optimize the global configuration in parallel with collision avoidance. Moreover, it is proved that locally optimal configuration can be achieved with the aid of navigation functions.
{"title":"Distributed coverage control of multi-agent systems using navigation functions","authors":"Chao Zhai, Yiguang Hong","doi":"10.1109/ICCA.2013.6565000","DOIUrl":"https://doi.org/10.1109/ICCA.2013.6565000","url":null,"abstract":"This paper addresses the coverage problem of multiple mobile agents in the environment. A new formulation is proposed for some coverage problems. Meanwhile, a distributed control method is developed for each agent to optimize the global configuration in parallel with collision avoidance. Moreover, it is proved that locally optimal configuration can be achieved with the aid of navigation functions.","PeriodicalId":336534,"journal":{"name":"2013 10th IEEE International Conference on Control and Automation (ICCA)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123615696","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 : 2013-06-12DOI: 10.1109/ICCA.2013.6564972
Zhirong He, Jian-xin Xu, K. Lum
In this work we address the problem of autonomously tracking a group of ground static targets in an urban area using fixed wing unmanned aerial vehicles (UAVs). In this scenario, UAVs are equipped with sensors that are subject to the constraints of urban area occlusions. Information regarding the line of sight (LOS) occlusions in the urban area is assumed available. Each UAV, considering the dynamic constrains arising from the fixed wing, is modeled as a Dubins car. The motion planning of searching the shortest path for UAVs, namely Dubins path, is a NP hard problem. We propose an algorithm, which can provide sub-optimal Dubins path, hence can bring a closed-loop path for UAVs to continuously track the group of static targets and minimize the time of loss track. The proposed algorithm is validated through simulations on a visual database that is based on the CBD in Singapore.
{"title":"Targets tracking by UAVs in an urban area","authors":"Zhirong He, Jian-xin Xu, K. Lum","doi":"10.1109/ICCA.2013.6564972","DOIUrl":"https://doi.org/10.1109/ICCA.2013.6564972","url":null,"abstract":"In this work we address the problem of autonomously tracking a group of ground static targets in an urban area using fixed wing unmanned aerial vehicles (UAVs). In this scenario, UAVs are equipped with sensors that are subject to the constraints of urban area occlusions. Information regarding the line of sight (LOS) occlusions in the urban area is assumed available. Each UAV, considering the dynamic constrains arising from the fixed wing, is modeled as a Dubins car. The motion planning of searching the shortest path for UAVs, namely Dubins path, is a NP hard problem. We propose an algorithm, which can provide sub-optimal Dubins path, hence can bring a closed-loop path for UAVs to continuously track the group of static targets and minimize the time of loss track. The proposed algorithm is validated through simulations on a visual database that is based on the CBD in Singapore.","PeriodicalId":336534,"journal":{"name":"2013 10th IEEE International Conference on Control and Automation (ICCA)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123624100","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：