Pub Date : 1999-10-18DOI: 10.1109/ETFA.1999.813079
E. Tovar, F. Vasques, A. Cardoso
In this paper, we analyse the ability of the P-NET fieldbus network to cope with the timing requirements of a Distributed Computer Control System (DCCS), where messages associated to discrete events should be made available to a distributed application within a maximum bound time. The major contribution of this paper is the integration of a pre-run-time schedulability analysis of the P-NET protocol with the typical Distributed Computer Controlled System requirement. A case study of a petrochemical DCCS application and its message communication support is presented stressing some of the timing requirements that must be satisfied by the message exchanges. An implementation supported by a P-NET fieldbus network is then analysed and some conclusions are drawn about this example.
{"title":"Guaranteeing DCCS timing requirements using P-NET fieldbus networks","authors":"E. Tovar, F. Vasques, A. Cardoso","doi":"10.1109/ETFA.1999.813079","DOIUrl":"https://doi.org/10.1109/ETFA.1999.813079","url":null,"abstract":"In this paper, we analyse the ability of the P-NET fieldbus network to cope with the timing requirements of a Distributed Computer Control System (DCCS), where messages associated to discrete events should be made available to a distributed application within a maximum bound time. The major contribution of this paper is the integration of a pre-run-time schedulability analysis of the P-NET protocol with the typical Distributed Computer Controlled System requirement. A case study of a petrochemical DCCS application and its message communication support is presented stressing some of the timing requirements that must be satisfied by the message exchanges. An implementation supported by a P-NET fieldbus network is then analysed and some conclusions are drawn about this example.","PeriodicalId":119106,"journal":{"name":"1999 7th IEEE International Conference on Emerging Technologies and Factory Automation. Proceedings ETFA '99 (Cat. No.99TH8467)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128063535","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 : 1999-10-18DOI: 10.1109/ETFA.1999.813097
P. Ponsa, A. Català
A methodology for analysis of human supervision in industrials processes is presented. The main issue is the modelling and creation of guide lines for human behaviour, through the study of different decision sequences in front of several dynamic processes. Processes are developed with a software generator of dynamic systems, for carrying out tests and data extraction. On the other hand, since industrial programmable logic controllers are very common, this study is complemented with the development of an artificial agent based on sequential control with the final objective of the comparison between the agent and the human behaviour in order to obtain a classification of different conducts.
{"title":"Human supervision in industrial process","authors":"P. Ponsa, A. Català","doi":"10.1109/ETFA.1999.813097","DOIUrl":"https://doi.org/10.1109/ETFA.1999.813097","url":null,"abstract":"A methodology for analysis of human supervision in industrials processes is presented. The main issue is the modelling and creation of guide lines for human behaviour, through the study of different decision sequences in front of several dynamic processes. Processes are developed with a software generator of dynamic systems, for carrying out tests and data extraction. On the other hand, since industrial programmable logic controllers are very common, this study is complemented with the development of an artificial agent based on sequential control with the final objective of the comparison between the agent and the human behaviour in order to obtain a classification of different conducts.","PeriodicalId":119106,"journal":{"name":"1999 7th IEEE International Conference on Emerging Technologies and Factory Automation. Proceedings ETFA '99 (Cat. No.99TH8467)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129898038","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 : 1999-10-18DOI: 10.1109/ETFA.1999.813085
M. Rubio Benito, J. Fuertes, E. Kahoraho, N. Perez Arzoz
In this article, a comparative study of the performance of the CAN, the Profibus-DP, the Profibus-FMS and the Modbus Plus field buses is carried out. An analytical approach is adopted to evaluate the performance of the networks in an event-driven system in terms of throughput and responsiveness. Cyclic data exchanges are analysed in a deterministic way in terms of the bandwidth consumed. Finally, we focus on the behaviour of systems with both cyclic and acyclic interchanges. As long as it is critical to ensure the bandwidth assigned to cyclic traffic, we analyse the effect that the bandwidth consumed by the cyclic traffic has on the throughput and responsiveness obtained when only acyclic traffic is considered.
{"title":"Performance evaluation of four field buses","authors":"M. Rubio Benito, J. Fuertes, E. Kahoraho, N. Perez Arzoz","doi":"10.1109/ETFA.1999.813085","DOIUrl":"https://doi.org/10.1109/ETFA.1999.813085","url":null,"abstract":"In this article, a comparative study of the performance of the CAN, the Profibus-DP, the Profibus-FMS and the Modbus Plus field buses is carried out. An analytical approach is adopted to evaluate the performance of the networks in an event-driven system in terms of throughput and responsiveness. Cyclic data exchanges are analysed in a deterministic way in terms of the bandwidth consumed. Finally, we focus on the behaviour of systems with both cyclic and acyclic interchanges. As long as it is critical to ensure the bandwidth assigned to cyclic traffic, we analyse the effect that the bandwidth consumed by the cyclic traffic has on the throughput and responsiveness obtained when only acyclic traffic is considered.","PeriodicalId":119106,"journal":{"name":"1999 7th IEEE International Conference on Emerging Technologies and Factory Automation. Proceedings ETFA '99 (Cat. No.99TH8467)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121395011","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 : 1999-10-18DOI: 10.1109/ETFA.1999.813107
P. Declerck, R. Guihur
Discrete event systems undergo perturbations that disrupt the control system and reduce the capacities of anticipation of the future evolution of the process. In the (max, +) algebra, processes modelled by a timed event graph may be represented by a linear model. The knowledge of the model and of the initial conditions enable us to characterise the state vector with a state equation iteration but the perturbations can generate a misappreciation of the state vector. The aim of the paper is to predict the output trajectory and to make temporal control synthesis when the state vector is unknown.
{"title":"General predictor in the algebra of dioids","authors":"P. Declerck, R. Guihur","doi":"10.1109/ETFA.1999.813107","DOIUrl":"https://doi.org/10.1109/ETFA.1999.813107","url":null,"abstract":"Discrete event systems undergo perturbations that disrupt the control system and reduce the capacities of anticipation of the future evolution of the process. In the (max, +) algebra, processes modelled by a timed event graph may be represented by a linear model. The knowledge of the model and of the initial conditions enable us to characterise the state vector with a state equation iteration but the perturbations can generate a misappreciation of the state vector. The aim of the paper is to predict the output trajectory and to make temporal control synthesis when the state vector is unknown.","PeriodicalId":119106,"journal":{"name":"1999 7th IEEE International Conference on Emerging Technologies and Factory Automation. Proceedings ETFA '99 (Cat. No.99TH8467)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124033790","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 : 1999-10-18DOI: 10.1109/ETFA.1999.815339
A. Sanchis, J. M. Molina, P. Isasi, J. Segovia
A reactive with tags classifier system (RTCS) is a special classifier system. This system combines the execution capabilities of symbolic systems and the learning capabilities of genetic algorithms. A RTCS is able to learn symbolic rules that allow to generate sequence of actions, chaining rules among different time instants, and react to new environmental situations, considering the last environmental situation to take a decision. The capacity of RTCS to learn good rules has been prove in robotics navigation problem. Results show the suitability of this approximation to the navigation problem and the coherence of extracted rules.
{"title":"Reactive with tags classifier system applied to real robot navigation","authors":"A. Sanchis, J. M. Molina, P. Isasi, J. Segovia","doi":"10.1109/ETFA.1999.815339","DOIUrl":"https://doi.org/10.1109/ETFA.1999.815339","url":null,"abstract":"A reactive with tags classifier system (RTCS) is a special classifier system. This system combines the execution capabilities of symbolic systems and the learning capabilities of genetic algorithms. A RTCS is able to learn symbolic rules that allow to generate sequence of actions, chaining rules among different time instants, and react to new environmental situations, considering the last environmental situation to take a decision. The capacity of RTCS to learn good rules has been prove in robotics navigation problem. Results show the suitability of this approximation to the navigation problem and the coherence of extracted rules.","PeriodicalId":119106,"journal":{"name":"1999 7th IEEE International Conference on Emerging Technologies and Factory Automation. Proceedings ETFA '99 (Cat. No.99TH8467)","volume":"164 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123158090","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 : 1999-10-18DOI: 10.1109/ETFA.1999.815415
L. Castillo, J. Fdez-Olivares, A. González
The design process of control programs that drive the operation of new generation manufacturing systems has to respond quickly to the changes of a evolutionary market. The improvement towards a completely automated design process is actually arising from the field of artificial intelligence. This work presents an application of artificial intelligence planning techniques for the automatic generation of control programs for a manufacturing system expressed as safe and live Petri nets. This system allows for a fast generation of sound results, reducing the cost and duration of the design and development phase of control programs.
{"title":"A knowledge-based tool for the automated synthesis of Petri nets for manufacturing systems","authors":"L. Castillo, J. Fdez-Olivares, A. González","doi":"10.1109/ETFA.1999.815415","DOIUrl":"https://doi.org/10.1109/ETFA.1999.815415","url":null,"abstract":"The design process of control programs that drive the operation of new generation manufacturing systems has to respond quickly to the changes of a evolutionary market. The improvement towards a completely automated design process is actually arising from the field of artificial intelligence. This work presents an application of artificial intelligence planning techniques for the automatic generation of control programs for a manufacturing system expressed as safe and live Petri nets. This system allows for a fast generation of sound results, reducing the cost and duration of the design and development phase of control programs.","PeriodicalId":119106,"journal":{"name":"1999 7th IEEE International Conference on Emerging Technologies and Factory Automation. Proceedings ETFA '99 (Cat. No.99TH8467)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132650587","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 : 1999-10-18DOI: 10.1109/ETFA.1999.813148
H. Tamaki, T. Komori, S. Abe
Identical parallel machine scheduling problems with earliness and tardiness penalties are studied. First, a hybrid method adopting the meta-heuristics and the list scheduling techniques is proposed, where a heuristic procedure MPA (Minimum Penalty increase Assignment) is newly introduced. Then, through several computational experiments, the effectiveness of the proposed method is shown.
{"title":"A heuristic approach to parallel machine scheduling with earliness and tardiness penalties","authors":"H. Tamaki, T. Komori, S. Abe","doi":"10.1109/ETFA.1999.813148","DOIUrl":"https://doi.org/10.1109/ETFA.1999.813148","url":null,"abstract":"Identical parallel machine scheduling problems with earliness and tardiness penalties are studied. First, a hybrid method adopting the meta-heuristics and the list scheduling techniques is proposed, where a heuristic procedure MPA (Minimum Penalty increase Assignment) is newly introduced. Then, through several computational experiments, the effectiveness of the proposed method is shown.","PeriodicalId":119106,"journal":{"name":"1999 7th IEEE International Conference on Emerging Technologies and Factory Automation. Proceedings ETFA '99 (Cat. No.99TH8467)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114379121","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 : 1999-10-18DOI: 10.1109/ETFA.1999.813105
M. Nakamura, M. Silva
This paper considers the minimum cycle time (MCT) computation in deterministically timed weighted marked graphs (WMGs) under infinite server semantics. A transformation from a live and bounded WMG system into a live and bounded MG system is proposed in which the untimed behavior (represented by the Petri net language) and the minimum cycle time are preserved. By applying the well known LPP to the transformed MG system, the MCT can be computed exactly. The computational complexity of our approach is polynomial with respect to |X|, the size of the elementary T-semiflow of the original WMG.
{"title":"Cycle time computation in deterministically timed weighted marked graphs","authors":"M. Nakamura, M. Silva","doi":"10.1109/ETFA.1999.813105","DOIUrl":"https://doi.org/10.1109/ETFA.1999.813105","url":null,"abstract":"This paper considers the minimum cycle time (MCT) computation in deterministically timed weighted marked graphs (WMGs) under infinite server semantics. A transformation from a live and bounded WMG system into a live and bounded MG system is proposed in which the untimed behavior (represented by the Petri net language) and the minimum cycle time are preserved. By applying the well known LPP to the transformed MG system, the MCT can be computed exactly. The computational complexity of our approach is polynomial with respect to |X|, the size of the elementary T-semiflow of the original WMG.","PeriodicalId":119106,"journal":{"name":"1999 7th IEEE International Conference on Emerging Technologies and Factory Automation. Proceedings ETFA '99 (Cat. No.99TH8467)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114964262","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 : 1999-10-18DOI: 10.1109/ETFA.1999.815351
J. M. Porta, E. Celaya
The categorization process defines sensor and action categories from elementary sensor readings and basic actions so that the necessary elements for solving a task are correctly perceived and manipulated. In reinforcement learning, a previous categorization process is needed to define sensor and action categories with special requirements that we analyze and that, in general, are difficult to achieve, especially in complex tasks such as those that arise when working with autonomous robots. We show how these special requirements should be relaxed and we sketch a reinforcement learning algorithm that uses a less restrictive form of sensory categorization than existing algorithms. Additionally, we show how a given sensory categorization can be improved so that it better fits the demands of the previous algorithm.
{"title":"Reinforcement learning and automatic categorization","authors":"J. M. Porta, E. Celaya","doi":"10.1109/ETFA.1999.815351","DOIUrl":"https://doi.org/10.1109/ETFA.1999.815351","url":null,"abstract":"The categorization process defines sensor and action categories from elementary sensor readings and basic actions so that the necessary elements for solving a task are correctly perceived and manipulated. In reinforcement learning, a previous categorization process is needed to define sensor and action categories with special requirements that we analyze and that, in general, are difficult to achieve, especially in complex tasks such as those that arise when working with autonomous robots. We show how these special requirements should be relaxed and we sketch a reinforcement learning algorithm that uses a less restrictive form of sensory categorization than existing algorithms. Additionally, we show how a given sensory categorization can be improved so that it better fits the demands of the previous algorithm.","PeriodicalId":119106,"journal":{"name":"1999 7th IEEE International Conference on Emerging Technologies and Factory Automation. Proceedings ETFA '99 (Cat. No.99TH8467)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115072241","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 : 1999-10-18DOI: 10.1109/ETFA.1999.815356
R. Poler, F. Lario, J. Garcia
A proposal to achieve a dynamic analysis of decision systems in enterprises is presented. Starting from the Decision System GRAI modeling (G. Doumeingts, 1984), the consideration of the use of the human resources in decision making and the characterization of the decision system by means of parameters of quality is proposed. The objective of the Dynamic GRAI Model is its simulation for the analysis of the dynamic behavior of the system regarding its temporary parameters (horizons and periods of planning) and the pursuit of the evolution of the total quality of the decision system. An information system for the storage of the necessary information (DGRAIS) and a simulator (DGRAISIM) are presented, unified in a re-design tool (DGRAI).
{"title":"Decision systems simulation","authors":"R. Poler, F. Lario, J. Garcia","doi":"10.1109/ETFA.1999.815356","DOIUrl":"https://doi.org/10.1109/ETFA.1999.815356","url":null,"abstract":"A proposal to achieve a dynamic analysis of decision systems in enterprises is presented. Starting from the Decision System GRAI modeling (G. Doumeingts, 1984), the consideration of the use of the human resources in decision making and the characterization of the decision system by means of parameters of quality is proposed. The objective of the Dynamic GRAI Model is its simulation for the analysis of the dynamic behavior of the system regarding its temporary parameters (horizons and periods of planning) and the pursuit of the evolution of the total quality of the decision system. An information system for the storage of the necessary information (DGRAIS) and a simulator (DGRAISIM) are presented, unified in a re-design tool (DGRAI).","PeriodicalId":119106,"journal":{"name":"1999 7th IEEE International Conference on Emerging Technologies and Factory Automation. Proceedings ETFA '99 (Cat. No.99TH8467)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122439474","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
扫码关注我们
求助内容：
应助结果提醒方式：