TY - CHAP A1 - Evans, Benjamin A1 - Braun, Sebastian A1 - Ulmer, Jessica A1 - Wollert, Jörg T1 - AAS implementations - current problems and solutions T2 - 20th International Conference on Mechatronics - Mechatronika (ME) N2 - The fourth industrial revolution presents a multitude of challenges for industries, one of which being the increased flexibility required of manufacturing lines as a result of increased consumer demand for individualised products. One solution to tackle this challenge is the digital twin, more specifically the standardised model of a digital twin also known as the asset administration shell. The standardisation of an industry wide communications tool is a critical step in enabling inter-company operations. This paper discusses the current state of asset administration shells, the frameworks used to host them and their problems that need to be addressed. To tackle these issues, we propose an event-based server capable of drastically reducing response times between assets and asset administration shells and a multi-agent system used for the orchestration and deployment of the shells in the field. KW - Industry 4.0 KW - Multi-agent Systems KW - Digital Twin KW - Asset Administration Shell Y1 - 2022 SN - 978-1-6654-1040-3 U6 - https://doi.org/10.1109/ME54704.2022.9982933 N1 - 20th International Conference on Mechatronics - Mechatronika (ME), 07-09 December 2022, Pilsen, Czech Republic PB - IEEE CY - New York, NY ER - TY - BOOK A1 - Gebhardt, Andreas A1 - Kessler, Julia A1 - Thurn, Laura T1 - 3D-Drucken: Grundlagen und Anwendungen des additive manufacturing (AM) Y1 - 2016 SN - 978-3-446-44672-4 U6 - https://doi.org/10.3139/9783446448452 PB - Hanser CY - München ET - 2., neu bearbeitete und erweiterte Auflage 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 - TY - JOUR A1 - Scheidweiler, Robert A1 - Triesch, Eberhard T1 - A note on the duality between matchings and vertex covers in balanced hypergraphs JF - Journal of Combinatorial Optimization N2 - We present a new Min-Max theorem for an optimization problem closely connected to matchings and vertex covers in balanced hypergraphs. The result generalizes Kőnig’s Theorem (Berge and Las Vergnas in Ann N Y Acad Sci 175:32–40, 1970; Fulkerson et al. in Math Progr Study 1:120–132, 1974) and Hall’s Theorem (Conforti et al. in Combinatorica 16:325–329, 1996) for balanced hypergraphs. KW - Hall’s Theorem KW - Koenig’s Theorem KW - Duality KW - Balanced hypergraph KW - Hypergraph KW - Vertex cover KW - Matching Y1 - 2016 U6 - https://doi.org/10.1007/s10878-015-9887-5 SN - 1573-2886 N1 - Lehrstuhl II für Mathematik RWTH Aachen VL - 32 IS - 2 SP - 639 EP - 644 PB - Springer CY - Berlin ER - TY - JOUR A1 - Kilic, S. A. A1 - Raatschen, Hans-Jürgen A1 - Körfgen, B. A1 - Apaydin, N. M. A1 - Astaneh-Asl, A. T1 - FE Model of the Fatih Sultan Mehmet Suspension Bridge Using Thin Shell Finite Elements JF - Arabian Journal for Science and Engineering N2 - This paper presents the results of an eigenvalue analysis of the Fatih Sultan Mehmet Bridge. A high-resolution finite element model was created directly from the available design documents. All physical properties of the structural components were included in detail, so no calibration to the measured data was necessary. The deck and towers were modeled with shell elements. A nonlinear static analysis was performed before the eigenvalue calculation. The calculated natural frequencies and corresponding mode shapes showed good agreement with the available measured ambient vibration data. The calculation of the effective modal mass showed that nine modes had single contributions higher than 5 % of the total mass. They were in a frequency range up to 1.2 Hz. The comparison of the results for the torsional modes especially demonstrated the advantage of using thin shell finite elements over the beam modeling approach. KW - Suspension bridge KW - 3D nonlinear finite element model KW - Thin shell finite elements KW - Natural frequency KW - Effective modal mass Y1 - 2017 U6 - https://doi.org/10.1007/s13369-016-2316-y SN - 2191-4281 VL - 42 IS - 3 SP - 1103 EP - 1116 PB - Springer Nature ER - TY - CHAP A1 - Engemann, Heiko A1 - Wiesen, Patrick A1 - Kallweit, Stephan A1 - Deshpande, Harshavardhan A1 - Schleupen, Josef T1 - Autonomous mobile manipulation using ROS T2 - Advances in Service and Industrial Robotics Y1 - 2018 SN - 978-3-319-61276-8 U6 - https://doi.org/10.1007/978-3-319-61276-8_43 N1 - International Conference on Robotics in Alpe-Adria Danube Region RAAD 2017; Mechanisms and Machince Science book series, Vol 49. SP - 389 EP - 401 PB - Springer CY - Cham ER - TY - JOUR A1 - Pfaff, Raphael T1 - Einsatz von offenen Onlinekursen in der Eisenbahnlehre JF - Deine Bahn N2 - Eigene positive Erfahrungen mit Onlinekursen sowie die geringen Studierendenzahlen in der Präsenzlehre gaben den Anstoß zu einem Experiment mit einem offenen Onlinekurs auf der Plattform Udemy. Die Erfahrungen sowohl bei der Erstellung und als auch im Lehrbetrieb waren positiv und führten zu einer neuen Beschäftigung mit Inhalten und Lernenden, getrieben durch die Anforderungen der Lernplattform. Y1 - 2017 SN - 0948-7263 IS - 1 SP - 12 EP - 16 PB - Bahn-Fachverlag CY - Berlin ER - TY - CHAP A1 - Moshiri-Kahak, Amir A1 - Pfaff, Raphael A1 - Gäbel, Markus A1 - Reich, Alexander T1 - Modellierung der Adhäsionsfläche im Rad-Schiene-Kontakt unter Einsatz von reibwertverbessernden Mitteln T2 - 15. Internationale Schienenfahrzeugtagung Rad Schiene 2017, Dresden, März 2017 Y1 - 2017 N1 - Internationale Schienenfahrzeugtagung <15., 2017, Dresden> ER - TY - CHAP A1 - Pfaff, Raphael A1 - Schmidt, B. D. A1 - Enning, Manfred T1 - Towards inclusion of the freight rail system in the industrial internet of things - Wagon 4.0 T2 - Stephenson Conference, London, March 2017 Y1 - 2017 N1 - IMechE Stephenson Conference <2017, London, United Kingdom> SP - 1 EP - 10 ER -