Pub Date : 2005-03-19DOI: 10.1109/ICNSC.2005.1461276
Mi Zhao, Zhiwu Li, Jingwei Liang
In this paper we propose a deadlock control policy for a class of nets, called G-system with limited shared resources, which is a large class of discrete event systems generalizing well-known models presented in the literature. A relevant property of the system behavior is to be non-blocking, i.e., from any reachable state, a desirable state can be always obtained under supervision. The analysis of the system leads us to characterize deadlock situations in terms of an unmarked siphon based on the Petri nets model. Our deadlock prevention policy is to make all unmarked siphons satisfying cs-property when all elementary siphons are properly supervised. Compared with the existing policies, the advantage of the policy is that a much smaller number of supervisor places are added and unnecessary iterative processes are avoided. Finally, the application of the approach is illustrated with a realistic G-system example.
{"title":"On supervisor synthesis of discrete event systems","authors":"Mi Zhao, Zhiwu Li, Jingwei Liang","doi":"10.1109/ICNSC.2005.1461276","DOIUrl":"https://doi.org/10.1109/ICNSC.2005.1461276","url":null,"abstract":"In this paper we propose a deadlock control policy for a class of nets, called G-system with limited shared resources, which is a large class of discrete event systems generalizing well-known models presented in the literature. A relevant property of the system behavior is to be non-blocking, i.e., from any reachable state, a desirable state can be always obtained under supervision. The analysis of the system leads us to characterize deadlock situations in terms of an unmarked siphon based on the Petri nets model. Our deadlock prevention policy is to make all unmarked siphons satisfying cs-property when all elementary siphons are properly supervised. Compared with the existing policies, the advantage of the policy is that a much smaller number of supervisor places are added and unnecessary iterative processes are avoided. Finally, the application of the approach is illustrated with a realistic G-system example.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134276966","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 : 2005-03-19DOI: 10.1109/ICNSC.2005.1461247
S. Chopra, R. Mitra, V. Kumar
A common way of developing fuzzy controllers is by determining the rule base and some appropriate fuzzy sets over the controller's input and output ranges. A simple and efficient approach, namely, fuzzy subtractive clustering is used to identify the rule base needed to realize a self-tuning fuzzy PI-type controller. This technique provides a mechanism to obtain the reduced rule set covering, the whole input/output space as well as membership functions for each input variable. In this paper, the fuzzy subtractive clustering approach is shown to reduce 49 rules to 5 rules maintaining almost the same level of performance. Simulation on a wide range of linear and nonlinear processes is carried out and results are compared with self-tuning fuzzy PI type controllers without clustering in terms of several performance measures such as peak overshoot, settling time, rise time, integral absolute error (IAE) and integral-of-time multiplied absolute error (ITAE). In addition the responses due to step set-point change and load disturbance are studied and in each case the proposed scheme shows an identical performance with less number of rules.
{"title":"Identification of self-tuning fuzzy PI type controllers with reduced rule set","authors":"S. Chopra, R. Mitra, V. Kumar","doi":"10.1109/ICNSC.2005.1461247","DOIUrl":"https://doi.org/10.1109/ICNSC.2005.1461247","url":null,"abstract":"A common way of developing fuzzy controllers is by determining the rule base and some appropriate fuzzy sets over the controller's input and output ranges. A simple and efficient approach, namely, fuzzy subtractive clustering is used to identify the rule base needed to realize a self-tuning fuzzy PI-type controller. This technique provides a mechanism to obtain the reduced rule set covering, the whole input/output space as well as membership functions for each input variable. In this paper, the fuzzy subtractive clustering approach is shown to reduce 49 rules to 5 rules maintaining almost the same level of performance. Simulation on a wide range of linear and nonlinear processes is carried out and results are compared with self-tuning fuzzy PI type controllers without clustering in terms of several performance measures such as peak overshoot, settling time, rise time, integral absolute error (IAE) and integral-of-time multiplied absolute error (ITAE). In addition the responses due to step set-point change and load disturbance are studied and in each case the proposed scheme shows an identical performance with less number of rules.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131999395","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 : 2005-03-19DOI: 10.1109/ICNSC.2005.1461252
A. Mohammed, M. Benyettou, M. Sweeting, J. Cooksley
On the November 28th, 2002 at 06:07 am GMT, the first Algerian microsatellite AIsat-1 was launched from the cosmodrome of Plesetsk in Russia into a 700 km sun synchronous orbit. Alsat-1 is an enhanced microsatellite (90 Kg), stabilised in 3 axis for image acquisition mode. It was designed for disaster monitoring and is a part of the international constellation dedicated for disaster monitoring (DMC). Immediately after separation from the final stage of the launcher, Alsat-1 can be tumbling at an undefined angular rate. The only attitude sensors useful at this stage will be the 3-axis magnetometer. Called B-dot rate damping, this controller requiring only a Y-axis magnetic moment and it will reduce the X and Z-axis angular rates and align the microsatellite to the orbit normal. The next step will be simultaneously control the V-axis rate named Y-THOMPSON spin to a fixed reference value. The orbit reference Y-axis angular rate can be estimated from a pitch filter or Kalman rate filter. The pitch filter can be implemented once the satellite is in pure Y-THOMPSON spin. This filter will determine the pitch angle and rate using the magnetometer measurements and the modelled International Geomagnetic Reference Field vector. Finally when the pitch angle is 10 from nadir, we deploy the boom. The paper presented here is a part of my Phd thesis which describes the attitude determination control system algorithms implemented in the initial attitude acquisition phase on Alsat-1. This phase will complete the detumbling maneuvers. The only attitude determination sensor required, is a magnetometer and the actuator required is a magnetorquer coil. The specific attitude controllers and estimators used during these modes are explained. In orbit commissioning results are presented.
{"title":"Initial attitude acquisition result of the Alsat-1 first Algerian microsatellite in orbit","authors":"A. Mohammed, M. Benyettou, M. Sweeting, J. Cooksley","doi":"10.1109/ICNSC.2005.1461252","DOIUrl":"https://doi.org/10.1109/ICNSC.2005.1461252","url":null,"abstract":"On the November 28th, 2002 at 06:07 am GMT, the first Algerian microsatellite AIsat-1 was launched from the cosmodrome of Plesetsk in Russia into a 700 km sun synchronous orbit. Alsat-1 is an enhanced microsatellite (90 Kg), stabilised in 3 axis for image acquisition mode. It was designed for disaster monitoring and is a part of the international constellation dedicated for disaster monitoring (DMC). Immediately after separation from the final stage of the launcher, Alsat-1 can be tumbling at an undefined angular rate. The only attitude sensors useful at this stage will be the 3-axis magnetometer. Called B-dot rate damping, this controller requiring only a Y-axis magnetic moment and it will reduce the X and Z-axis angular rates and align the microsatellite to the orbit normal. The next step will be simultaneously control the V-axis rate named Y-THOMPSON spin to a fixed reference value. The orbit reference Y-axis angular rate can be estimated from a pitch filter or Kalman rate filter. The pitch filter can be implemented once the satellite is in pure Y-THOMPSON spin. This filter will determine the pitch angle and rate using the magnetometer measurements and the modelled International Geomagnetic Reference Field vector. Finally when the pitch angle is 10 from nadir, we deploy the boom. The paper presented here is a part of my Phd thesis which describes the attitude determination control system algorithms implemented in the initial attitude acquisition phase on Alsat-1. This phase will complete the detumbling maneuvers. The only attitude determination sensor required, is a magnetometer and the actuator required is a magnetorquer coil. The specific attitude controllers and estimators used during these modes are explained. In orbit commissioning results are presented.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":" 29","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132095352","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 : 2005-03-19DOI: 10.1109/ICNSC.2005.1461166
G. Tu, Derong Liu, Can Zhang
This paper presents a new compression algorithm for medical images. The present algorithm is based on interframe predictive coding of images using wavelet transform for motion compensation. Simulation results show that the new algorithm has better performance than some existing algorithms. Compared with the 2-D wavelet compression, the new algorithm has a slightly higher compression ratio for CT images and the peak signal to noise ratio (PSNR) is increased for 3 dB. Compared with the DCT for motion compensation compression algorithm, the PSNR is increased for 5 dB using the new algorithm at the same compression ratio of 15.
{"title":"A new compression algorithm for medical images using wavelet transform","authors":"G. Tu, Derong Liu, Can Zhang","doi":"10.1109/ICNSC.2005.1461166","DOIUrl":"https://doi.org/10.1109/ICNSC.2005.1461166","url":null,"abstract":"This paper presents a new compression algorithm for medical images. The present algorithm is based on interframe predictive coding of images using wavelet transform for motion compensation. Simulation results show that the new algorithm has better performance than some existing algorithms. Compared with the 2-D wavelet compression, the new algorithm has a slightly higher compression ratio for CT images and the peak signal to noise ratio (PSNR) is increased for 3 dB. Compared with the DCT for motion compensation compression algorithm, the PSNR is increased for 5 dB using the new algorithm at the same compression ratio of 15.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130042925","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 : 2005-03-19DOI: 10.1109/ICNSC.2005.1461305
Ramsay Key
This paper considers the problem of routing in a network where the travel times along the arcs are modeled as independent random variables. A standard approach to routing in such networks is to select a path with the least expected travel time. One of the problems with this approach is that it does not take into consideration, factors such as the travel time variance. Additionally, such an approach implicitly assumes each user in the network has the same routing objective. In this paper we develop an approach to routing in stochastic networks in which these problems are addressed. The fundamental concept in our approach is that, for a given user with a set of routing options at a given node, we approximate the distributions of travel time for these options. Using these approximate distributions, the options are compared according to a user-specified routing objective, and the best option is selected. The primary benefit of this approach is that one is not limited to a particular routing objective as the computed distributions of travel time allow us to efficiently determine an effective routing option for an arbitrary routing objective that depends on factors of random travel time other than the mean. The distribution of travel time adopted in this paper is the minimum travel time probability distribution, which is the distribution of travel time over all fastest paths. In a class of networks termed as series-parallel networks, the minimum travel time distribution can be calculated efficiently. For general, non-series-parallel networks, the approximation we adopt is the minimum travel time distribution obtained from a related series-parallel network. The performance and the benefits of this approach to routing are illustrated on an example network.
{"title":"Routing in stochastic networks","authors":"Ramsay Key","doi":"10.1109/ICNSC.2005.1461305","DOIUrl":"https://doi.org/10.1109/ICNSC.2005.1461305","url":null,"abstract":"This paper considers the problem of routing in a network where the travel times along the arcs are modeled as independent random variables. A standard approach to routing in such networks is to select a path with the least expected travel time. One of the problems with this approach is that it does not take into consideration, factors such as the travel time variance. Additionally, such an approach implicitly assumes each user in the network has the same routing objective. In this paper we develop an approach to routing in stochastic networks in which these problems are addressed. The fundamental concept in our approach is that, for a given user with a set of routing options at a given node, we approximate the distributions of travel time for these options. Using these approximate distributions, the options are compared according to a user-specified routing objective, and the best option is selected. The primary benefit of this approach is that one is not limited to a particular routing objective as the computed distributions of travel time allow us to efficiently determine an effective routing option for an arbitrary routing objective that depends on factors of random travel time other than the mean. The distribution of travel time adopted in this paper is the minimum travel time probability distribution, which is the distribution of travel time over all fastest paths. In a class of networks termed as series-parallel networks, the minimum travel time distribution can be calculated efficiently. For general, non-series-parallel networks, the approximation we adopt is the minimum travel time distribution obtained from a related series-parallel network. The performance and the benefits of this approach to routing are illustrated on an example network.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114157440","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 : 2005-03-19DOI: 10.1109/ICNSC.2005.1461222
D. He, Feixin Wang, Wei Li
Application specific operating systems (ASOS) are developing quickly as a new trend in real-time control systems development. It often belongs to system on chip. The scheduling for ASOS should satisfy two basic demands (a) context switching overheads are not significant; (b) the scheduling should use small amount of RAM memory. According to characteristics of ASOS, we present a novel scheduling algorithm, named dynamic preemption threshold (DPT) scheduling, which integrates preemption threshold scheduling into the EDF (earliest deadline first). The scheduling can achieve greater processor utilization, theoretically even up to all of a processor capacity. Meanwhile, the preemption times between tasks can be effectively decreased using DPT scheduling by two ways: 1) threads allocating; 2) dynamic thresholds regularly adjusting at runtime. With the reduction of task preemptions, memory requirements are also decreased. In addition, the DPT gives an approach to transform a static model to dynamic model seamlessly. The DPT algorithm can perfectly schedule a mixed task set with preemptive and non-preemptive tasks, and subsumes both as special cases. Thus it remains the scheduling flexibility and also decreases unnecessary context switching and memory requirements at runtime.
{"title":"Dynamic preemption threshold scheduling for specific real-time control systems","authors":"D. He, Feixin Wang, Wei Li","doi":"10.1109/ICNSC.2005.1461222","DOIUrl":"https://doi.org/10.1109/ICNSC.2005.1461222","url":null,"abstract":"Application specific operating systems (ASOS) are developing quickly as a new trend in real-time control systems development. It often belongs to system on chip. The scheduling for ASOS should satisfy two basic demands (a) context switching overheads are not significant; (b) the scheduling should use small amount of RAM memory. According to characteristics of ASOS, we present a novel scheduling algorithm, named dynamic preemption threshold (DPT) scheduling, which integrates preemption threshold scheduling into the EDF (earliest deadline first). The scheduling can achieve greater processor utilization, theoretically even up to all of a processor capacity. Meanwhile, the preemption times between tasks can be effectively decreased using DPT scheduling by two ways: 1) threads allocating; 2) dynamic thresholds regularly adjusting at runtime. With the reduction of task preemptions, memory requirements are also decreased. In addition, the DPT gives an approach to transform a static model to dynamic model seamlessly. The DPT algorithm can perfectly schedule a mixed task set with preemptive and non-preemptive tasks, and subsumes both as special cases. Thus it remains the scheduling flexibility and also decreases unnecessary context switching and memory requirements at runtime.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134430465","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 : 2005-03-19DOI: 10.1109/ICNSC.2005.1461220
T. Hegazy, G. Vachtsevanos
Tracking multiple navigating targets in a bounded region is a common problem that arises in many real-life applications, such as rescue operations, surveillance and reconnaissance. Placing a set of agents optimally to track targets, of interest is another problem associated with the tracking problem. This paper introduces a distributed stochastic approach to a well-defined agent placement problem, which can be shown to be NP-hard. First, a stochastic target motion model is introduced to enable agents to predict future target locations. Second, a model-based distributed algorithm is developed. Given the motion model, agents predict target location probabilities and compute their next best locations based on the predictions. The proposed approach involves coordination among mobile agents in order to achieve near-optimal global utilities. The approach has been evaluated through a set of simulation experiments. Simulation results reveal the superiority of the proposed model-based agent placement approach over existing approaches.
{"title":"Dynamic autonomous agent placement for target tracking based on target motion models","authors":"T. Hegazy, G. Vachtsevanos","doi":"10.1109/ICNSC.2005.1461220","DOIUrl":"https://doi.org/10.1109/ICNSC.2005.1461220","url":null,"abstract":"Tracking multiple navigating targets in a bounded region is a common problem that arises in many real-life applications, such as rescue operations, surveillance and reconnaissance. Placing a set of agents optimally to track targets, of interest is another problem associated with the tracking problem. This paper introduces a distributed stochastic approach to a well-defined agent placement problem, which can be shown to be NP-hard. First, a stochastic target motion model is introduced to enable agents to predict future target locations. Second, a model-based distributed algorithm is developed. Given the motion model, agents predict target location probabilities and compute their next best locations based on the predictions. The proposed approach involves coordination among mobile agents in order to achieve near-optimal global utilities. The approach has been evaluated through a set of simulation experiments. Simulation results reveal the superiority of the proposed model-based agent placement approach over existing approaches.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133932817","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 : 2005-03-19DOI: 10.1109/ICNSC.2005.1461340
C. Cavanaugh
Given the overall increasing trend of airspace demand by commercial, military, and general aviation, researchers are developing new software tools to enhance the level of automation in air traffic control systems to alleviate the already-crowded airspace by allowing controllers and pilots more freedom in planning and conducting flights. These tools utilize high-performance commercial workstations that use high-speed networks and function together to form a distributed real-time computing system. This paper describes a three-dimensional air traffic control simulation benchmark developed by the author for the purpose of running simulations of air traffic scenarios, adding new capabilities, and gauging performance, security, and reliability quality of service management techniques on a variety of platforms.
{"title":"Toward a simulation benchmark for distributed mission-critical real-time systems","authors":"C. Cavanaugh","doi":"10.1109/ICNSC.2005.1461340","DOIUrl":"https://doi.org/10.1109/ICNSC.2005.1461340","url":null,"abstract":"Given the overall increasing trend of airspace demand by commercial, military, and general aviation, researchers are developing new software tools to enhance the level of automation in air traffic control systems to alleviate the already-crowded airspace by allowing controllers and pilots more freedom in planning and conducting flights. These tools utilize high-performance commercial workstations that use high-speed networks and function together to form a distributed real-time computing system. This paper describes a three-dimensional air traffic control simulation benchmark developed by the author for the purpose of running simulations of air traffic scenarios, adding new capabilities, and gauging performance, security, and reliability quality of service management techniques on a variety of platforms.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"337 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132435415","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 : 2005-03-19DOI: 10.1109/ICNSC.2005.1461250
Tianzhou Chen, Wei Chen, Xiang Wang, Wei Hu
As various applications become more and more sophisticated in automotive systems control units become more complex to meet specific requirements. This trend necessitates the use of an operating system to manage the complexity and to provide an abstraction for improving the portability of code. This paper presents a real time S kernel that is designed and implemented based on OSEK/VDX an open industry standard. Some features and optimizations of this kernel that make it appropriate for automotive applications among control unit nodes are also demonstrated. These optimizations include memory usage and a flexible framework of sporadic server for aperiodic nonblocking basic tasks scheduling. We evaluate these features by ensuing experiments and prove them to work efficiently.
{"title":"Implementing and evaluation of an OSEK/VDX-compliant configurable real-time kernel","authors":"Tianzhou Chen, Wei Chen, Xiang Wang, Wei Hu","doi":"10.1109/ICNSC.2005.1461250","DOIUrl":"https://doi.org/10.1109/ICNSC.2005.1461250","url":null,"abstract":"As various applications become more and more sophisticated in automotive systems control units become more complex to meet specific requirements. This trend necessitates the use of an operating system to manage the complexity and to provide an abstraction for improving the portability of code. This paper presents a real time S kernel that is designed and implemented based on OSEK/VDX an open industry standard. Some features and optimizations of this kernel that make it appropriate for automotive applications among control unit nodes are also demonstrated. These optimizations include memory usage and a flexible framework of sporadic server for aperiodic nonblocking basic tasks scheduling. We evaluate these features by ensuing experiments and prove them to work efficiently.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124877185","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 : 2005-03-19DOI: 10.1109/ICNSC.2005.1461269
Kai-Ying Chen
Automated manufacturing systems are quite complex and varied in nature. Therefore, a practical approach to design software for managing manufacturing systems is to build generic solutions to the greatest possible extent, and then to customize them to suit the needs of each firm. Flexible manufacturing cell (FMC) plays more important role when production market becoming more competitive and manufacturing environment is often subject to change. Modular method for developing control software of FMC thus is necessary. Petri Net, a graphical modeling tool, allows the construction of models amenable both for qualitative and quantitative analysis. Over the last two decades, there have been many applications of using Petri Net for the modeling of manufacturing systems. In this paper, a modular approach by combining the PLC in equipment level and Petri Net in cell level for the development of FMC controller in a hierarchical manufacturing environment is addressed. Benefits of PLC and Petri Net thus can be fully utilized to develop an FMC controller. This generic FMC controller has been successfully implemented in several automated factories in Taiwan.
{"title":"Modular design method for the control software development of the cell controller in automated manufacturing systems","authors":"Kai-Ying Chen","doi":"10.1109/ICNSC.2005.1461269","DOIUrl":"https://doi.org/10.1109/ICNSC.2005.1461269","url":null,"abstract":"Automated manufacturing systems are quite complex and varied in nature. Therefore, a practical approach to design software for managing manufacturing systems is to build generic solutions to the greatest possible extent, and then to customize them to suit the needs of each firm. Flexible manufacturing cell (FMC) plays more important role when production market becoming more competitive and manufacturing environment is often subject to change. Modular method for developing control software of FMC thus is necessary. Petri Net, a graphical modeling tool, allows the construction of models amenable both for qualitative and quantitative analysis. Over the last two decades, there have been many applications of using Petri Net for the modeling of manufacturing systems. In this paper, a modular approach by combining the PLC in equipment level and Petri Net in cell level for the development of FMC controller in a hierarchical manufacturing environment is addressed. Benefits of PLC and Petri Net thus can be fully utilized to develop an FMC controller. This generic FMC controller has been successfully implemented in several automated factories in Taiwan.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129129566","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
扫码关注我们
求助内容：
应助结果提醒方式：