Pub Date : 2006-09-01DOI: 10.1109/ETFA.2006.355250
R. Imura
The goal of the ubiquitous computing and networking is that computers are embedded in everywhere & everything for easy access to control over the entire social infrastructure. Networked RFID technology is one of the essential key for driving the ubiquitous to realize secure and easy access from anyone, anything, anywhere and anytime, which contributes to the better quality of human life and covers the various applications and fields such as transportation, housing, food-chain, agriculture, automobile, industry FA, logistics and healthcare etc. It has been found that through some of the practical networked RFID applications, the activities and new business models are related to so many items such as service, architecture, security, even for human lifestyle and culture etc. It should be considered how can applications and business models of RFID solutions meet the customer's requirements. There are some strong potential markets for RFID to add value to the existing market situation which are the food, livestock, and drug value chain including processing, distribution, traceability, process improvement and anti-counterfeit.
{"title":"The Role of Networked RFID for Driving the Ubiquitous","authors":"R. Imura","doi":"10.1109/ETFA.2006.355250","DOIUrl":"https://doi.org/10.1109/ETFA.2006.355250","url":null,"abstract":"The goal of the ubiquitous computing and networking is that computers are embedded in everywhere & everything for easy access to control over the entire social infrastructure. Networked RFID technology is one of the essential key for driving the ubiquitous to realize secure and easy access from anyone, anything, anywhere and anytime, which contributes to the better quality of human life and covers the various applications and fields such as transportation, housing, food-chain, agriculture, automobile, industry FA, logistics and healthcare etc. It has been found that through some of the practical networked RFID applications, the activities and new business models are related to so many items such as service, architecture, security, even for human lifestyle and culture etc. It should be considered how can applications and business models of RFID solutions meet the customer's requirements. There are some strong potential markets for RFID to add value to the existing market situation which are the food, livestock, and drug value chain including processing, distribution, traceability, process improvement and anti-counterfeit.","PeriodicalId":431393,"journal":{"name":"2006 IEEE Conference on Emerging Technologies and Factory Automation","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134382507","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 : 2006-09-01DOI: 10.1109/ETFA.2006.355456
Frederico Santos, J. Trovão, A. Marques, P. Pedreiras, J. Ferreira, L. Almeida, Max Mauro Santos
This paper presents a fault-tolerant modular control architecture for an electrical vehicle (VEIL) equipped with x-by-wire sub-systems. The proposed architecture is based on COTS components and includes steer-by-wire, brake-by-wire and accelerate-by-wire safety critical functions. The communication infrastructure is based on the FTT-CAN protocol, which provides the joint scheduling of message and tasks, according to a holistic approach.
{"title":"A Modular Control Architecture for a Small Electric Vehicle","authors":"Frederico Santos, J. Trovão, A. Marques, P. Pedreiras, J. Ferreira, L. Almeida, Max Mauro Santos","doi":"10.1109/ETFA.2006.355456","DOIUrl":"https://doi.org/10.1109/ETFA.2006.355456","url":null,"abstract":"This paper presents a fault-tolerant modular control architecture for an electrical vehicle (VEIL) equipped with x-by-wire sub-systems. The proposed architecture is based on COTS components and includes steer-by-wire, brake-by-wire and accelerate-by-wire safety critical functions. The communication infrastructure is based on the FTT-CAN protocol, which provides the joint scheduling of message and tasks, according to a holistic approach.","PeriodicalId":431393,"journal":{"name":"2006 IEEE Conference on Emerging Technologies and Factory Automation","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133370393","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 : 2006-09-01DOI: 10.1109/ETFA.2006.355401
P. Yomsi, Y. Sorel
Classical off-line approaches based on preemption such as RM (rate monotonic), DM (deadline monotonic), EDF (earliest deadline first), LLF (least laxity first), etc, give schedulability conditions but most of the time assuming on the one hand that all the tasks are independent, and on the other hand, that the first instances of all tasks are released at the same time. We are interested in hard real-time systems subject to precedence and strict periodicity constraints, i.e. such that for all instances of each task, the release time and start time are equal. For such systems, it is mandatory to satisfy these constraints. In this paper we give non-schedulability conditions in order to restrict the study field of all systems of tasks to only potentially schedulable systems.
{"title":"Non-Schedulability Conditions for Off-line Scheduling of Real-Time Systems Subject to Precedence and Strict Periodicity Constraints","authors":"P. Yomsi, Y. Sorel","doi":"10.1109/ETFA.2006.355401","DOIUrl":"https://doi.org/10.1109/ETFA.2006.355401","url":null,"abstract":"Classical off-line approaches based on preemption such as RM (rate monotonic), DM (deadline monotonic), EDF (earliest deadline first), LLF (least laxity first), etc, give schedulability conditions but most of the time assuming on the one hand that all the tasks are independent, and on the other hand, that the first instances of all tasks are released at the same time. We are interested in hard real-time systems subject to precedence and strict periodicity constraints, i.e. such that for all instances of each task, the release time and start time are equal. For such systems, it is mandatory to satisfy these constraints. In this paper we give non-schedulability conditions in order to restrict the study field of all systems of tasks to only potentially schedulable systems.","PeriodicalId":431393,"journal":{"name":"2006 IEEE Conference on Emerging Technologies and Factory Automation","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133485695","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 : 2006-09-01DOI: 10.1109/ETFA.2006.355358
S. Cavalieri
Use of pattern matching algorithm for location detection in a wireless LAN is well known in literature. It allows to achieve good performances in terms of localisation errors, but it may require a very long and time-consuming start-up phase, during which a set of measurements of the radio signal strength values received in different positions inside the area involved in the localisation, must be taken. The complexity of this procedure increases with the size of the area involved in the localisation; this clearly happens for large outdoor areas, where a huge set of measurements must be taken during the start-up phase. The paper aims to present an approach for localisation in outdoor areas covered by a wireless network; this approach is still based on the use of pattern matching algorithm, but use of a signal propagation model during the start-up phase has been introduced in order to reduce its complexity. Performances of the proposal have been evaluated for outdoor localisation and the main results achieved will be shown in the paper
{"title":"Outdoor Localisation in a Wireless LAN","authors":"S. Cavalieri","doi":"10.1109/ETFA.2006.355358","DOIUrl":"https://doi.org/10.1109/ETFA.2006.355358","url":null,"abstract":"Use of pattern matching algorithm for location detection in a wireless LAN is well known in literature. It allows to achieve good performances in terms of localisation errors, but it may require a very long and time-consuming start-up phase, during which a set of measurements of the radio signal strength values received in different positions inside the area involved in the localisation, must be taken. The complexity of this procedure increases with the size of the area involved in the localisation; this clearly happens for large outdoor areas, where a huge set of measurements must be taken during the start-up phase. The paper aims to present an approach for localisation in outdoor areas covered by a wireless network; this approach is still based on the use of pattern matching algorithm, but use of a signal propagation model during the start-up phase has been introduced in order to reduce its complexity. Performances of the proposal have been evaluated for outdoor localisation and the main results achieved will be shown in the paper","PeriodicalId":431393,"journal":{"name":"2006 IEEE Conference on Emerging Technologies and Factory Automation","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133983065","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 : 2006-09-01DOI: 10.1109/ETFA.2006.355187
G. Cengic, Oscar Ljungkrantz, K. Åkesson
The execution model in a new standard for distributed control systems, IEC 61499, is analyzed. It is shown how the same standard compliant application running in two different standard compliant runtime environments may result in completely different behaviors. Thus, to achieve true portability of applications between multiple standard compliant runtime environments a more detailed execution model is necessary. In this paper a new runtime environment, Fuber, is presented along with a formal execution model. In this case the execution model is given as a set of interacting state machines which makes it straightforward to analyze the behavior of the application and runtime together using existing tools for formal verification.
{"title":"Formal Modeling of Function Block Applications Running in IEC 61499 Execution Runtime","authors":"G. Cengic, Oscar Ljungkrantz, K. Åkesson","doi":"10.1109/ETFA.2006.355187","DOIUrl":"https://doi.org/10.1109/ETFA.2006.355187","url":null,"abstract":"The execution model in a new standard for distributed control systems, IEC 61499, is analyzed. It is shown how the same standard compliant application running in two different standard compliant runtime environments may result in completely different behaviors. Thus, to achieve true portability of applications between multiple standard compliant runtime environments a more detailed execution model is necessary. In this paper a new runtime environment, Fuber, is presented along with a formal execution model. In this case the execution model is given as a set of interacting state machines which makes it straightforward to analyze the behavior of the application and runtime together using existing tools for formal verification.","PeriodicalId":431393,"journal":{"name":"2006 IEEE Conference on Emerging Technologies and Factory Automation","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124081322","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 : 2006-09-01DOI: 10.1109/ETFA.2006.355440
K. Hansen
This article discusses the need of reference models for evaluating the various communication solutions proposals. A model is proposed and some example analyses are done for Ethernet and some wireless protocols.
{"title":"Process Plant Reference Model for Communication","authors":"K. Hansen","doi":"10.1109/ETFA.2006.355440","DOIUrl":"https://doi.org/10.1109/ETFA.2006.355440","url":null,"abstract":"This article discusses the need of reference models for evaluating the various communication solutions proposals. A model is proposed and some example analyses are done for Ethernet and some wireless protocols.","PeriodicalId":431393,"journal":{"name":"2006 IEEE Conference on Emerging Technologies and Factory Automation","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127785981","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 : 2006-09-01DOI: 10.1109/ETFA.2006.355408
A. Pakonen, T. Pirttioja, I. Seilonen, T. Tommila
While automation systems can track thousands of measurements it is still up to human process operators to determine the operational situation of the controlled process, particularly in abnormal situations. To fully exploit the computing power of embedded processors and to release humans from simple data harvesting activities, the concept of proactive computing tries to exploit the strengths of both man and machine. Proactive features can be implemented using intelligent agent technology, enabling humans to move from simple interaction with computers into supervisory tasks. Autonomous information agents can handle massive amounts of heterogeneous data. They perform tedious tasks of information retrieving, combining and monitoring on the behalf of their users. This paper presents a multi-agent-based architecture for process automation, which aims to support process operators in their monitoring activities. The approach is tested with a scenario inspired by a real-world industrial challenge.
{"title":"Proactive Computing in Process Monitoring: Information Agents for Operator Support","authors":"A. Pakonen, T. Pirttioja, I. Seilonen, T. Tommila","doi":"10.1109/ETFA.2006.355408","DOIUrl":"https://doi.org/10.1109/ETFA.2006.355408","url":null,"abstract":"While automation systems can track thousands of measurements it is still up to human process operators to determine the operational situation of the controlled process, particularly in abnormal situations. To fully exploit the computing power of embedded processors and to release humans from simple data harvesting activities, the concept of proactive computing tries to exploit the strengths of both man and machine. Proactive features can be implemented using intelligent agent technology, enabling humans to move from simple interaction with computers into supervisory tasks. Autonomous information agents can handle massive amounts of heterogeneous data. They perform tedious tasks of information retrieving, combining and monitoring on the behalf of their users. This paper presents a multi-agent-based architecture for process automation, which aims to support process operators in their monitoring activities. The approach is tested with a scenario inspired by a real-world industrial challenge.","PeriodicalId":431393,"journal":{"name":"2006 IEEE Conference on Emerging Technologies and Factory Automation","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121451339","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 : 2006-09-01DOI: 10.1109/ETFA.2006.355219
J. Rufino, P. Veríssimo, C. Almeida, G. Arroz
The CAN Enhanced Layer (CANELy) is a CAN-based infrastructure capable of extremely reliable communication. This paper describes the mechanisms and the techniques used in CANELy to enforce system correctness in the time-domain despite the occurrence of network errors (inaccessibility). The paper discusses how to integrate in the existing CANELy machinery, the control of inaccessibility and the management of timers, at several levels of the system. In particular, application and low-level protocol layers are addressed. In addition, a relevant set of parameters are available for system monitoring, allowing the validation/enforcement of the system model.
{"title":"Integrating Inaccessibility Control and Timer Management in CANELy","authors":"J. Rufino, P. Veríssimo, C. Almeida, G. Arroz","doi":"10.1109/ETFA.2006.355219","DOIUrl":"https://doi.org/10.1109/ETFA.2006.355219","url":null,"abstract":"The CAN Enhanced Layer (CANELy) is a CAN-based infrastructure capable of extremely reliable communication. This paper describes the mechanisms and the techniques used in CANELy to enforce system correctness in the time-domain despite the occurrence of network errors (inaccessibility). The paper discusses how to integrate in the existing CANELy machinery, the control of inaccessibility and the management of timers, at several levels of the system. In particular, application and low-level protocol layers are addressed. In addition, a relevant set of parameters are available for system monitoring, allowing the validation/enforcement of the system model.","PeriodicalId":431393,"journal":{"name":"2006 IEEE Conference on Emerging Technologies and Factory Automation","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116927598","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 : 2006-09-01DOI: 10.1109/ETFA.2006.355416
M. Saska, M. Macas, L. Preucil, L. Lhotská
Robot path planning problem is one of most important task mobile robots. This paper proposes an original approach using a path description by string of cubic splines. Such path is easy executable and natural for car-like robot. Furthermore, it is possible to ensure smooth derivation in connections of particular splines. In this case, the path planning is equivalent to optimization of parameters of splines. An evolutionary technique called particle swarm optimization (PSO) was used hereunder due to its relatively fast convergence and global search character. Various settings of PSO parameters were tested and the best setting was compared to two classical mobile robot path planning algorithms.
{"title":"Robot Path Planning using Particle Swarm Optimization of Ferguson Splines","authors":"M. Saska, M. Macas, L. Preucil, L. Lhotská","doi":"10.1109/ETFA.2006.355416","DOIUrl":"https://doi.org/10.1109/ETFA.2006.355416","url":null,"abstract":"Robot path planning problem is one of most important task mobile robots. This paper proposes an original approach using a path description by string of cubic splines. Such path is easy executable and natural for car-like robot. Furthermore, it is possible to ensure smooth derivation in connections of particular splines. In this case, the path planning is equivalent to optimization of parameters of splines. An evolutionary technique called particle swarm optimization (PSO) was used hereunder due to its relatively fast convergence and global search character. Various settings of PSO parameters were tested and the best setting was compared to two classical mobile robot path planning algorithms.","PeriodicalId":431393,"journal":{"name":"2006 IEEE Conference on Emerging Technologies and Factory Automation","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115557095","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 : 2006-09-01DOI: 10.1109/ETFA.2006.355217
C. Economakos, F. Koumboulis
In a previous paper we introduced a supervisory control framework for setting the operating point of an industrial process with unknown characteristics. Here we extend this methodology for the case of MIMO processes. The proposed supervisory control framework is agent-based and it involves modeling agents and intelligent agents. The modeling agents derive local steady-state models of the process during normal process operation by using various identification techniques, each of which corresponds to a different instantiation of our system. The intelligent agents are proposed to be implemented using finite automata units. The performance of the proposed scheme is illustrated through simulation results on well-known benchmark problems of chemical industry.
{"title":"A Safe Set Point Supervisor for MIMO Processes","authors":"C. Economakos, F. Koumboulis","doi":"10.1109/ETFA.2006.355217","DOIUrl":"https://doi.org/10.1109/ETFA.2006.355217","url":null,"abstract":"In a previous paper we introduced a supervisory control framework for setting the operating point of an industrial process with unknown characteristics. Here we extend this methodology for the case of MIMO processes. The proposed supervisory control framework is agent-based and it involves modeling agents and intelligent agents. The modeling agents derive local steady-state models of the process during normal process operation by using various identification techniques, each of which corresponds to a different instantiation of our system. The intelligent agents are proposed to be implemented using finite automata units. The performance of the proposed scheme is illustrated through simulation results on well-known benchmark problems of chemical industry.","PeriodicalId":431393,"journal":{"name":"2006 IEEE Conference on Emerging Technologies and Factory Automation","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115656158","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
扫码关注我们
求助内容：
应助结果提醒方式：