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.6565008
Yue Li, Shouguang Wang, J. Yang
Petri nets can be viewed as graphical models and mathematical tools to study discrete event system. As a basic analysis tool of Petri nets, reachability trees are fundamental for systematically investigating many characteristics. In this paper, a new reachability tree for unbounded generalized Petri nets is proposed. This new method can decrease the number of nodes in the new reachability tree besides avoidance of some spurious markings which appear in other reachability trees. Several examples are provided to illustrate its superiority.
{"title":"A new reachability tree for unbounded Petri nets","authors":"Yue Li, Shouguang Wang, J. Yang","doi":"10.1109/ICCA.2013.6565008","DOIUrl":"https://doi.org/10.1109/ICCA.2013.6565008","url":null,"abstract":"Petri nets can be viewed as graphical models and mathematical tools to study discrete event system. As a basic analysis tool of Petri nets, reachability trees are fundamental for systematically investigating many characteristics. In this paper, a new reachability tree for unbounded generalized Petri nets is proposed. This new method can decrease the number of nodes in the new reachability tree besides avoidance of some spurious markings which appear in other reachability trees. Several examples are provided to illustrate its superiority.","PeriodicalId":336534,"journal":{"name":"2013 10th IEEE International Conference on Control and Automation (ICCA)","volume":"10 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":"116794390","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.6565175
Yong Yang, Bo Yang, X. Guan
We focus on downlink scheduling and resource allocation for orthogonal frequency division multiplexing (OFDM) wireless networks. From a perspective of network operators, the base station (BS) will charge the downlink users to earn revenue and pay for electricity consumption. The aim of network operators is to achieve better profits while ensuring network stability. In the context of smart grid, the BS can harvest renewable energy and store energy in order to cut down electricity cost. The challenge is that it is hard to obtain the accurate statistic knowledge of electricity price, random rate requests and renewable energy. Furthermore, we have to deal with the dynamic data rate requests from downlink users with heterogeneous quality of service (QoS) requirements. To handle the coupling between congestion control, energy consumption and radio resource allocation, we propose a pricing-based crosslayer scheduling and energy management algorithm PCSM based on Lyapunov optimization: the energy management can well regulate the electricity charging rate in case of interrupting the downlink service; the data rate pricing-based congestion control scheme collects proper revenue by setting data rate price to carry out flow control and profit maximization; the radio resource allocation can achieve adaptive allocation by using cross-layer information from the network layer as well as energy storage condition. Theoretical analysis shows that it can achieve a near-optimal performance when stabilizing the network and that its effectiveness is also validated through simulation results.
{"title":"Pricing-based cross-layer scheduling and energy management over OFDM downlink networks","authors":"Yong Yang, Bo Yang, X. Guan","doi":"10.1109/ICCA.2013.6565175","DOIUrl":"https://doi.org/10.1109/ICCA.2013.6565175","url":null,"abstract":"We focus on downlink scheduling and resource allocation for orthogonal frequency division multiplexing (OFDM) wireless networks. From a perspective of network operators, the base station (BS) will charge the downlink users to earn revenue and pay for electricity consumption. The aim of network operators is to achieve better profits while ensuring network stability. In the context of smart grid, the BS can harvest renewable energy and store energy in order to cut down electricity cost. The challenge is that it is hard to obtain the accurate statistic knowledge of electricity price, random rate requests and renewable energy. Furthermore, we have to deal with the dynamic data rate requests from downlink users with heterogeneous quality of service (QoS) requirements. To handle the coupling between congestion control, energy consumption and radio resource allocation, we propose a pricing-based crosslayer scheduling and energy management algorithm PCSM based on Lyapunov optimization: the energy management can well regulate the electricity charging rate in case of interrupting the downlink service; the data rate pricing-based congestion control scheme collects proper revenue by setting data rate price to carry out flow control and profit maximization; the radio resource allocation can achieve adaptive allocation by using cross-layer information from the network layer as well as energy storage condition. Theoretical analysis shows that it can achieve a near-optimal performance when stabilizing the network and that its effectiveness is also validated through simulation results.","PeriodicalId":336534,"journal":{"name":"2013 10th IEEE International Conference on Control and Automation (ICCA)","volume":"4 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":"123648619","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.6565050
Xinli Wang, Jiangang Lu, Qinmin Yang, W. Cai, Youxian Sun
In this paper, an empirical model based on least square support vector machine (LSSVM) method to predict the output air conditions in a packed tower liquid desiccant dehumidifier is developed. By analysis of the coupled heat and mass transfer between the process air and desiccant solution, six variables are used as the inputs of the LSSVM model, namely: desiccant solution and air flow rates, desiccant solution and air inlet temperature, desiccant concentration, and air relative humidity. Meanwhile, outlet air temperature and relative humidity related with the performance of the dehumidifier are considered as the outputs of the LSSVM model. Compared with the existing theoretical models, the present one is very simple, yet accuracy, and does not need complex theoretical analysis. The experimental results illustrate the effectiveness of the proposed model on performance predicting in a packed tower liquid desiccant dehumidifier. This developed model is expected to have widely applications in performance evaluation, operational monitoring, fault detection and diagnosis.
{"title":"Performance evaluation of packed tower liquid desiccant dehumidifier based on LSSVM","authors":"Xinli Wang, Jiangang Lu, Qinmin Yang, W. Cai, Youxian Sun","doi":"10.1109/ICCA.2013.6565050","DOIUrl":"https://doi.org/10.1109/ICCA.2013.6565050","url":null,"abstract":"In this paper, an empirical model based on least square support vector machine (LSSVM) method to predict the output air conditions in a packed tower liquid desiccant dehumidifier is developed. By analysis of the coupled heat and mass transfer between the process air and desiccant solution, six variables are used as the inputs of the LSSVM model, namely: desiccant solution and air flow rates, desiccant solution and air inlet temperature, desiccant concentration, and air relative humidity. Meanwhile, outlet air temperature and relative humidity related with the performance of the dehumidifier are considered as the outputs of the LSSVM model. Compared with the existing theoretical models, the present one is very simple, yet accuracy, and does not need complex theoretical analysis. The experimental results illustrate the effectiveness of the proposed model on performance predicting in a packed tower liquid desiccant dehumidifier. This developed model is expected to have widely applications in performance evaluation, operational monitoring, fault detection and diagnosis.","PeriodicalId":336534,"journal":{"name":"2013 10th IEEE International Conference on Control and Automation (ICCA)","volume":"20 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":"124097533","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.6565014
Jiaxiang Luo, Yueming Hu
Setup (changeover) time is often needed by the processes with operations of cleaning or changing fixtures. Its length strongly depends on the immediately succeeding operation sometimes. The scheduling problems with such setup times are called to have sequence dependent setups. This paper focuses on a single machine scheduling problem with sequence dependent setups to minimize total weighted tardiness. A greedy randomized adaptive search procedure (GRASP) combined with path relinking (PR) is proposed for the NP-hard problem. In the algorithm, our main contributions are a new iterated filter-and-fan (IFF) algorithm in the improvement phase of GRASP and a block insertion based path construction method in PR. We compare our algorithm with discrete differential evolution (DDE), discrete particle swarm optimization (DPSO) and single IFF algorithm on a set of test instances from literature. The results show that the algorithm performs very competitively.
{"title":"A new GRASP and path relinking for single machine scheduling with sequence dependent setups","authors":"Jiaxiang Luo, Yueming Hu","doi":"10.1109/ICCA.2013.6565014","DOIUrl":"https://doi.org/10.1109/ICCA.2013.6565014","url":null,"abstract":"Setup (changeover) time is often needed by the processes with operations of cleaning or changing fixtures. Its length strongly depends on the immediately succeeding operation sometimes. The scheduling problems with such setup times are called to have sequence dependent setups. This paper focuses on a single machine scheduling problem with sequence dependent setups to minimize total weighted tardiness. A greedy randomized adaptive search procedure (GRASP) combined with path relinking (PR) is proposed for the NP-hard problem. In the algorithm, our main contributions are a new iterated filter-and-fan (IFF) algorithm in the improvement phase of GRASP and a block insertion based path construction method in PR. We compare our algorithm with discrete differential evolution (DDE), discrete particle swarm optimization (DPSO) and single IFF algorithm on a set of test instances from literature. The results show that the algorithm performs very competitively.","PeriodicalId":336534,"journal":{"name":"2013 10th IEEE International Conference on Control and Automation (ICCA)","volume":"1 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":"125458532","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}
Pub Date : 2013-06-12DOI: 10.1109/ICCA.2013.6564898
Li Li, Binhai Wang, Beidou Li, Peng Xiao, Wanguo Wang, Yibin Li
Based on SmartGuard, a mobile robot for substation inspection, we propose an image based visual servo control system to precisely make the cameras with the pan & tilt to capture the substation equipment we expected to inspect. The vision control system contents of an image acquisition system, a pan & tilt and an embedded servo control system. The proposed approach firstly uses SURF local feature to take the offset of the new acquired image and the template image, which is invariant to light, scale and rotation. Without the calibration of the pan & tilt and the vision system, we calculate the Jacobian matrix based on the test movement. Then we take the servo until the image feature reach to the object image. Using this image based vision system, SmartGuard can avoid the effect of the motion error and the repeating errors of pan & tilt system, and take the precisely image of the power equipments for automatic optical inspection system.
{"title":"The application of image based visual servo control system for smart guard","authors":"Li Li, Binhai Wang, Beidou Li, Peng Xiao, Wanguo Wang, Yibin Li","doi":"10.1109/ICCA.2013.6564898","DOIUrl":"https://doi.org/10.1109/ICCA.2013.6564898","url":null,"abstract":"Based on SmartGuard, a mobile robot for substation inspection, we propose an image based visual servo control system to precisely make the cameras with the pan & tilt to capture the substation equipment we expected to inspect. The vision control system contents of an image acquisition system, a pan & tilt and an embedded servo control system. The proposed approach firstly uses SURF local feature to take the offset of the new acquired image and the template image, which is invariant to light, scale and rotation. Without the calibration of the pan & tilt and the vision system, we calculate the Jacobian matrix based on the test movement. Then we take the servo until the image feature reach to the object image. Using this image based vision system, SmartGuard can avoid the effect of the motion error and the repeating errors of pan & tilt system, and take the precisely image of the power equipments for automatic optical inspection system.","PeriodicalId":336534,"journal":{"name":"2013 10th IEEE International Conference on Control and Automation (ICCA)","volume":"41 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":"122305019","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
扫码关注我们
求助内容：
应助结果提醒方式：