Seminarier

SOAFs styrelse är glada att kunna meddela att vi nu drar igång en seminarieserie om operationsanalys och angränsande områden. Seminarier kommer att ges av såväl forskare som användare av operationsanalys, och både av SOAF-medlemmar och andra. Vår förhoppning är att seminerieserien ska ge en inblick i tillståndet av operationsanalysen i Sverige och omvärlden idag, men även en utblick mot angränsande områden och områden av framtida intresse. Vi hoppas kunna erbjuda ett seminarium per kvartal, till en början rena online-seminarier, men så småningom kombinerade fysiska och online-seminarier eller till och med rent fysiska seminarier. 

Nästa seminarium hålls den 29 september klockan 12:15 – 13:00, av Edvin Åblad, Fraunhofer-Chalmers Research Centre (FCC) / Matematiska vetenskaper vid Chalmers Tekniska Högskola :

Spatial–temporal load balancing and coordination of multi-robot stations

We study a station in an automotive manufacturing production line consisting of multiple robots, a workpiece, and a set of predefined tasks such as welding or inspection. The goal is to assign each task to a robot and to select one of the corresponding kinematic poses. We minimize the makespan of the multi-robot station; hence, both sequences and motions of the robots need to be computed. These two aspects are, traditionally, decoupled using the shortest path assumption: “let each robot use its shortest motion between poses”. This, however, leads to poor solutions for some industrial instances. To find better solutions, we suggest a method preventing robot collisions by partitioning the robots’ shared workspace into disjoint private zones. 

In some cases, a static partitions allow for a good makespan, since the disjointness of the robots workspaces removes all need for robots waiting on one another. However, we also consider a dynamic sequence of such partitions to allow for closely located tasks to be assigned to different robots. Where we utilize vehicle routing formulations to model the robots’ sequences, and a coarse time indexing together with set packing constraints to model the workspace partitioning. Since the shortest path assumption usually performs well, no significant reduction in makespan can be expected. However, for some robot stations, a dynamic partition can reduce the makespan with as much as 28% compared to a solution using the shortest path assumption.

Presentationen ges på engelska.

Länk för anmälan till seminarierna skickas till föreningens medlemmar per mail.

Tidigare seminarier

  • 2 juni 2022: Kamran Forghani, Institutionen för informationsteknologi, Uppsala universitet: ”Sawing optimization in the wood industry from 3D scanning data”
  • 9 december 2022: Niloofar Minbashi, Avdelningen för Transportplanering, KTH: ”The application of machine learning in years departure prediction”
  • 9 september 2021: Björn Morén, Optimeringslära, Linköpings Universitet:”What can optimization contribute to in high dose-rate brachytherapy?”
  • 6 maj 2021: Tomas Alfredsson, Systecon: ”Life Cycle Management”