E. Minca, A. Filipescu, Heneri-George Coanda, Florin Dragomir, O. Dragomir, A. Filipescu
{"title":"Extended Approach for Modelling and simulation of Mechatronics Lines Served by Collaborative Mobile Robots","authors":"E. Minca, A. Filipescu, Heneri-George Coanda, Florin Dragomir, O. Dragomir, A. Filipescu","doi":"10.1109/ICSTCC.2018.8540713","DOIUrl":"https://doi.org/10.1109/ICSTCC.2018.8540713","url":null,"abstract":"This article proposes an extended approach to assembly/disassembly mechatronics lines (A/DML) modelling, in terms of service system typologies: autonomous mobile robots, collaborative mobile robots versus mobile robots with parallel action. The A/DML systems served by mobile robots have a specific typology and are modelled by specialized hybrid instruments belonging to Petri Nets class: Timed Petri Nets (TPN), Synchronised Hybrid Petri Nets (SHPN). For the reasons imposed by the production manufacturing management, for transporting components, are used mobile robotic platforms equipped with manipulators, which are dedicated or shared status between production manufacturing lines. The collaborative transport systems meet the specific concepts of shared resources with avoiding collisions while the parallel transport systems are subordinated of synchronized actions concepts. This paper focuses on SHPN models and off-line simulation results for the state, boundedness, viability and possible deadlock of process analysis. Task planning is used to identify synchronous events of SHPN model, the last one being useful for implementing of real-time control.","PeriodicalId":308427,"journal":{"name":"2018 22nd International Conference on System Theory, Control and Computing (ICSTCC)","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115447853","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}
{"title":"Nonlinear Control of Flat Systems Using a Non-Flat Output with Dynamic Extension","authors":"K. Robenack, S. Palis","doi":"10.1109/ICSTCC.2018.8540654","DOIUrl":"https://doi.org/10.1109/ICSTCC.2018.8540654","url":null,"abstract":"If a nonlinear system is differentially flat and a flat output is known, the design of a linearizing feedback law is straightforward. For state-space systems, this corresponds to the input-to-state linearization. Otherwise, i.e., if the system is not flat or no flat output can be found, we could carry out an input-output linearization provided the system is minimum phase. In this case, only certain parts of the systems dynamics are assigned by the control law. From a theoretical point of view, this method is based on the Byrnes-Isidori normal form. A less common approach is the usage of the non-flat output in order to carry out a linearization in connection with the generalized controller canonical form [8]. The linearization is achieved by a dynamic extension. The existence of an alternative linearization method may be advantageous from a computational point of view and gives additional degrees of freedom, e.g., allowing for a higher-order of the desired closed-loop dynamics. Both approaches are illustrated on the nonlinear boost converter model.","PeriodicalId":308427,"journal":{"name":"2018 22nd International Conference on System Theory, Control and Computing (ICSTCC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114614324","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}
{"title":"Artificial Neural Network Approach for Fault Recognition in a Wastewater Treatment Process","authors":"M. Miron, L. Frangu, S. Caraman, L. Luca","doi":"10.1109/ICSTCC.2018.8540694","DOIUrl":"https://doi.org/10.1109/ICSTCC.2018.8540694","url":null,"abstract":"The paper deals with fault detection and recognition for WWTP (Wastewater Treatment Plant). The chosen classifier is a feed-forward neural network. Its input is a high-size vector of measured variables, rather than a small-size compressed feature vector. The output of the network points to the recognized fault class. The test was performed on a simulated WWTP, disturbed by 6 different types of faults (sensors and actuators). The results of the test proved a good ability of the neural network to recognize the faults, in 97.2% of the analysed cases.","PeriodicalId":308427,"journal":{"name":"2018 22nd International Conference on System Theory, Control and Computing (ICSTCC)","volume":"155 11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128680866","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}
{"title":"Comparative analysis among frequency sampling algorithm applied in microwave measurements","authors":"C. Rosca, N. Paraschiv","doi":"10.1109/ICSTCC.2018.8540696","DOIUrl":"https://doi.org/10.1109/ICSTCC.2018.8540696","url":null,"abstract":"This paper presents a comparative analysis between five algorithms. The goal of the algorithms was to reduce the acquisition time for high frequency measurements using Vector Network Analyzer. The proposed algorithms were developed by the authors and in this paper the accuracy and the execution time will be analyzed. The results will be presented in terms of information consistency and dynamic behavior. Finally, a classification between the five proposed algorithms using a key performance indicator will emphasize only one algorithm with high performances regarding the significant number of frequencies reduction, the decreasing of computation effort keeping the accuracy and the consistency of the initial device response.","PeriodicalId":308427,"journal":{"name":"2018 22nd International Conference on System Theory, Control and Computing (ICSTCC)","volume":"169 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130724163","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}
{"title":"Solutions of Discrete Time Linear Systems: Upper Bounds on Deviations","authors":"P. Shcherbakov, S. Parsegov","doi":"10.1109/ICSTCC.2018.8540705","DOIUrl":"https://doi.org/10.1109/ICSTCC.2018.8540705","url":null,"abstract":"Transient performance problems in stable linear systems were always in focus of the control community. Nevertheless, deviations of trajectories in input-free discrete time systems have been paid much less attention. In this paper, we are interested in estimating the magnitudes of deviations caused by nonzero initial conditions. First, we present examples where the magnitude of peak can be computed in closed form and show that it may take very large values. Next, we propose numerical procedures for the computation of upper bounds on deviations and for the design of peak-attenuating controllers. Finally, we present an extension to the case of uncertain systems. Numerical experiments confirm the efficiency of the approach and demonstrate its low conservatism.","PeriodicalId":308427,"journal":{"name":"2018 22nd International Conference on System Theory, Control and Computing (ICSTCC)","volume":"414 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121705116","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}
{"title":"Design Optimization for High Throughput Recursive Systematic Convolutional Encoders","authors":"Luca Pilato, Gabriele Meoni, L. Fanucci","doi":"10.1109/ICSTCC.2018.8540693","DOIUrl":"https://doi.org/10.1109/ICSTCC.2018.8540693","url":null,"abstract":"Recursive Systematic Convolutional (RSC) codes are the building blocks of the modern communication systems. In this paper we propose a new analytical model to manipulate the modulo-2 algebraic operations and a finite state machine model describing the single-cycle RSC architecture to design high throughput RSC code with special emphasis for parallel implementation and a puncturing scheme embedded in the design. The new design approach is suitable for any RSC code and for almost any degree of parallelism implementations. We also present some case studies about the RSC code architecture and some simulation results for the Bit Error Rate, to compare commonly used RSC codes with different constraints on the length, and redesigned with the proposed methodology.","PeriodicalId":308427,"journal":{"name":"2018 22nd International Conference on System Theory, Control and Computing (ICSTCC)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122775057","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}
{"title":"Two Approximate Approaches for Reliability Evaluation in Large Networks. Comparative Study","authors":"P. Cașcaval, S. Floria","doi":"10.1109/ICSTCC.2018.8540730","DOIUrl":"https://doi.org/10.1109/ICSTCC.2018.8540730","url":null,"abstract":"This paper deals with the complex problem of reliability evaluation of stochastic networks in which both links and nodes failures are considered, and compares two approximate approaches able to reduce the computation time: a sum of disjoint products (SDP) approach and another based on Monte Carlo simulation. In case of the SDP approach, the reliability is computed based on the minimal paths. In a first stage, only the links of the network are considered, and a ‘multiple variables inversion’ technique for developing the set of minimal paths into a sum of disjoint products is applied. Then, in a second stage, each term of the set of disjoint Iink- products is processed separately taking into consideration the reliability values for both links and adjacent nodes. In case of Monte Carlo simulation, for speeding up the method and reducing the computation time, both minimal paths and cuts are considered. Also, other acceleration techniques are applied.","PeriodicalId":308427,"journal":{"name":"2018 22nd International Conference on System Theory, Control and Computing (ICSTCC)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123076490","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}
{"title":"Investigating an A-star Algorithm-based Fitness Function for Mobile Robot Evolution","authors":"Shanker G. R. Prabhu, P. Kyberd, Jodie Wetherall","doi":"10.1109/ICSTCC.2018.8540734","DOIUrl":"https://doi.org/10.1109/ICSTCC.2018.8540734","url":null,"abstract":"One of the factors that affect the success of Evolutionary Robotics (ER) is the way fitness functions are designed to operate. While needs-based custom fitness functions have been developed, most of the time they have been defined in simpler mathematical functions to reduce the computation time. In this paper, we hypothesize that an incremental fitness function based on established techniques in specific task domains in robotics will aid the evolution process. An A-star algorithm-based fitness function for path planning is designed and implemented for evolving the body plans and controllers of robots for navigation and obstacle avoidance tasks. It has been shown that using this concept, fitter robots have evolved in most cases when compared to simple distance-only based fitness functions. However, due to variable performance of the evolver with the A-star fitness function, the results are inconclusive. We also identify problems associated with the fitness function and make recommendations for designing future fitness functions based on observations of the experiments.","PeriodicalId":308427,"journal":{"name":"2018 22nd International Conference on System Theory, Control and Computing (ICSTCC)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124598219","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}
Maria P. Marcos, J. L. Pitarch, C. de Prada, C. Jasch
{"title":"Modelling and real-time optimisation of an industrial cooling-water network","authors":"Maria P. Marcos, J. L. Pitarch, C. de Prada, C. Jasch","doi":"10.1109/ICSTCC.2018.8540655","DOIUrl":"https://doi.org/10.1109/ICSTCC.2018.8540655","url":null,"abstract":"This work deals with the problem of distribution of cooling water in an evaporation process. The aim is to develop a Real-Time optimisation (RTO) tool which improves the resource efficiency by supplying the optimal water distribution within a surface-condensers network for a given production demand. The approach includes experimental models and the automatic update of fouling factor. The problem is formulated and solved via nonlinear programming. Production constraints and concerns about the practical implementation are also taken into account in the design of the RTO tool.","PeriodicalId":308427,"journal":{"name":"2018 22nd International Conference on System Theory, Control and Computing (ICSTCC)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132371182","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}
{"title":"Performance Evaluation of a Moving Horizon Estimator for Multi-Rate Sensor Fusion with Time-Delayed Measurements","authors":"Rodolphe Dubois, S. Bertrand, A. Eudes","doi":"10.1109/ICSTCC.2018.8540711","DOIUrl":"https://doi.org/10.1109/ICSTCC.2018.8540711","url":null,"abstract":"In this paper, the use of a Moving Horizon Estimator (MHE) is investigated to address a class of state estimation problems dealing with multi-rate sensor fusion in presence of time-delayed measurements. As it makes use of a batch of past measurement and state estimates, MHE is indeed a good candidate to deal with “missing” measurements. Nevertheless, since Moving Horizon Estimation relies on solving online an optimization problem to compute the state estimate, its computational load may be prohibitive for practical implementation to fast dynamical systems. Therefore this paper proposes a computationaly efficient implementation scheme for a variable structure linear MHE dealing with multi-rate time-delayed measurements, in the case where an analytical solution of the underlying optimization problem can be found. A simulation example is considered for performance comparison of the proposed MHE with respect to several state-of-the-art estimators, in terms of accuracy and computation time.","PeriodicalId":308427,"journal":{"name":"2018 22nd International Conference on System Theory, Control and Computing (ICSTCC)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132176327","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}