| 1. |
- Bennulf, Mattias, 1992-, et al.
(författare)
-
Identification of resources and parts in a Plug and Produce system using OPC UA
- 2019
-
Ingår i: Procedia Manufacturing. - : Elsevier BV. - 2351-9789. ; 38, s. 858-865
-
Tidskriftsartikel (refereegranskat)abstract
- This paper describes a method together with an implementation for automating the detection, identification and configuration of newly added resources and parts in a Plug and Produce system using OPC UA. In a Plug and Produce system, resources and parts are usually controlled by agents, forming a multi-agent system of collaborating resources. Hence, when a resource or part is connected to the system, a corresponding agent must be instantiated and associated with that specific device. In order to automate this, the system needs information about newly connected devices. This information could, for example, be positional data describing where the device is connected. Some devices like tools and parts to be processed have no own network connection, but still, they should get an agent with correct configuration instantiated. In this work, OPC UA is used for communication between devices and the corresponding agents. All agents and their communication are handled by an Agent Handling System, consisting of an OPC UA HUB together with functions for device detection and agent instantiation. The HUB is used for transferring data between devices and their agents in the network by OPC UA protocols. When a device is connected to the network, it is detected, and a connection is automatically created to the HUB that becomes configured for transmitting data between the device and its corresponding agent. © 2019 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
|
|
| 2. |
- Bennulf, Mattias, 1992-, et al.
(författare)
-
Verification and deployment of automatically generated robot programs used in prefabrication of house walls
- 2018
-
Ingår i: Procedia CIRP. - : Elsevier BV. - 2212-8271 .- 2212-8271. ; 72, s. 272-276
-
Tidskriftsartikel (refereegranskat)abstract
- This paper presents a method for automating the generation, verification and deployment of robot programs used in prefabrication of walls for family houses. The making of robot programs is today performed manually by experts, i.e. implying high costs. This is a huge disadvantage since each wall can be unique. The work demonstrates, with implementation and testing, a method to automate the generation of robot programs for fabrication of walls made of wood. This includes the task of generating collision free paths, automatic verification of path performance and deploying to a real industrial robot with minimal human interaction. © 2018 The Authors. Published by Elsevier B.V.
|
|
| 3. |
- Danielsson, Fredrik, 1972-, et al.
(författare)
-
A genetic algorithm with shuffle for job shop scheduling problems
- 2015
-
Ingår i: Modelling and simulation 2015. - Ostend : ESM. - 9789077381908 ; , s. 363-367
-
Konferensbidrag (refereegranskat)abstract
- Job shop scheduling problems are computationally complex combinatorial optimization problems. Genetic algorithms have been used in various forms and in combination with other algorithms to solve job shop scheduling problems. A partially flexible job shop with precedence constraints increases this complex behaviour. There are two main parts to optimizing ajob shop, the routing and the scheduling. The objective here is to get consistent optimal makespan using a genetic algorithm. This paper firstly, presents a simulation approach for the considered partially flexible job shop scheduling problem. Which take into account the precedence constraints and reduce situations of deadlock. To solve the partially flexible job shop scheduling problem a genetic algorithm was used and improved. It utilise a genetic crossovers for routing and a new random shuffle feature is introduced for the scheduling. The computational results have shown that the algorithm performs well in terms of finding a consistent optimal schedule for the given problem
|
|
| 4. |
- Glorieux, Emile, 1989-, et al.
(författare)
-
An energy model for press line tending robots
- 2016
-
Ingår i: ESM'2016, the 2016 European simulation and Modelling Conference. - : Eurosis. - 9789077381953 ; , s. 377-383
-
Konferensbidrag (refereegranskat)abstract
- Today most industries aim at reducing energy consumption to become sustainable and environment-friendly. The automotive industry, with mass production and large volumes, is one such example. With many robots working round the clock, there is great potential to save energy. In this climate there is a need for robot simulation models that can be used for motion and task execution optimisation and which are aimed lowering energy consumption. This paper presents an energy consumption model for 2D-belt robots for press line tending in the automotive sector. The energy model is generic for 2D-belt robots and is entirely based on component specifications (e.g., dimensions, masses, inertia). An implementation and validation against a real 2D-belt tending robot used in the automotive industry is performed and presented. The purpose and usefulness of the energy model is also demonstrated by two application cases; the investigation of potential energy reductions achieved by reducing the weight of gripper tools, and by using mechanical brakes when the robot is idle.
|
|
| 5. |
- Glorieux, Emile, 1989-, et al.
(författare)
-
Constructive cooperative coevolution for large-scale global optimisation
- 2017
-
Ingår i: Journal of Heuristics. - : Springer Science and Business Media LLC. - 1381-1231 .- 1572-9397. ; 23:6, s. 449-469
-
Tidskriftsartikel (refereegranskat)abstract
- This paper presents the Constructive Cooperative Coevolutionary ( C3C3 ) algorithm, applied to continuous large-scale global optimisation problems. The novelty of C3C3 is that it utilises a multi-start architecture and incorporates the Cooperative Coevolutionary algorithm. The considered optimisation problem is decomposed into subproblems. An embedded optimisation algorithm optimises the subproblems separately while exchanging information to co-adapt the solutions for the subproblems. Further, C3C3 includes a novel constructive heuristic that generates different feasible solutions for the entire problem and thereby expedites the search. In this work, two different versions of C3C3 are evaluated on high-dimensional benchmark problems, including the CEC'2013 test suite for large-scale global optimisation. C3C3 is compared with several state-of-the-art algorithms, which shows that C3C3 is among the most competitive algorithms. C3C3 outperforms the other algorithms for most partially separable functions and overlapping functions. This shows that C3C3 is an effective algorithm for large-scale global optimisation. This paper demonstrates the enhanced performance by using constructive heuristics for generating initial feasible solutions for Cooperative Coevolutionary algorithms in a multi-start framework.
|
|
| 6. |
- Glorieux, Emile, 1989-, et al.
(författare)
-
Constructive cooperative coevolutionary optimisation for interacting production stations
- 2015
-
Ingår i: The International Journal of Advanced Manufacturing Technology. - : Springer Science and Business Media LLC. - 0268-3768 .- 1433-3015. ; 78:1-4, s. 673-688
-
Tidskriftsartikel (refereegranskat)abstract
- Optimisation of the control function for multiple automated interacting production stations is a complex problem, even for skilled and experienced operators or process planners. When using mathematical optimisation techniques, it often becomes necessary to use simulation models to represent the problem because of the high complexity (i.e. simulation-based optimisation). Standard optimisation techniques are likely to either exceed the practical time frame or under-perform compared to the manual tuning by the operators or process planners. This paper presents the Constructive cooperative coevolutionary (C3) algorithm, which objective is to enable effective simulation-based optimisation for the control of automated interacting production stations within a practical time frame. C3 is inspired by an existing cooperative coevolutionary algorithm. Thereby, it embeds an algorithm that optimises subproblems separately. C3 also incorporates a novel constructive heuristic to find good initial solutions and thereby expedite the optimisation. In this work, two industrial optimisation problems, involving interaction production stations, with different sizes are used to evaluate C3. The results illustrate that with C3, it is possible to optimise these problems within a practical time frame and obtain a better solution compared to manual tuning.
|
|
| 7. |
- Glorieux, Emile, 1989-, et al.
(författare)
-
Energy Consumption Model for 2D-Belt Robots
- 2016
-
Ingår i: 7th Swedish Production Symposium Conference proceedings. - Lund : SPS16. ; , s. 1-7
-
Konferensbidrag (refereegranskat)abstract
- Production that incorporates robotics consumes energy and the trend today is to reduce consumed energy not only to lower the cost but also to be a more energy efficient entity. Energy models can be used to predict the energy consumed by robot(s) for optimising the input parameters which determine robot motion and task execution. This paper presents an energy model to predict the energy consumption of 2D-belt robots used for press line tending. Based on the components’ specifications and the trajectory, an estimation of the energy consumption is computed. The capabilities of the proposed energy model to predict the energy consumption during the planning-phase (i.e. before installation), avoiding the need for physical experiments, are demonstrated. This includes predicting potential energy reductions achieved by reducing the weight of the gripper tools. Additionally, it is also shown how to investigate the energy saving achieved by using mechanical brakes when the robot is idle. This effectively illustrates the purpose and usefulness of the proposed energy model.
|
|
| 8. |
- Glorieux, Emile, et al.
(författare)
-
Improved Constructive Cooperative Coevolutionary Differential Evolution for Large-Scale Optimisation
- 2016
-
Ingår i: Computational Intelligence, 2015 IEEE Symposium Series on. - : IEEE. - 9781479975600 ; , s. 1703-1710
-
Konferensbidrag (refereegranskat)abstract
- The Differential Evolution (DE) algorithm is widely used for real-world global optimisation problems in many different domains. To improve DE's performance on large-scale optimisation problems, it has been combined with the Cooperative Coevolution (CCDE) algorithm. CCDE adopts a divide-and-conquer strategy to optimise smaller subcomponents separately instead of tackling the large-scale problem at once. DE then evolves a separate subpopulation for each subcomponent but there is cooperation between the subpopulations to co-adapt the individuals of the subpopulations with each other. The Constructive Cooperative Coevolution (C3DE) algorithm, previously proposed by the authors, is an extended version of CCDE that has a better performance on large-scale problems, interestingly also on non-separable problems. This paper proposes a new version, called the Improved Constructive Cooperative Coevolutionary Differential Evolution (C3iDE), which removes several limitations with the previous version. A novel element of C3iDE is the advanced initialisation of the subpopulations. C3iDE initially optimises the subpopulations in a partially co-adaptive fashion. During the initial optimisation of a subpopulation, only a subset of the other subcomponents is considered for the co-adaptation. This subset increases stepwise until all subcomponents are considered. The experimental evaluation of C3iDE on 36 high-dimensional benchmark functions (up to 1000 dimensions) shows an improved solution quality on large-scale global optimisation problems compared to CCDE and DE. The greediness of the co-adaptation with C3iDE is also investigated in this paper.
|
|
| 9. |
- Glorieux, Emile, 1989-
(författare)
-
Multi-Robot Motion Planning Optimisation for Handling Sheet Metal Parts
- 2017
-
Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
- Motion planning for robot operations is concerned with path planning and trajectory generation. In multi-robot systems, i.e. with multiple robots operating simultaneously in a shared workspace, the motion planning also needs to coordinate the robots' motions to avoid collisions between them. The multi-robot coordination decides the cycle-time for the planned paths and trajectories since it determines to which extend the operations can take place simultaneously without colliding. To obtain the quickest cycle-time, there needs to bean optimal balance between, on the one hand short paths and fast trajectories, and on the other hand possibly longer paths and slower trajectories to allow that the operations take place simultaneously in the shared workspace. Due to the inter-dependencies, it becomes necessary to consider the path planning, trajectory generation and multi-robot coordination together as one optimisation problem in order to find this optimal balance.This thesis focusses on optimising the motion planning for multi-robot material handling systems of sheet metal parts. A methodology to model the relevant aspects of this motion planning problem together as one multi-disciplinary optimisation problem for Simulation based Optimisation (SBO) is proposed. The identified relevant aspects include path planning,trajectory generation, multi-robot coordination, collision-avoidance, motion smoothness, end-effectors' holding force, cycle-time, robot wear, energy efficiency, part deformations, induced stresses in the part, and end-effectors' design. The cycle-time is not always the (only) objective since it is sometimes equally/more important to minimise robot wear, energy consumption, and/or part deformations. Different scenarios for these other objectives are therefore also investigated. Specialised single- and multi-objective algorithms are proposed for optimising the motion planning of these multi-robot systems. This thesis also investigates how to optimise the velocity and acceleration profiles of the coordinated trajectories for multi-robot material handling of sheet metal parts. Another modelling methodology is proposed that is based on a novel mathematical model that parametrises the velocity and acceleration profiles of the trajectories, while including the relevant aspects of the motion planning problem excluding the path planning since the paths are now predefined.This enables generating optimised trajectories that have tailored velocity and acceleration profiles for the specific material handling operations in order to minimise the cycle-time,energy consumption, or deformations of the handled parts.The proposed methodologies are evaluated in different scenarios. This is done for real world industrial case studies that consider the multi-robot material handling of a multi-stage tandem sheet metal press line, which is used in the automotive industry to produce the cars' body panels. The optimisation results show that significant improvements can be obtained compared to the current industrial practice.
|
|
| 10. |
- Glorieux, Emile, et al.
(författare)
-
Simulation-based Time and Jerk Optimisation for Robotic Press Tending
- 2015
-
Ingår i: Modellling and Simulation. - Ostende : ESM. - 9789077381908 ; , s. 377-384
-
Konferensbidrag (refereegranskat)abstract
- Increased production rate and robot motion smoothness in a sheet metal press line are essential. Smooth robot motions avoid unplanned production interruptions and excessive wear of the robots. Reaching high production rate and smooth motions requires tuning of the tending press robot control to minimise the cycle time and jerk. Doing this for a press line with multiple robots is a complex large-scale problem. To model such problems for the optimisation process, computer simulations become almost essential. This work presents simulation-based optimisation of the time and jerk of robotic press tending operations and investigates the importance of including the robot motion’s smoothness. An optimiser works in concert with a simulation model of a sheet metal press line and its parametrised control system. The effect of including jerk minimisation in the objective function is tested on a real-world problem concerning a sheetmetal press line. The results illustrate the importance of including jerk-minimisation as an objective in the optimisation.Furthermore, the performance of this approach is compared with manual tuning by experienced operators. The results show that the proposed simulation-based optimisation approach outperforms manual tuning.
|
|
