TY - JOUR A1 - Babilon, Katharina A1 - Wilbring, Daniela A1 - Tappert, Tim A1 - Pfaff, Raphael A1 - Enning, Manfred T1 - Schienenfahrzeugtechnik hands on – FH Aachen IMechE Railway Challenge JF - Ingenieurspiegel Y1 - 2018 SN - 1868-5919 IS - 2 SP - 20 EP - 22 PB - Public Verlag CY - Bingen ER - TY - JOUR A1 - Franzen, Julius A1 - Pinders, Erik A1 - Pfaff, Raphael A1 - Enning, Manfred T1 - RailCrowd’s virtual fleets: Make most of your asset data JF - Deine Bahn N2 - For smaller railway operators or those with a diverse fleet, it can be difficult to collect sufficient data to improve maintenance programs. At the same time, new rules such as entity in charge of maintenance – ECM – regulations impose an additional workload by requiring a dedicated maintenance management system and specific reports. The RailCrowd platform sets out to facilitate compliance with ECM and similar regulations while at the same time pooling anonymised fleet data across operators to form virtual fleets, providing greater data insights. Y1 - 2018 SN - 0948-7263 IS - 9 SP - 11 EP - 13 PB - Bahn-Fachverlag CY - Berlin ER - TY - JOUR A1 - Schmidt, Bernd A1 - Enning, Manfred A1 - Pfaff, Raphael T1 - Güterwagen 4.0 – Der Güterwagen für das Internet der Dinge Teil 3: Einführungsszenarien für aktive, kommunikative Güterwagen JF - ETR - Eisenbahntechnische Rundschau N2 - Wenn durch innovative, automatisierte Güterwagen betriebswirtschaftliche Vorteile nutzbar gemacht werden sollen, muss die Migration auf das neue System in sinnvollen Teilschritten unter Berücksichtigung der organisationellen und betrieblichen Vereinbarkeit vorgenommen werden. Eine stufenweise Migration mit Nachrüstbarkeit und Kompatibilität kann die optimale Ausstattungsvariante für die unterschiedlichen Betriebsszenarien sowie eine Steigerung der Wirtschaftlichkeit des Gesamtsystems bieten. Y1 - 2018 SN - 0013-2845 VL - 67 IS - 5 SP - 60 EP - 64 PB - DVV Media Group CY - Hamburg ER - TY - JOUR A1 - Thomas, Axel T1 - Technologiezentren in der Aachener Region – Retrospektiven und Perspektiven JF - VM Verwaltung und Management Y1 - 2018 U6 - https://doi.org/10.5771/0947-9856-2018-3-147 SN - 0947-9856 VL - 24 IS - 3 SP - 147 EP - 156 PB - Nomos CY - Baden-Baden ER - TY - JOUR A1 - Thomas, Axel T1 - Zielerreichungen der Technologie- und Gründerzentren aus Sicht der kommunalen Finanzwirtschaft – dargestellt am Beispiel der Aachener Region JF - Der Gemeindehaushalt Y1 - 2018 SN - 0340-3645 VL - 119 IS - 7 SP - 149 EP - 155 PB - Kohlhammer CY - Stuttgart ER - TY - JOUR A1 - Wilbring, Daniela A1 - Enning, Manfred A1 - Pfaff, Raphael A1 - Schmidt, Bernd T1 - Neue Perspektiven für die Bahn in der Produktions- und Distributionslogistik durch Prozessautomation JF - ETR - Eisenbahntechnische Rundschau Y1 - 2020 SN - 0013-2845 VL - 69 IS - 3 SP - 15 EP - 19 ER - TY - JOUR A1 - Cosma, Cosmin A1 - Kessler, Julia A1 - Gebhardt, Andreas A1 - Campbell, Ian A1 - Balc, Nicolae T1 - Improving the Mechanical Strength of Dental Applications and Lattice Structures SLM Processed JF - Materials N2 - To manufacture custom medical parts or scaffolds with reduced defects and high mechanical characteristics, new research on optimizing the selective laser melting (SLM) parameters are needed. In this work, a biocompatible powder, 316L stainless steel, is characterized to understand the particle size, distribution, shape and flowability. Examination revealed that the 316L particles are smooth, nearly spherical, their mean diameter is 39.09 μm and just 10% of them hold a diameter less than 21.18 μm. SLM parameters under consideration include laser power up to 200 W, 250–1500 mm/s scanning speed, 80 μm hatch spacing, 35 μm layer thickness and a preheated platform. The effect of these on processability is evaluated. More than 100 samples are SLM-manufactured with different process parameters. The tensile results show that is possible to raise the ultimate tensile strength up to 840 MPa, adapting the SLM parameters for a stable processability, avoiding the technological defects caused by residual stress. Correlating with other recent studies on SLM technology, the tensile strength is 20% improved. To validate the SLM parameters and conditions established, complex bioengineering applications such as dental bridges and macro-porous grafts are SLM-processed, demonstrating the potential to manufacture medical products with increased mechanical resistance made of 316L. Y1 - 2020 U6 - https://doi.org/10.3390/ma13040905 SN - 1996-1944 VL - 13 IS - 4 SP - 1 EP - 18 PB - MDPI CY - Basel ER - TY - JOUR A1 - Engemann, Heiko A1 - Cönen, Patrick A1 - Dawar, Harshal A1 - Du, Shengzhi A1 - Kallweit, Stephan T1 - A robot-assisted large-scale inspection of wind turbine blades in manufacturing using an autonomous mobile manipulator JF - Applied Sciences N2 - Wind energy represents the dominant share of renewable energies. The rotor blades of a wind turbine are typically made from composite material, which withstands high forces during rotation. The huge dimensions of the rotor blades complicate the inspection processes in manufacturing. The automation of inspection processes has a great potential to increase the overall productivity and to create a consistent reliable database for each individual rotor blade. The focus of this paper is set on the process of rotor blade inspection automation by utilizing an autonomous mobile manipulator. The main innovations include a novel path planning strategy for zone-based navigation, which enables an intuitive right-hand or left-hand driving behavior in a shared human–robot workspace. In addition, we introduce a new method for surface orthogonal motion planning in connection with large-scale structures. An overall execution strategy controls the navigation and manipulation processes of the long-running inspection task. The implemented concepts are evaluated in simulation and applied in a real-use case including the tip of a rotor blade form. KW - mobile manipulation KW - large-scale inspection KW - wind turbine production KW - autonomous navigation KW - surface-orthogonal path planning Y1 - 2021 U6 - https://doi.org/10.3390/app11199271 SN - 2076-3417 N1 - Belongs to the Special Issue "Advances in Industrial Robotics and Intelligent Systems" VL - 11 IS - 19 SP - 1 EP - 22 PB - MDPI CY - Basel ER - TY - JOUR A1 - Koster, Arie A1 - Scheidweiler, Robert A1 - Tieves, Martin T1 - A flow based pruning scheme for enumerative equitable coloring algorithms JF - A flow based pruning scheme for enumerative equitable coloring algorithms N2 - An equitable graph coloring is a proper vertex coloring of a graph G where the sizes of the color classes differ by at most one. The equitable chromatic number is the smallest number k such that G admits such equitable k-coloring. We focus on enumerative algorithms for the computation of the equitable coloring number and propose a general scheme to derive pruning rules for them: We show how the extendability of a partial coloring into an equitable coloring can be modeled via network flows. Thus, we obtain pruning rules which can be checked via flow algorithms. Computational experiments show that the search tree of enumerative algorithms can be significantly reduced in size by these rules and, in most instances, such naive approach even yields a faster algorithm. Moreover, the stability, i.e., the number of solved instances within a given time limit, is greatly improved. Since the execution of flow algorithms at each node of a search tree is time consuming, we derive arithmetic pruning rules (generalized Hall-conditions) from the network model. Adding these rules to an enumerative algorithm yields an even larger runtime improvement. Y1 - 2016 U6 - https://doi.org/10.48550/arXiv.1607.08754 N1 - Lehrstuhl II für Mathematik, RWTH Aachen University SP - 1 EP - 30 ER - TY - JOUR A1 - Beckenbach, Isabel A1 - Scheidweiler, Robert T1 - Perfect ƒ-Matchings and ƒ-Factors in Hypergraphs - A Combinatorial Approach JF - Discrete Mathematics N2 - We prove characterizations of the existence of perfect ƒ-matchings in uniform mengerian and perfect hypergraphs. Moreover, we investigate the ƒ-factor problem in balanced hypergraphs. For uniform balanced hypergraphs we prove two existence theorems with purely combinatorial arguments, whereas for non-uniform balanced hypergraphs we show that the ƒ-factor problem is NP-hard. Y1 - 2016 U6 - https://doi.org/10.1016/j.disc.2017.05.005 SN - 2192-7782 N1 - Als Volltext auch bei ZIB (Zuse Institute Berlin) VL - 240 IS - 10 SP - 2499 EP - 2506 PB - Elsevier CY - Amsterdam ER -