Pub Date : 2022-05-17DOI: 10.1109/CoDIT55151.2022.9804148
Noureddaher Zaidi, Adel Kheder
This study has two objectives: the design of a sequential module based on Grafcet formalism to control various vehicle engine operating modes and the investigation of electronic throttle controllers' performances when a jump from one mode to another appears. The so-called backstepping technique is used in the synthesis of control law and the proof of stability based on Lyapunov approach is given. The illustrated simulation results show the validity and efficiency of the proposed hierarchical control strategy.
{"title":"A Novel Electronic throttle control strategy based on Grafcet formalism under real vehicle engine operating conditions","authors":"Noureddaher Zaidi, Adel Kheder","doi":"10.1109/CoDIT55151.2022.9804148","DOIUrl":"https://doi.org/10.1109/CoDIT55151.2022.9804148","url":null,"abstract":"This study has two objectives: the design of a sequential module based on Grafcet formalism to control various vehicle engine operating modes and the investigation of electronic throttle controllers' performances when a jump from one mode to another appears. The so-called backstepping technique is used in the synthesis of control law and the proof of stability based on Lyapunov approach is given. The illustrated simulation results show the validity and efficiency of the proposed hierarchical control strategy.","PeriodicalId":185510,"journal":{"name":"2022 8th International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"78 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129065487","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 : 2022-05-17DOI: 10.1109/CoDIT55151.2022.9804145
Eduardo Chandomí-Castellanos, E. Escobar-Gómez, Sergio F. Aguilar Marroquín-Cano, Héctor R. Hernández De León, S. Velázquez-Trujillo, Jorge A. Sarmiento-Torres, Carlos Venturino De Coss Pérez
This paper proposes to solve the problem of the simple Traveler Agent by applying combined heuristic methods of local search. The proposed method evaluates a random initial route, using a modified simulated annealing algorithm that seeks to improve the route's cost globally, and finally, using a 2-opt local search technique that improves the cost. Different instances of TSPLIB data are evaluated and compared with other methods. The proposed method is compared with other techniques such as Ant Colony Optimization algorithm (ACO), Neural Networks (NN), Particle Swarm Optimization (PSO), and Genetics Algorithm (GA), where results are obtained sub-optimal solution, but in shorter computational time; Validation is obtained by applying two types of statistical indices, the relative percentage error and the coefficient of variation, as well as the execution times in seconds. Finally, using the instances, a MAPE equal to 3.0353% is obtained.
{"title":"Modified Simulated Annealing Hybrid Algorithm to Solve the Traveling Salesman Problem","authors":"Eduardo Chandomí-Castellanos, E. Escobar-Gómez, Sergio F. Aguilar Marroquín-Cano, Héctor R. Hernández De León, S. Velázquez-Trujillo, Jorge A. Sarmiento-Torres, Carlos Venturino De Coss Pérez","doi":"10.1109/CoDIT55151.2022.9804145","DOIUrl":"https://doi.org/10.1109/CoDIT55151.2022.9804145","url":null,"abstract":"This paper proposes to solve the problem of the simple Traveler Agent by applying combined heuristic methods of local search. The proposed method evaluates a random initial route, using a modified simulated annealing algorithm that seeks to improve the route's cost globally, and finally, using a 2-opt local search technique that improves the cost. Different instances of TSPLIB data are evaluated and compared with other methods. The proposed method is compared with other techniques such as Ant Colony Optimization algorithm (ACO), Neural Networks (NN), Particle Swarm Optimization (PSO), and Genetics Algorithm (GA), where results are obtained sub-optimal solution, but in shorter computational time; Validation is obtained by applying two types of statistical indices, the relative percentage error and the coefficient of variation, as well as the execution times in seconds. Finally, using the instances, a MAPE equal to 3.0353% is obtained.","PeriodicalId":185510,"journal":{"name":"2022 8th International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129137735","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 : 2022-05-17DOI: 10.1109/CoDIT55151.2022.9803979
Abdelweheb Gueddes, M. Mahjoub
Several areas have evolved with the evolution of technology. Telemedicine and home care are one of them. While there are many studies on home care, the overall problem of decision-making is not sufficiently addressed. In previous research, we proposed an ontological-based intervention system. Despite its abilities, reasoning on an ontology is currently limited to logic. However, in the case of inconsistent knowledge or unreliable and incomplete information, it is difficult for a system to make a decision or assess the degree of truth of a hypothesis. Several approaches have been made and focused mainly on how to represent probabilistic information in ontologies and then use them for reasoning. Although, this requires a great effort for systems already designed and based on ontological or Bayesian knowledge bases. In this article, we propose two approaches to combining probabilistic and logical reasoning within a home-based medical intervention system. The first, using probabilistic ontology PR-OWL. The second, providing a Jena API (Application Programming Interface).
{"title":"Combining Logical and Probabilistic Reasoning to Improve a home care platform","authors":"Abdelweheb Gueddes, M. Mahjoub","doi":"10.1109/CoDIT55151.2022.9803979","DOIUrl":"https://doi.org/10.1109/CoDIT55151.2022.9803979","url":null,"abstract":"Several areas have evolved with the evolution of technology. Telemedicine and home care are one of them. While there are many studies on home care, the overall problem of decision-making is not sufficiently addressed. In previous research, we proposed an ontological-based intervention system. Despite its abilities, reasoning on an ontology is currently limited to logic. However, in the case of inconsistent knowledge or unreliable and incomplete information, it is difficult for a system to make a decision or assess the degree of truth of a hypothesis. Several approaches have been made and focused mainly on how to represent probabilistic information in ontologies and then use them for reasoning. Although, this requires a great effort for systems already designed and based on ontological or Bayesian knowledge bases. In this article, we propose two approaches to combining probabilistic and logical reasoning within a home-based medical intervention system. The first, using probabilistic ontology PR-OWL. The second, providing a Jena API (Application Programming Interface).","PeriodicalId":185510,"journal":{"name":"2022 8th International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115977844","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 : 2022-05-17DOI: 10.1109/codit55151.2022.9804112
H. Abouaissa
{"title":"Model-Free Control for Real-Time Dynamic Traffic Routing Problems","authors":"H. Abouaissa","doi":"10.1109/codit55151.2022.9804112","DOIUrl":"https://doi.org/10.1109/codit55151.2022.9804112","url":null,"abstract":"","PeriodicalId":185510,"journal":{"name":"2022 8th International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116373375","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 : 2022-05-17DOI: 10.1109/CoDIT55151.2022.9803929
Jaouher Chrouta, A. Aloui, N. Hamani, A. Zaafouri
Several variants of particle swarm optimization (PSO) have been created to identify various solutions to compli-cated optimization problems. Only a few PSO algorithms exist that can locate and monitor multiple optima in dynamically shifting search landscapes when dealing with dynamic optimization situations. These methods have yet to be thoroughly tested on a large number of dynamic optimization problems. In fact, because there are so many PSO algorithm modifications, it's simple to get stuck in a local optima. To address the aforementioned flaws, this work proposes and evaluates an enhanced version of the multiswarm particle swarm optimization technique (MsPSO) with numerous variations particle swarm optimization published in the literature. Standard tests and indicators provided in the specialized literature are used to verify the effectiveness of the suggested algorithm. Furthermore, on the CEC’ 13 test suite, comparison results between the extended heterogeneous multi swarm PSO algorithm (XMsPSO) and other nine popular PSO show that XMsPSO achieves a very optimistic performance for solving various kinds of problems, contributing to both higher solution accuracy.
{"title":"Improved Multi-Particle Swarm Optimization based on multi-exemplar and forgetting ability","authors":"Jaouher Chrouta, A. Aloui, N. Hamani, A. Zaafouri","doi":"10.1109/CoDIT55151.2022.9803929","DOIUrl":"https://doi.org/10.1109/CoDIT55151.2022.9803929","url":null,"abstract":"Several variants of particle swarm optimization (PSO) have been created to identify various solutions to compli-cated optimization problems. Only a few PSO algorithms exist that can locate and monitor multiple optima in dynamically shifting search landscapes when dealing with dynamic optimization situations. These methods have yet to be thoroughly tested on a large number of dynamic optimization problems. In fact, because there are so many PSO algorithm modifications, it's simple to get stuck in a local optima. To address the aforementioned flaws, this work proposes and evaluates an enhanced version of the multiswarm particle swarm optimization technique (MsPSO) with numerous variations particle swarm optimization published in the literature. Standard tests and indicators provided in the specialized literature are used to verify the effectiveness of the suggested algorithm. Furthermore, on the CEC’ 13 test suite, comparison results between the extended heterogeneous multi swarm PSO algorithm (XMsPSO) and other nine popular PSO show that XMsPSO achieves a very optimistic performance for solving various kinds of problems, contributing to both higher solution accuracy.","PeriodicalId":185510,"journal":{"name":"2022 8th International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114222187","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 : 2022-05-17DOI: 10.1109/CoDIT55151.2022.9804072
G. Cochard, M. Hifi, E-S. Samod, Labib Yousef
In this paper we propose a population-based method for tackling the k-clustering minimum bi-clique completion problem. We investigate the use of the discrete particle swarm optimisation combined with a special neighborhood decent procedure. Often configuration generated by the so-called swarm process induces infeasible solutions. In order to overcome to these situations, we introduce a tolerance strategy, where its aim is to highlight the quality of the current solution where an enlarging search space is considered. The behavior of the designed method is evaluated on some benchmark instances and its provided bounds are compared to those achieved by more recent methods available in the literature. New bounds are discovered.
{"title":"A Population-Based Algorithm for the k-Clustering Minimum Biclique Completion Problem","authors":"G. Cochard, M. Hifi, E-S. Samod, Labib Yousef","doi":"10.1109/CoDIT55151.2022.9804072","DOIUrl":"https://doi.org/10.1109/CoDIT55151.2022.9804072","url":null,"abstract":"In this paper we propose a population-based method for tackling the k-clustering minimum bi-clique completion problem. We investigate the use of the discrete particle swarm optimisation combined with a special neighborhood decent procedure. Often configuration generated by the so-called swarm process induces infeasible solutions. In order to overcome to these situations, we introduce a tolerance strategy, where its aim is to highlight the quality of the current solution where an enlarging search space is considered. The behavior of the designed method is evaluated on some benchmark instances and its provided bounds are compared to those achieved by more recent methods available in the literature. New bounds are discovered.","PeriodicalId":185510,"journal":{"name":"2022 8th International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114654174","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 : 2022-05-17DOI: 10.1109/CoDIT55151.2022.9803996
E. G. Hernández-Martínez, F. Morales-Torres, J. E. Quiroz-Ibarra, Mauricio Flores Geronimo, G. Fernández‐Anaya, E. Vazquez, J. Flores-Godoy
This paper proposes a fluid based macroscopical perspective for modeling and simulation of Vehicular Traffic Networks based on the connection of continuous dynamical agents. The agents' flows are designed to be facilitated by a high-level planner that represents conventional traffic signals cycles. The research examines the dynamics of groups using various state-space representations. Some numerical simulations are presented to demonstrate the approach's use and scalability. In order to evaluate the evolution of the system design, several performance criteria were also established and tested.
{"title":"Modeling and Performance Analysis of Vehicular Traffic Networks: A Multi-agent Perspective","authors":"E. G. Hernández-Martínez, F. Morales-Torres, J. E. Quiroz-Ibarra, Mauricio Flores Geronimo, G. Fernández‐Anaya, E. Vazquez, J. Flores-Godoy","doi":"10.1109/CoDIT55151.2022.9803996","DOIUrl":"https://doi.org/10.1109/CoDIT55151.2022.9803996","url":null,"abstract":"This paper proposes a fluid based macroscopical perspective for modeling and simulation of Vehicular Traffic Networks based on the connection of continuous dynamical agents. The agents' flows are designed to be facilitated by a high-level planner that represents conventional traffic signals cycles. The research examines the dynamics of groups using various state-space representations. Some numerical simulations are presented to demonstrate the approach's use and scalability. In order to evaluate the evolution of the system design, several performance criteria were also established and tested.","PeriodicalId":185510,"journal":{"name":"2022 8th International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127342827","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 : 2022-05-17DOI: 10.1109/CoDIT55151.2022.9803901
G. Jagadeesh, Jielin Yang, K. Ng, K. Poh, Zhengyu Yang, Teck-Hou Teng, Zhibing Zhuo
Online optimization of traffic signal timing in response to varying demand is an effective way to tackle traffic congestion. This necessitates the development of optimization models with fast solution times. This paper presents an efficient formulation, derived from a novel cell-based model of intersection traffic, for optimizing signal plans of an isolated intersection. The formulation is applicable to real-world intersections, which involve movements controlled by multiple phases, permitted turns and inter-phase intervals. It has been found to be orders of magnitude faster than a baseline formulation that represents the state-of-the-art. The effectiveness of the proposed approach, in terms of mean trip delay and throughput, has been evaluated through simulation under realistic conditions and found to be only marginally lower than the baseline.
{"title":"A Computationally Efficient Formulation for Traffic Signal Timing Optimization of an Isolated Intersection","authors":"G. Jagadeesh, Jielin Yang, K. Ng, K. Poh, Zhengyu Yang, Teck-Hou Teng, Zhibing Zhuo","doi":"10.1109/CoDIT55151.2022.9803901","DOIUrl":"https://doi.org/10.1109/CoDIT55151.2022.9803901","url":null,"abstract":"Online optimization of traffic signal timing in response to varying demand is an effective way to tackle traffic congestion. This necessitates the development of optimization models with fast solution times. This paper presents an efficient formulation, derived from a novel cell-based model of intersection traffic, for optimizing signal plans of an isolated intersection. The formulation is applicable to real-world intersections, which involve movements controlled by multiple phases, permitted turns and inter-phase intervals. It has been found to be orders of magnitude faster than a baseline formulation that represents the state-of-the-art. The effectiveness of the proposed approach, in terms of mean trip delay and throughput, has been evaluated through simulation under realistic conditions and found to be only marginally lower than the baseline.","PeriodicalId":185510,"journal":{"name":"2022 8th International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127445669","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 : 2022-05-17DOI: 10.1109/CoDIT55151.2022.9804153
P. Wu, F. Gao, Keqiang Li
In mixed traffics, humans are easily confused by the non-humanlike lane change of autonomous vehicles. This may even bring traffic accidents. According to the naturalistic driving analysis results that there exist significant influences of multi-obstacles on lane change behavior, a humanlike lane change decision strategy for scenarios with multi-obstacles is presented. The driver tolerance force is proposed to establish the relationship between the longitudinal social force and lateral lane change behavior by using the driver's speed requirement. Then the visual attenuation coefficient is designed to reflect the influence of social forces generated by different traffic participants. Compared with other methods, the statistical results based on the naturalistic driving data indicate that the proposed strategy has a higher decision accuracy of target lane and start point.
{"title":"A Humanlike Lane Change Decision Strategy for Mixed Traffics with Multi-objects","authors":"P. Wu, F. Gao, Keqiang Li","doi":"10.1109/CoDIT55151.2022.9804153","DOIUrl":"https://doi.org/10.1109/CoDIT55151.2022.9804153","url":null,"abstract":"In mixed traffics, humans are easily confused by the non-humanlike lane change of autonomous vehicles. This may even bring traffic accidents. According to the naturalistic driving analysis results that there exist significant influences of multi-obstacles on lane change behavior, a humanlike lane change decision strategy for scenarios with multi-obstacles is presented. The driver tolerance force is proposed to establish the relationship between the longitudinal social force and lateral lane change behavior by using the driver's speed requirement. Then the visual attenuation coefficient is designed to reflect the influence of social forces generated by different traffic participants. Compared with other methods, the statistical results based on the naturalistic driving data indicate that the proposed strategy has a higher decision accuracy of target lane and start point.","PeriodicalId":185510,"journal":{"name":"2022 8th International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126610961","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 : 2022-05-17DOI: 10.1109/CoDIT55151.2022.9803980
S. Kamel, Ameni Kadri, F. Bacha
To ensure a good quality of electrical energy at all points of the distribution network, the grid operators install several static compensators of reactive power (STATCOM) and many active power filters at some common coupling points PCC. This paper focuses on the operation of a static converter connected at PCC point performing the function of a static compensator (STATCOM) in the case of a voltage drop exceeding the standards and ensuring the function of an active power filter (APF) in the opposite case. This static converter ensures the regulation of the PCC voltage and eliminates the current harmonics produced by the non-linear loads connected to the grid. The control laws are designed to allow the converter to switch between the operation of a STATCOM and an active power filter. Furthermore, this research article represents an important aspect in scientific research concerning the control of FACT devices. A static reactive power compensator (STATCOM) for reactive power control and an active power filter (APF) performance are investigated by Improved Virtual flux based Direct Power Control (IVF_DPC). The association of a static converter with the (IVF_DPC) control allows to react in a very fast time to the grid perturbations. Simulation results of an improved control scheme (IVF-DPC) for STATOM / APF are affected by MATLAB / Simulink software to demonstrate the dynamic performance of the proposed control strategy. The adopted control scheme is implemented using the dSPACE 1104 board. Real time implementation results prove the efficiency and uniqueness of the adopted strategy
{"title":"Real-Time Implementation Of A Static Compensator (STATCOM) / Active Power Filter For Power Quality Improvement Based On Improved VF-DPC Control Strategy","authors":"S. Kamel, Ameni Kadri, F. Bacha","doi":"10.1109/CoDIT55151.2022.9803980","DOIUrl":"https://doi.org/10.1109/CoDIT55151.2022.9803980","url":null,"abstract":"To ensure a good quality of electrical energy at all points of the distribution network, the grid operators install several static compensators of reactive power (STATCOM) and many active power filters at some common coupling points PCC. This paper focuses on the operation of a static converter connected at PCC point performing the function of a static compensator (STATCOM) in the case of a voltage drop exceeding the standards and ensuring the function of an active power filter (APF) in the opposite case. This static converter ensures the regulation of the PCC voltage and eliminates the current harmonics produced by the non-linear loads connected to the grid. The control laws are designed to allow the converter to switch between the operation of a STATCOM and an active power filter. Furthermore, this research article represents an important aspect in scientific research concerning the control of FACT devices. A static reactive power compensator (STATCOM) for reactive power control and an active power filter (APF) performance are investigated by Improved Virtual flux based Direct Power Control (IVF_DPC). The association of a static converter with the (IVF_DPC) control allows to react in a very fast time to the grid perturbations. Simulation results of an improved control scheme (IVF-DPC) for STATOM / APF are affected by MATLAB / Simulink software to demonstrate the dynamic performance of the proposed control strategy. The adopted control scheme is implemented using the dSPACE 1104 board. Real time implementation results prove the efficiency and uniqueness of the adopted strategy","PeriodicalId":185510,"journal":{"name":"2022 8th International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126873302","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
扫码关注我们
求助内容：
应助结果提醒方式：