Fachbereich Maschinenbau und Mechatronik
Refine
Year of publication
Institute
- Fachbereich Maschinenbau und Mechatronik (868)
- MASKOR Institut für Mobile Autonome Systeme und Kognitive Robotik (20)
- ECSM European Center for Sustainable Mobility (7)
- Fachbereich Elektrotechnik und Informationstechnik (6)
- Fachbereich Luft- und Raumfahrttechnik (6)
- IaAM - Institut für angewandte Automation und Mechatronik (4)
- Fachbereich Chemie und Biotechnologie (3)
- Fachbereich Medizintechnik und Technomathematik (2)
- Fachbereich Wirtschaftswissenschaften (2)
- Fachbereich Architektur (1)
Document Type
- Article (484)
- Conference Proceeding (207)
- Book (99)
- Part of a Book (32)
- Lecture (21)
- Report (8)
- Bachelor Thesis (5)
- Contribution to a Periodical (3)
- Doctoral Thesis (2)
- Master's Thesis (2)
Keywords
- Rapid Prototyping (8)
- Rapid prototyping (6)
- Übungsklausur (5)
- Additive manufacturing (4)
- Gamification (4)
- Fertigungsverfahren (3)
- Mikrosystemtechnik (3)
- Regelungstechnik (3)
- SLM (3)
- additive manufacturing (3)
Tribological performance of biodegradable lubricants under different surface roughness of tools
(2019)
The increasing digitalization brings new opportunities but also puts new challenges to modern industrial systems. Software agents are one of the key technologies towards self-optimizing factories and are currently used to address the needs of cyber-physical production systems (CPPS). However their interplay in industrial settings needs to be understood better.This paper focusses on securing a cloud infrastructure for multi-agent systems for industrial sites. An industrial site contains multiple production processes that need to communicate with each other and each physical resource is abstracted with a software agent. This volatile architecture needs to be managed and protected from manipulation. The proposed infrastructure presents a security concept for TCP/IP communication between agents, machines, and external networks. It is based on open-source software and tested on a three-node edge cloud controlling a model-plant.
The fourth industrial revolution introduces disruptive technologies to production environments. One of these technologies are multi-agent systems (MASs), where agents virtualize machines. However, the agent's actual performances in production environments can hardly be estimated as most research has been focusing on isolated projects and specific scenarios. We address this gap by implementing a highly connected and configurable reference model with quantifiable key performance indicators (KPIs) for production scheduling and routing in single-piece workflows. Furthermore, we propose an algorithm to optimize the search of extrema in highly connected distributed systems. The benefits, limits, and drawbacks of MASs and their performances are evaluated extensively by event-based simulations against the introduced model, which acts as a benchmark. Even though the performance of the proposed MAS is, on average, slightly lower than the reference system, the increased flexibility allows it to find new solutions and deliver improved factory-planning outcomes. Our MAS shows an emerging behavior by using flexible production techniques to correct errors and compensate for bottlenecks. This increased flexibility offers substantial improvement potential. The general model in this paper allows the transfer of the results to estimate real systems or other models.
Ziel war die technische Überarbeitung und Optimierung des vorliegenden Prototypen, um eine Basis für ein E-Learning System (Internet unterstütztes Lernen) zu schaffen. Zu diesem Zweck wurde das Programm der Robotersteuerung neu erstellt, notwendige mechanische Änderungen an Roboterequipment und Materialförderung vorgenommen sowie eine neue Internet-Anbindung geschaffen. Wesentliche Ergebnisse der Arbeit sind: • Erzeugen roboterbasierter kreisinterpolierter Bahnschweißnähte • Kommunikation des Lernsystems via Internet • Lernorientierte Steuerungssoftware
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.