Pub Date : 2020-06-29DOI: 10.1109/CoDIT49905.2020.9263890
J. Flochová, Jan Pivarcek, Peter Kubanda
This paper presents the model of intersection controllers using timed automata and colored Petri nets formalisms. The models include cars control, pedestrians control, vehicles detection system and failure diagnosis with subsequent control changes. The validation and verification of the models has been realized in UPPAAL Pro model-checker and CPN Tools. The proposed modeling framework is applied to real intersections located in Bratislava and Malacky, Slovakia.
{"title":"Timed Automaton and Petri Net models of Intersection Control*","authors":"J. Flochová, Jan Pivarcek, Peter Kubanda","doi":"10.1109/CoDIT49905.2020.9263890","DOIUrl":"https://doi.org/10.1109/CoDIT49905.2020.9263890","url":null,"abstract":"This paper presents the model of intersection controllers using timed automata and colored Petri nets formalisms. The models include cars control, pedestrians control, vehicles detection system and failure diagnosis with subsequent control changes. The validation and verification of the models has been realized in UPPAAL Pro model-checker and CPN Tools. The proposed modeling framework is applied to real intersections located in Bratislava and Malacky, Slovakia.","PeriodicalId":355781,"journal":{"name":"2020 7th International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123080293","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 : 2020-06-29DOI: 10.1109/CoDIT49905.2020.9263964
Dahlia Al-Janabi, M. Enache, T. Letia
Software developers use metrics to estimate the software quality before the development stage to impact early decision making at the requirement stage, development quantification, operation, and software maintenance. These metrics give knowledge of certain attributes of the software system and thus help to evaluate it objectively and give opportunities for software improvement and making plans for modifications. The application development is supposed to be performed using the OETPN based modeling method. The newly proposed metrics are: Structural Complexity (number of arcs and the number of modules), Hierarchical Complexity (if one OETPN module is created by another), Unstructuredness of OETPN Models (which is based on the number of modules, cycles and decision places), Branching Complexity (which is computed according to the reachability graph), Decision Vertex (which is computed based on the decision node of the execution graph), and the Net Complexity (the summation of all the previous complexities).
{"title":"The Quality of Programs Conceived by Object Enhanced Time Petri Nets","authors":"Dahlia Al-Janabi, M. Enache, T. Letia","doi":"10.1109/CoDIT49905.2020.9263964","DOIUrl":"https://doi.org/10.1109/CoDIT49905.2020.9263964","url":null,"abstract":"Software developers use metrics to estimate the software quality before the development stage to impact early decision making at the requirement stage, development quantification, operation, and software maintenance. These metrics give knowledge of certain attributes of the software system and thus help to evaluate it objectively and give opportunities for software improvement and making plans for modifications. The application development is supposed to be performed using the OETPN based modeling method. The newly proposed metrics are: Structural Complexity (number of arcs and the number of modules), Hierarchical Complexity (if one OETPN module is created by another), Unstructuredness of OETPN Models (which is based on the number of modules, cycles and decision places), Branching Complexity (which is computed according to the reachability graph), Decision Vertex (which is computed based on the decision node of the execution graph), and the Net Complexity (the summation of all the previous complexities).","PeriodicalId":355781,"journal":{"name":"2020 7th International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123214955","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 : 2020-06-29DOI: 10.1109/CoDIT49905.2020.9263919
D. Ramin, E. Leo, L. Nicolosi, S. Spinelli, A. Brusaferri
In this work, we propose a method based on the unified particle swarm optimization (UPSO) for no-wait multi-hoist scheduling, including a collision avoidance heuristic. Conflicts due to track sharing between hoists and no-wait constraints represent major issues to be addressed. Consequently, a complex optimization problem has to be solved dynamically, to identify the best operating strategy to be executed depending on the characteristics of the current job list. A decomposition procedure has been developed to speed up the solution of the large-scale optimization problem at hand. The proposed approach is demonstrated on a real galvanic process layout, showing the improved performances achieved by the proposed heuristic compared to the monolithic approach.
{"title":"A Unified PSO-based method for multi-hoist scheduling in advanced Galvanic plants","authors":"D. Ramin, E. Leo, L. Nicolosi, S. Spinelli, A. Brusaferri","doi":"10.1109/CoDIT49905.2020.9263919","DOIUrl":"https://doi.org/10.1109/CoDIT49905.2020.9263919","url":null,"abstract":"In this work, we propose a method based on the unified particle swarm optimization (UPSO) for no-wait multi-hoist scheduling, including a collision avoidance heuristic. Conflicts due to track sharing between hoists and no-wait constraints represent major issues to be addressed. Consequently, a complex optimization problem has to be solved dynamically, to identify the best operating strategy to be executed depending on the characteristics of the current job list. A decomposition procedure has been developed to speed up the solution of the large-scale optimization problem at hand. The proposed approach is demonstrated on a real galvanic process layout, showing the improved performances achieved by the proposed heuristic compared to the monolithic approach.","PeriodicalId":355781,"journal":{"name":"2020 7th International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124689788","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 : 2020-06-29DOI: 10.1109/CoDIT49905.2020.9263848
P. Shcherbakov
We propose several heuristic methods for finding an approximate solution to the following inherently combinatorial problem: Given N points in ℝn, construct the minimum- size ellipsoid covering exactly N − k of them, where k ≪ N. Various assumptions on the nature of the points and their amount are considered; the results of numerical experiments with the algorithms are discussed.
{"title":"Finding Minimum-Size Ellipsoids Covering a Subset of Points: Several Simple Heuristic Approaches","authors":"P. Shcherbakov","doi":"10.1109/CoDIT49905.2020.9263848","DOIUrl":"https://doi.org/10.1109/CoDIT49905.2020.9263848","url":null,"abstract":"We propose several heuristic methods for finding an approximate solution to the following inherently combinatorial problem: Given N points in ℝn, construct the minimum- size ellipsoid covering exactly N − k of them, where k ≪ N. Various assumptions on the nature of the points and their amount are considered; the results of numerical experiments with the algorithms are discussed.","PeriodicalId":355781,"journal":{"name":"2020 7th International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124739525","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 : 2020-06-29DOI: 10.1109/CoDIT49905.2020.9263844
A. Lapin, N. E. Zubov, A. Proletarskii
This paper deals with stabilizing spatial motion of a maneuverable aircraft with three controls and nine state parameters. It is required to provide specified dynamic properties of the controlled plant at minimal control actions.To solve the assigned task the modification of the Bass – Gura formula is suggested, which allows analytically synthesizing stabilizing modal control for multi-input objects and simplifies parameterization of this control.For numeric matrices describing one of flight modes of the typical maneuverable aircraft and for required dynamic properties of the closed-loop control system a parameterized analytic solution of the considering problem is obtained in the form of controller matrix. A control law providing small values of state vector components and of controls shifts is synthesized by choosing the parameters minimizing the sum of controller coefficients absolute values. The simulation results are shown.
{"title":"Parametric Minimization of Controller Matrix Norm at Stabilizing Spatial Motion of a Maneuverable Aircraft","authors":"A. Lapin, N. E. Zubov, A. Proletarskii","doi":"10.1109/CoDIT49905.2020.9263844","DOIUrl":"https://doi.org/10.1109/CoDIT49905.2020.9263844","url":null,"abstract":"This paper deals with stabilizing spatial motion of a maneuverable aircraft with three controls and nine state parameters. It is required to provide specified dynamic properties of the controlled plant at minimal control actions.To solve the assigned task the modification of the Bass – Gura formula is suggested, which allows analytically synthesizing stabilizing modal control for multi-input objects and simplifies parameterization of this control.For numeric matrices describing one of flight modes of the typical maneuverable aircraft and for required dynamic properties of the closed-loop control system a parameterized analytic solution of the considering problem is obtained in the form of controller matrix. A control law providing small values of state vector components and of controls shifts is synthesized by choosing the parameters minimizing the sum of controller coefficients absolute values. The simulation results are shown.","PeriodicalId":355781,"journal":{"name":"2020 7th International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"2014 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128565405","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 : 2020-06-29DOI: 10.1109/CoDIT49905.2020.9263870
M. G. Villarreal-Cervantes, A. Rodríguez-Molina
The use of bio-inspired algorithms into controller tuning is one of the main topics in the last decades. One crucial issue when using bio-inspired algorithms to on-line tune the control system (adaptive controller tuning) is the computational time. In this work, an Asynchronous Adaptive Controller Tuning (AACT) approach is proposed to reduce the frequent activation of the tuning process, and hence, the computational cost could be reduced. This approach is based on a proposed event function, which determines the update time instant of the control parameters through the Differential Evolution algorithm. Comparative results with a Synchronous Adaptive Controller Tuning (SACT) approach are included in the study case of the speed regulation of the DC motor under the effects of uncertainties in the load. The SACT approach periodically updates the controller parameter at each sampling time. The comparative analysis indicates that the proposed AACT significantly reduces the controller parameter update without considerably increase the regulation error.
{"title":"Speed regulation of DC motors based on on-line optimum asynchronous controller tuning and differential evolution","authors":"M. G. Villarreal-Cervantes, A. Rodríguez-Molina","doi":"10.1109/CoDIT49905.2020.9263870","DOIUrl":"https://doi.org/10.1109/CoDIT49905.2020.9263870","url":null,"abstract":"The use of bio-inspired algorithms into controller tuning is one of the main topics in the last decades. One crucial issue when using bio-inspired algorithms to on-line tune the control system (adaptive controller tuning) is the computational time. In this work, an Asynchronous Adaptive Controller Tuning (AACT) approach is proposed to reduce the frequent activation of the tuning process, and hence, the computational cost could be reduced. This approach is based on a proposed event function, which determines the update time instant of the control parameters through the Differential Evolution algorithm. Comparative results with a Synchronous Adaptive Controller Tuning (SACT) approach are included in the study case of the speed regulation of the DC motor under the effects of uncertainties in the load. The SACT approach periodically updates the controller parameter at each sampling time. The comparative analysis indicates that the proposed AACT significantly reduces the controller parameter update without considerably increase the regulation error.","PeriodicalId":355781,"journal":{"name":"2020 7th International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"155 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121246814","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 : 2020-06-29DOI: 10.1109/CoDIT49905.2020.9263946
F. Liberati, A. Tortorelli, Cesar Mazquiaran, Muhammad Imran, M. Panfili
This paper discusses the problem of assembly line control and introduces an optimal control formulation that can be used to improve the performance of the assembly line, in terms of cycle time minimization, resources’ utilization, etc. A deterministic formulation of the problem is introduced, based on mixed-integer linear programming. A simple numerical simulation provides a first proof of the proposed concept.
{"title":"Optimal Control of Industrial Assembly Lines","authors":"F. Liberati, A. Tortorelli, Cesar Mazquiaran, Muhammad Imran, M. Panfili","doi":"10.1109/CoDIT49905.2020.9263946","DOIUrl":"https://doi.org/10.1109/CoDIT49905.2020.9263946","url":null,"abstract":"This paper discusses the problem of assembly line control and introduces an optimal control formulation that can be used to improve the performance of the assembly line, in terms of cycle time minimization, resources’ utilization, etc. A deterministic formulation of the problem is introduced, based on mixed-integer linear programming. A simple numerical simulation provides a first proof of the proposed concept.","PeriodicalId":355781,"journal":{"name":"2020 7th International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125458053","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 : 2020-06-29DOI: 10.1109/CoDIT49905.2020.9263804
M. P. Fanti, A. M. Mangini, M. Roccotelli
In the electro-mobility sector there is a rising necessity of providing new infrastructures, services, tools and solutions to support the diffusion of electric vehicles (EVs). In this framework, this paper aims to propose an innovative service that can improve the experience of electric vehicle users by providing customized information to reduce the range anxiety risk before starting the trip. In particular, an Information Technology (IT) service based on cooperative virtual sensors (VSs) is designed to predict the charge demand by an electric vehicle, driven by a specific user, to accomplish a predefined trip. To this goal, three virtual sensors are designed as software components each one implementing an algorithm to perform a specific task. It is shown how the cooperation of the three VSs is necessary to achieve the final service objective that is to provide customized information to help the user in preparing the EV for the trip. In addition, the effectiveness of the proposed service is demonstrated through a use case implemented by the developed IT application prototype.
{"title":"An Innovative Service for Electric Vehicle Energy Demand Prediction","authors":"M. P. Fanti, A. M. Mangini, M. Roccotelli","doi":"10.1109/CoDIT49905.2020.9263804","DOIUrl":"https://doi.org/10.1109/CoDIT49905.2020.9263804","url":null,"abstract":"In the electro-mobility sector there is a rising necessity of providing new infrastructures, services, tools and solutions to support the diffusion of electric vehicles (EVs). In this framework, this paper aims to propose an innovative service that can improve the experience of electric vehicle users by providing customized information to reduce the range anxiety risk before starting the trip. In particular, an Information Technology (IT) service based on cooperative virtual sensors (VSs) is designed to predict the charge demand by an electric vehicle, driven by a specific user, to accomplish a predefined trip. To this goal, three virtual sensors are designed as software components each one implementing an algorithm to perform a specific task. It is shown how the cooperation of the three VSs is necessary to achieve the final service objective that is to provide customized information to help the user in preparing the EV for the trip. In addition, the effectiveness of the proposed service is demonstrated through a use case implemented by the developed IT application prototype.","PeriodicalId":355781,"journal":{"name":"2020 7th International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127543982","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 : 2020-06-29DOI: 10.1109/CoDIT49905.2020.9263846
M. Hifi, S. Sadeghsa
This study proposes an algorithm based upon the rounding strategy for the k-clustering minimum completion problem. An instance of the problem is defined in a complete bipartite graph of S and C vertices. The goal of the problem is to decompose the initial graph into k-clusters, where each cluster is a complete bipartite subgraph. Since the problem is NP hard, any exact solver, like Cplex, is often not sufficient to achieve solutions with relatively hight quality. Thus, we propose a first alternative solution procedure for tackling large-scale instances. The designed method can be viewed as a special variant of the rounding search-based algorithm and it can be applied for solving several complex optimization problems. The proposed algorithm is evaluated on a set of benchmark instances related to the k-clustering minimum completion problem, where its achieved results are compared to the best results available in the literature.
{"title":"Adaptation of the Rounding Search-Based Algorithm for the k-Clustering Minimum Completion Problem","authors":"M. Hifi, S. Sadeghsa","doi":"10.1109/CoDIT49905.2020.9263846","DOIUrl":"https://doi.org/10.1109/CoDIT49905.2020.9263846","url":null,"abstract":"This study proposes an algorithm based upon the rounding strategy for the k-clustering minimum completion problem. An instance of the problem is defined in a complete bipartite graph of S and C vertices. The goal of the problem is to decompose the initial graph into k-clusters, where each cluster is a complete bipartite subgraph. Since the problem is NP hard, any exact solver, like Cplex, is often not sufficient to achieve solutions with relatively hight quality. Thus, we propose a first alternative solution procedure for tackling large-scale instances. The designed method can be viewed as a special variant of the rounding search-based algorithm and it can be applied for solving several complex optimization problems. The proposed algorithm is evaluated on a set of benchmark instances related to the k-clustering minimum completion problem, where its achieved results are compared to the best results available in the literature.","PeriodicalId":355781,"journal":{"name":"2020 7th International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133533446","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 : 2020-06-29DOI: 10.1109/CoDIT49905.2020.9263941
Karl Daher, Zeno Bardelli, M. Badaracco, E. Mugellini, D. Lalanne, Omar Abou Khaled
Humans nowadays are tending to spend too much time in front of their screens. Direct interaction between humans is falling in numbers and people are losing their empathic behaviour. By integrating empathy and emotions in everyday objects researchers can address this problem. In addition we can have a positive effect on our lives, from physical and mental health through tackling many issues, like productivity, time wasting, stress and other problems. In this article, we tackle the productivity problem by presenting the Empathic Flower Companion (EFC) that will be using the expression of emotions to help the human through their working day. It will be monitoring their time and at the same time analysing the websites they will be surfing. The concept proposed will reduce the time wasted on unproductive websites. The results show an increase of 15% in the productivity of the testers, which shows that EFC was effective in reducing the amount of time wasted.
{"title":"Empathic Flower Companion to Increase Productivity- EFC","authors":"Karl Daher, Zeno Bardelli, M. Badaracco, E. Mugellini, D. Lalanne, Omar Abou Khaled","doi":"10.1109/CoDIT49905.2020.9263941","DOIUrl":"https://doi.org/10.1109/CoDIT49905.2020.9263941","url":null,"abstract":"Humans nowadays are tending to spend too much time in front of their screens. Direct interaction between humans is falling in numbers and people are losing their empathic behaviour. By integrating empathy and emotions in everyday objects researchers can address this problem. In addition we can have a positive effect on our lives, from physical and mental health through tackling many issues, like productivity, time wasting, stress and other problems. In this article, we tackle the productivity problem by presenting the Empathic Flower Companion (EFC) that will be using the expression of emotions to help the human through their working day. It will be monitoring their time and at the same time analysing the websites they will be surfing. The concept proposed will reduce the time wasted on unproductive websites. The results show an increase of 15% in the productivity of the testers, which shows that EFC was effective in reducing the amount of time wasted.","PeriodicalId":355781,"journal":{"name":"2020 7th International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116562322","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
扫码关注我们
求助内容：
应助结果提醒方式：