Browsing
     by title


0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

or enter first few letters:   
OK
Full Text
Peer Reviewed
See detailDeadzone-Quadratic Penalty Function for Predictive Extended Cruise Control with Experimental Validation
Sajadi Alamdari, Seyed Amin UL; Voos, Holger UL; Darouach, Mohamed

in ROBOT 2017: Third Iberian Robotics Conference, Sevilla, Spain 22-24 November 2017 (2017, November)

Battery Electric Vehicles have high potentials for the modern transportations, however, they are facing limited cruising range. To address this limitation, we present a semi-autonomous ecological driver ... [more ▼]

Battery Electric Vehicles have high potentials for the modern transportations, however, they are facing limited cruising range. To address this limitation, we present a semi-autonomous ecological driver assistance system to regulate the velocity with energy-efficient techniques. The main contribution of this paper is the design of a real-time nonlinear receding horizon optimal controller to plan the online cost-effective cruising velocity. Instead of conventional L2-norms, a deadzone-quadratic penalty function for the nonlinear model predictive controller is proposed. Obtained field experimental results demonstrate the effectiveness of the proposed method for a semi-autonomous electric vehicle in terms of real-time energy-efficient velocity regulation and constraints satisfaction. [less ▲]

Detailed reference viewed: 160 (9 UL)
Full Text
Peer Reviewed
See detailDealing with interfaces in partitioned model order reduction for application to nonlinear problems
Goury, Olivier; Kerfriden, Pierre; Bordas, Stéphane UL

Scientific Conference (2013)

We propose a reduced order modelling technique based on a partitioning of the domain of study in the context of para- metric nonlinear problems. A formulation of the reduction of the displacement and of ... [more ▼]

We propose a reduced order modelling technique based on a partitioning of the domain of study in the context of para- metric nonlinear problems. A formulation of the reduction of the displacement and of the interface tractions linking subdomains to each others will be performed in a FETI context. [less ▲]

Detailed reference viewed: 366 (4 UL)
Full Text
Peer Reviewed
See detailDealing with requirements: Influences on Idea Generation in the Early Stages of Product Development
Gericke, Kilian UL; Schmidt-Kretschmer, Michael; Blessing, Lucienne UL

in Proceedings of DTRS7: Design Meeting Protocols (2007)

This paper aims at identifying factors which influence the number of ideas generated during a brainstorming meeting as part of an industrial mechanical engineering design project. A framework for ... [more ▼]

This paper aims at identifying factors which influence the number of ideas generated during a brainstorming meeting as part of an industrial mechanical engineering design project. A framework for describing groups of influencing factors and their relationships is used. As a result of an explorative, comparative protocol analysis of two design meetings the influence of some factors is described e.g. the formulation of the design task description and the sequence of the process steps. [less ▲]

Detailed reference viewed: 145 (1 UL)
Full Text
Peer Reviewed
See detailDecentralised Finance's timocratic governance: The distribution and exercise of tokenised voting rights
Barbereau, Tom Josua UL; Smethurst, Reilly UL; Papageorgiou, Orestis UL et al

in Technology in Society (2023), 73

Ethereum's public distributed ledger can issue tokenised voting rights that are tradable on crypto-asset exchanges by potentially anyone. Ethereum thus enables global, unincorporated associations to ... [more ▼]

Ethereum's public distributed ledger can issue tokenised voting rights that are tradable on crypto-asset exchanges by potentially anyone. Ethereum thus enables global, unincorporated associations to conduct governance experiments. Such experiments are crucial to Decentralised Finance (DeFi). DeFi is a nascent field of unlicensed, unregulated, and non-custodial financial services that utilise public distributed ledgers and crypto-assets rather than corporate structures and sovereign currencies. The inaugural Bloomberg Galaxy DeFi Index, launched in August 2021, included nine Ethereum-based projects – non-custodial exchanges as well as lending and derivatives platforms. Each project is governed, at least in part, by unregistered holders of tokenised voting rights (also known as governance tokens). Token-holders typically vote for or against coders' improvement proposals that pertain to anything from the allocation of treasury funds to a collateral's risk parameters. DeFi's governance thus depends on the distribution and exercise of tokenised voting rights. Since archetypal DeFi projects are not managed by companies or public institutions, not much is known about DeFi's governance. Regulators and law-makers from the United States recently asked if DeFi's governance entails a new class of “shadowy” elites. In response, we conducted an exploratory, multiple-case study that focused on the tokenised voting rights issued by the nine projects from Bloomberg's inaugural Galaxy DeFi index. Our mixed methods approach drew on Ethereum-based data about the distribution, trading, staking, and delegation of voting rights tokens, as well as project documentation and archival records. We discovered that DeFi projects' voting rights are highly concentrated, and the exercise of these rights is very low. Our theoretical contribution is a philosophical intervention: minority rule, not “democracy”, is the probable outcome of token-tradable voting rights and a lack of applicable anti-concentration laws. We interpret DeFi's minority rule as timocratic. [less ▲]

Detailed reference viewed: 62 (13 UL)
Full Text
Peer Reviewed
See detailDecentralised minimal-time consensus
Yuan, Y.; Stan, G.-B.; Barahona, M. et al

in The proceedings of the 2011 50th IEEE Conference on Decision and Control and European Control Conference (CDC-ECC) (2011)

This study considers the discrete-time dynamics of a network of agents that exchange information according to the nearest-neighbour protocol under which all agents are guaranteed to reach consensus ... [more ▼]

This study considers the discrete-time dynamics of a network of agents that exchange information according to the nearest-neighbour protocol under which all agents are guaranteed to reach consensus asymptotically. We present a fully decentralised algorithm that allows any agent to compute the consensus value of the whole network in finite time using only the minimal number of successive values of its own history. We show that this minimal number of steps is related to a Jordan block decomposition of the network dynamics and present an algorithm to obtain the minimal number of steps in question by checking a rank condition on a Hankel matrix of the local observations. Furthermore, we prove that the minimal number of steps is related to other algebraic and graph theoretical notions that can be directly computed from the Laplacian matrix of the graph and from the underlying graph topology. [less ▲]

Detailed reference viewed: 116 (0 UL)
Full Text
Peer Reviewed
See detailDecentralised minimal-time dynamic consensus
Yuan, Y.; Liu, J.; Murray, R. M. et al

in The proceedings of the 2012 American Control Conference (ACC) (2012)

This paper considers a group of agents that aim to reach an agreement on individually measured time-varying signals by local communication. In contrast to static network averaging problem, the consensus ... [more ▼]

This paper considers a group of agents that aim to reach an agreement on individually measured time-varying signals by local communication. In contrast to static network averaging problem, the consensus we mean in this paper is reached in a dynamic sense. A discrete-time dynamic average consensus protocol can be designed to allow all the agents tracking the average of their reference inputs asymptotically. We propose a minimal-time dynamic consensus algorithm, which only utilises minimal number of local observations of randomly picked node in a network to compute the final consensus signal. Our results illustrate that with memory and computational ability, the running time of distributed averaging algorithms can be indeed improved dramatically using local information as suggested by Olshevsky and Tsitsiklis. [less ▲]

Detailed reference viewed: 105 (2 UL)
Full Text
Peer Reviewed
See detailDecentralised minimum-time consensus
Yuan, Ye; Stan, Guy-Bart; Shi, Ling et al

in Automatica (2013), 49(5), 1227-1235

We consider the discrete-time dynamics of a network of agents that exchange information according to a nearest-neighbour protocol under which all agents are guaranteed to reach consensus asymptotically ... [more ▼]

We consider the discrete-time dynamics of a network of agents that exchange information according to a nearest-neighbour protocol under which all agents are guaranteed to reach consensus asymptotically. We present a fully decentralised algorithm that allows any agent to compute the final consensus value of the whole network in finite time using the minimum number of successive values of its own state history. We show that the minimum number of steps is related to a Jordan block decomposition of the network dynamics, and present an algorithm to compute the final consensus value in the minimum number of steps by checking a rank condition of a Hankel matrix of local observations. Furthermore, we prove that the minimum number of steps is related to graph theoretical notions that can be directly computed from the Laplacian matrix of the graph and from the minimum external equitable partition. [less ▲]

Detailed reference viewed: 210 (4 UL)
Full Text
Peer Reviewed
See detailDecentralized final value theorem for discrete-time LTI systems with application to minimal time distributed consensus
Yuan, Y.; Stan, G. B. V.; Shi, L. et al

in The proceedings of the Joint 48th IEEE Conference on Decision and Control and 28th Chinese Control Conference (2009)

In this study, we consider an unknown discrete-time, linear time-invariant, autonomous system and characterise, the minimal number of discrete-time steps necessary to compute the asymptotic final value of ... [more ▼]

In this study, we consider an unknown discrete-time, linear time-invariant, autonomous system and characterise, the minimal number of discrete-time steps necessary to compute the asymptotic final value of a state. The results presented in this paper have a direct link with the celebrated final value theorem. We apply these results to the design of an algorithm for minimal-time distributed consensus and illustrate the results on an example. [less ▲]

Detailed reference viewed: 70 (0 UL)
Peer Reviewed
See detailDecompositions of the optimal dispatching problem of electric and electric-hybrid buses with energy constraints for Luxembourg City
Picarelli, Erika; Rinaldi, Marco UL; Viti, Francesco UL et al

Scientific Conference (2018, September)

We are a team of engineers working on a concrete project of Mobility in Luxembourg. We want to solve the problem of optimally determining the sequence of electric and hybrid electric buses, considering ... [more ▼]

We are a team of engineers working on a concrete project of Mobility in Luxembourg. We want to solve the problem of optimally determining the sequence of electric and hybrid electric buses, considering both service constraints (schedule adherence) and energy constraints (electric bus charging status, bus recharging scheduling in capacitated facilities) and at the same time ensure a high level of quality of service for the user satisfaction. The problem is formulated as a Mixed Integer Linear Program, with the objective of minimizing the total operational cost for the bus lines in question. System dynamics are captured by twenty sets of constraints, ranging from scheduling adherence to discharge-recharge dynamics. Individual operational costs at the bus level (cost of running an electric / non-electric bus per km, cost of recharging) and at the trip level (penalty due to failed schedule adherence) are fully parametrised, allowing for extensive sensitivity analysis. We investigate a real-life case study based in the city of Luxembourg, where the objective is to reach the all-electric mode for principal urban buses network. Through the model we investigate: the minimum amount of electric buses necessary to perform a day’s schedule for two currently partially electrified lines, without resorting to conventional internal combustion alternatives; the impact of electrifying two additional lines, specifically considering the trade-offs related to either adding new buses or new charging stations at the bus terminal. Finally, we studied how to best decompose the overall problem in several smaller problems, to be able to solve also realistic scenarios and using large real data sets from the Mobility Data owner of Luxembourg. We analysed and compared two kinds of decomposition: a bus line-based decomposition, and a time-based decomposition. [less ▲]

Detailed reference viewed: 106 (7 UL)
Full Text
Peer Reviewed
See detailA Decoupling Approach to Design Observers for Polytopic Takagi-Sugeno Models Subject to Unknown Inputs
Bezzaoucha, Souad UL; Voos, Holger UL; Davila, Jorge et al

in Proceedings of the 2018 American Control Conference (2018, June 27)

A decoupling approach for state estimation of nonlinear systems represented in the polytopic Takagi-Sugeno with unmeasurable premise variables subject to unknown inputs is proposed in this paper. The idea ... [more ▼]

A decoupling approach for state estimation of nonlinear systems represented in the polytopic Takagi-Sugeno with unmeasurable premise variables subject to unknown inputs is proposed in this paper. The idea consists in defining a state and unknown input transformations in order to divide the state vector into two parts, a measurable part and an observable one (decoupled from the unknown input). A classical Luenberger observer to estimate the unmeasurable part is then designed and given in terms of Linear Matrix Inequalities (LMIs) conditions. A numerical example is also presented in order to illustrate the proposed approach. [less ▲]

Detailed reference viewed: 181 (6 UL)
Full Text
See detailDeep Learning for Ground and Non-ground Surface Separation: A Feature-based Semantic Segmentation Algorithm for Point Cloud Classification
Nurunnabi, Abdul Awal Md UL; Lindenbergh, Roderik; Teferle, Felix Norman UL

E-print/Working paper (2022)

Precise ground surface topography is crucial for 3D city analysis, digital terrain modeling, natural disaster monitoring, high-density map generation, and autonomous navigation to name a few. Deep ... [more ▼]

Precise ground surface topography is crucial for 3D city analysis, digital terrain modeling, natural disaster monitoring, high-density map generation, and autonomous navigation to name a few. Deep learning (DL; LeCun, et al., 2015), a division of machine learning (ML), has been achieving unparalleled success in image processing, and recently demonstrated a huge potential for point cloud analysis. This article presents a feature-based DL algorithm that classifies ground and non-ground points in aerial laser scanning point clouds. Recent advancements of remote sensing technologies make it possible digitizing the real world in a near automated fashion. LiDAR (Light Detection and Ranging) based point clouds that are a type of remotely sensed georeferenced data, providing detailed 3D information on objects and environment have been recognized as one of the most powerful means of digitization. Unlike imagery, point clouds are unstructured, sparse and of irregular data format which creates many challenges, but also provides huge opportunities for capturing geometric details of scanned surfaces with millimeter accuracy. Classifying and separating non-ground points from ground points largely reduce data volumes for consecutive analyses of either ground or non-ground surfaces, which consequently saves cost and labor, and simplifies further analysis. [less ▲]

Detailed reference viewed: 75 (2 UL)
Full Text
Peer Reviewed
See detailDeep neural network with high-order neuron for the prediction of foamed concrete strength
Nguyen, Tuan; Kashani, Alireza; Ngo, Tuan et al

in Computer-Aided Civil and Infrastructure Engineering (2018)

The article presents a deep neural network model for the prediction of the compressive strength of foamed concrete. A new, high-order neuron was developed for the deep neural network model to improve the ... [more ▼]

The article presents a deep neural network model for the prediction of the compressive strength of foamed concrete. A new, high-order neuron was developed for the deep neural network model to improve the performance of the model. Moreover, the cross-entropy cost function and rectified linear unit activation function were employed to enhance the performance of the model. The present model was then applied to predict the compressive strength of foamed concrete through a given data set, and the obtained results were compared with other machine learning methods including conventional artificial neural network (C-ANN) and second-order artificial neural network (SO-ANN). To further validate the proposed model, a new data set from the laboratory and a given data set of high-performance concrete were used to obtain a higher degree of confidence in the prediction. It is shown that the proposed model obtained a better prediction, compared to other methods. In contrast to C-ANN and SO-ANN, the proposed model can genuinely improve its performance when training a deep neural network model with multiple hidden layers. A sensitivity analysis was conducted to investigate the effects of the input variables on the compressive strength. The results indicated that the compressive strength of foamed concrete is greatly affected by density, followed by the water-to-cement and sand-to-cement ratios. By providing a reliable prediction tool, the proposed model can aid researchers and engineers in mixture design optimization of foamed concrete. [less ▲]

Detailed reference viewed: 201 (12 UL)
Full Text
Peer Reviewed
See detailDeFi, Not So Decentralized: The Measured Distribution of Voting Rights
Barbereau, Tom Josua UL; Smethurst, Reilly UL; Papageorgiou, Orestis UL et al

in Proceedings of the Hawaii International Conference on System Sciences 2022 (2022, January)

Bitcoin and Ethereum are frequently promoted as decentralized, but developers and academics question their actual decentralization. This motivates further experiments with public permissionless ... [more ▼]

Bitcoin and Ethereum are frequently promoted as decentralized, but developers and academics question their actual decentralization. This motivates further experiments with public permissionless blockchains to achieve decentralization along technical, economic, and political lines. The distribution of tokenized voting rights aims for political decentralization. Tokenized voting rights achieved notoriety within the nascent field of decentralized finance (DeFi) in 2020. As an alternative to centralized crypto-asset exchanges and lending platforms (owned by companies like Coinbase and Celsius), DeFi developers typically create non-custodial projects that are not majority-owned or managed by legal entities. Holders of tokenized voting rights can instead govern DeFi projects. To scrutinize DeFi’s distributed governance strategies, we conducted a multiple-case study of non-custodial, Ethereum-based DeFi projects: Uniswap, Maker, SushiSwap, Yearn Finance, and UMA. Our findings are novel and surprising: quantitative evaluations of DeFi’s distributed governance strategies reveal a failure to achieve political decentralization. [less ▲]

Detailed reference viewed: 856 (70 UL)
Full Text
Peer Reviewed
See detailDeliberate and Accidental Gas-Phase Alkali Doping of Chalcogenide Semiconductors: Cu(In,Ga)Se2
Colombara, Diego UL; Berner, Ulrich; Ciccioli, Andrea et al

in Scientific Reports (2017), 7

Alkali metal doping is essential to achieve highly efficient energy conversion in Cu(In,Ga)Se2 (CIGSe) solar cells. Doping is normally achieved through solid state reactions, but recent observations of ... [more ▼]

Alkali metal doping is essential to achieve highly efficient energy conversion in Cu(In,Ga)Se2 (CIGSe) solar cells. Doping is normally achieved through solid state reactions, but recent observations of gas phase alkali transport in the kesterite sulfide (Cu2ZnSnS4) system (re)open the way to a novel gas-phase doping strategy. However, the current understanding of gas-phase alkali transport is very limited. This work (i) shows that CIGSe device efficiency can be improved from 2% to 8% by gas-phase sodium incorporation alone, (ii) identifies the most likely routes for gas-phase alkali transport based on mass spectrometric studies, (iii) provides thermochemical computations to rationalize the observations and (iv) critically discusses the subject literature with the aim to better understand the chemical basis of the phenomenon. These results suggest that accidental alkali metal doping occurs all the time, that a controlled vapor pressure of alkali metal could be applied during growth to dope the semiconductor, and that it may have to be accounted for during the currently used solid state doping routes. It is concluded that alkali gas-phase transport occurs through a plurality of routes and cannot be attributed to one single source. [less ▲]

Detailed reference viewed: 306 (14 UL)
Full Text
Peer Reviewed
See detailDemand and Interference Aware Adaptive Resource Management for High Throughput GEO Satellite Systems
Abdu, Tedros Salih UL; Kisseleff, Steven UL; Lagunas, Eva UL et al

in IEEE Open Journal of the Communications Society (2022)

The scarce spectrum and power resources, the inter-beam interference, together with the high traffic demand, pose new major challenges for the next generation of Very High Throughput Satellite (VHTS ... [more ▼]

The scarce spectrum and power resources, the inter-beam interference, together with the high traffic demand, pose new major challenges for the next generation of Very High Throughput Satellite (VHTS) systems. Accordingly, future satellites are expected to employ advanced resource/interference management techniques to achieve high system spectrum efficiency and low power consumption while ensuring user demand satisfaction. This paper proposes a novel demand and interference aware adaptive resource management for geostationary (GEO) VHTS systems. For this, we formulate a multi-objective optimization problem to minimize the total transmit power consumption and system bandwidth usage while matching the offered capacity with the demand per beam. In this context, we consider resource management for a system with full-precoding, i.e. all beams are precoded; without precoding, i.e. no precoding is applied to any beam; and with partial precoding, i.e. only some beams are precoded. The nature of the problem is non-convex and we solve it by jointly using the Dinkelbach and Successive Convex Approximation (SCA) methods. The simulation results show that the proposed method outperforms the benchmark schemes. Specifically, we show that the proposed method requires low resource consumption, low computational time, and simultaneously achieves a high demand satisfaction. [less ▲]

Detailed reference viewed: 176 (53 UL)
Full Text
Peer Reviewed
See detailDemontage von Elektroantrieben mit Assistenzrobotern zum wirtschaftlichen Recycling
Jungbluth, Jan UL; Plapper, Peter UL; Gerke, Wolfgang

in Tagungsband AALE 2016 (2016)

Die zerstörungsfreie Demontage zum Zweck der Refrabrikation oder des höherwertigem Produktrecyclings findet nur selten im industriellen Umfeld Anwendung. Allerdings ist mit einem Anstieg dieses trennenden ... [more ▼]

Die zerstörungsfreie Demontage zum Zweck der Refrabrikation oder des höherwertigem Produktrecyclings findet nur selten im industriellen Umfeld Anwendung. Allerdings ist mit einem Anstieg dieses trennenden Fertigungsverfahrens in naher Zukunft zu rechnen da die immer stärker begrenzten und zugänglichen Ressourcen durch strengere Gesetze im Rahmen der Abfallwirtschaft gesichert werden müssen. Zum Beispiel wurden durch das Kreislaufwirt-schaftsgesetz der europäischen Union [1] die Hersteller dazu verpflichtet Rücknahmesysteme für elektrische und elektronische Geräte zu schaffen um sie einer weiteren wirtschaftlichen Nutzung oder umweltgerechten Entsorgung zugänglich zu machen. Für die umweltgerechte Entsorgung ist eine wertstoffgerechte Trennung der Produktkomponenten vorgesehen. Aus wirtschaftlichen Gründen erfolgt diese Materialtrennung meist verfahrenstechnisch durch Zerkleinern und Sortieren der Wertstoffe. Die weitere wirtschaftliche Nutzung ganzer Kompo-nenten wird, trotz hoher Einsparpotenziale [2], durch den Aufwand der Refabrikation kaum in Betracht gezogen. Denn die zerstörungsfreie Trennung kann bisher meist nur manuell und damit kostenintensiv erfolgen. In der Folge werden gerade im Bereich der Elektroschrottver-wertung häufig illegale Entsorgungswege über das außereuropäische Ausland gewählt [3]. Zur Verbesserung der Wirtschaftlichkeit der Demontage bietet oft die Automatisierung Lösun-gen. Um diesen Sektor der Automatisierung zugänglich zu machen, erfolgten bereits For-schungsaktivitäten zur Automatisierung der Demontage von Fernsehgeräten [4] und PCs [5]. Das Ergebnis dieser Studien zeigt, dass durch die hohe Variation der Produktgestalt oder aufgrund von Beschädigungen der Produkte, der [less ▲]

Detailed reference viewed: 376 (11 UL)
See detaildenmpc
Dentler, Jan Eric UL

Software (2017)

This package is providing an object oriented real-time nonlinear model predictive control (NMPC) framework which developed at the Automation & Robotics Research Group http://wwwde.uni.lu/snt/research ... [more ▼]

This package is providing an object oriented real-time nonlinear model predictive control (NMPC) framework which developed at the Automation & Robotics Research Group http://wwwde.uni.lu/snt/research/automation_robotics_research_group at the University of Luxembourg. It features a modularization for multi-agent systems which allows the on-line change of agents, control objectives, constraints and couplings, triggered by ROS-messages. [less ▲]

Detailed reference viewed: 263 (22 UL)
Full Text
Peer Reviewed
See detailDerivative recovery and a posteriori error estimate for extended finite elements
Bordas, Stéphane UL; Duflot, M.

in Computer Methods in Applied Mechanics and Engineering (2007), 196(35-36), 3381-3399

This paper is the first attempt at error estimation for extended finite elements. The goal of this work is to devise a simple and effective local a posteriori error estimate for partition of unity ... [more ▼]

This paper is the first attempt at error estimation for extended finite elements. The goal of this work is to devise a simple and effective local a posteriori error estimate for partition of unity enriched finite element methods such as the extended finite element method (XFEM). In each element, the local estimator is the L2 norm of the difference between the raw XFEM strain field and an enhanced strain field computed by extended moving least squares (XMLS) derivative recovery obtained from the raw nodal XFEM displacements. The XMLS construction is tailored to the nature of the solution. The technique is applied to linear elastic fracture mechanics, in which near-tip asymptotic functions are added to the MLS basis. The XMLS shape functions are constructed from weight functions following the diffraction criterion to represent the discontinuity. The result is a very smooth enhanced strain solution including the singularity at the crack tip. Results are shown for two- and three-dimensional linear elastic fracture mechanics problems in mode I and mixed mode. The effectivity index of the estimator is close to 1 and improves upon mesh refinement for the studied near-tip problem. It is also shown that for the linear elastic fracture mechanics problems treated, the proposed estimator outperforms one of the superconvergent patch recovery technique of Zienkiewicz and Zhu, which is only C0. Parametric studies of the general performance of the estimator are also carried out. © 2007 Elsevier B.V. All rights reserved. [less ▲]

Detailed reference viewed: 208 (6 UL)
Full Text
Peer Reviewed
See detailDeriving essential components of lean and industry 4.0 assessment model for manufacturing SMEs
Kolla, Sri Sudha Vijay Keshav UL; Minoufekr, Meysam UL; Plapper, Peter UL

in 52nd CIRP Conference on Manufacturing Systems (CMS) (2019), 81

Quantifying lean and ICT architecture related to Industry 4.0 is a new challenge in Small and Medium Scale Enterprises (SMEs) that needs to be addressed by both research as well as enterprises themselves ... [more ▼]

Quantifying lean and ICT architecture related to Industry 4.0 is a new challenge in Small and Medium Scale Enterprises (SMEs) that needs to be addressed by both research as well as enterprises themselves. Especially in the manufacturing sector, SMEs need to transform themselves into emerging trends such as industry 4.0 while practicing existing manufacturing philosophies such as Lean Production Systems (LPS) to be competitive in global markets. The major concern is that there are many assessment models available to measure the status of an enterprise related to either LPS or Industry 4.0. Often, these models are complex and don’t fulfill the requirements of manufacturing SMEs. On the other hand, most of the models only consider either lean or industry 4.0 elements. The outcomes of this research help to develop a hybrid model including both lean and industry 4.0 features suitable for manufacturing SMEs. The main objective of this research is to provide state of the art literature on existing assessment models and consequently map lean and industry 4.0 components to the specific characteristics of manufacturing SMEs. The paper concludes with a summary and outlook for our future research. [less ▲]

Detailed reference viewed: 191 (9 UL)