Optimizing Energy Consumption of Robotic Cells by a Branch & Bound Algorithm

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F19%3A00323833" target="_blank" >RIV/68407700:21230/19:00323833 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/68407700:21730/19:00323833

Výsledek na webu

<a href="https://doi.org/10.1016/j.cor.2018.09.012" target="_blank" >https://doi.org/10.1016/j.cor.2018.09.012</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.cor.2018.09.012" target="_blank" >10.1016/j.cor.2018.09.012</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Optimizing Energy Consumption of Robotic Cells by a Branch & Bound Algorithm

Popis výsledku v původním jazyce

Nowadays, robotic cells are mostly designed with the main goal to meet the desired production rate without any consideration of the energy efficiency, therefore, it is often possible to achieve significant energy savings without downsizing the production. In our previous study, we established the mathematical formulation of the energy optimization problem, proposed a parallel heuristic, and optimized an existing robotic cell in Škoda Auto, the results of which revealed a 20 % reduction in the energy consumption of robot drive systems. This study proposes a novel parallel Branch & Bound algorithm to optimize the energy consumption of robotic cells without deterioration in throughput. The energy saving is achieved by changing robot speeds and positions, applying robot power-saving modes (brakes, bus power off), and selecting an order of operations. The core part of the algorithm is our tight lower bound, based on convex envelopes. Besides the bounding, a Deep Jumping approach is introduced to guide the search to the promising parts of the Branch & Bound tree, and the parallelization accelerates the exploration of the tree. The experimental results revealed that the performance of the parallel algorithm scales almost linearly up to 12 processor cores, and the quality of obtained solutions is better or comparable to other existing works.

Název v anglickém jazyce

Optimizing Energy Consumption of Robotic Cells by a Branch & Bound Algorithm

Popis výsledku anglicky

Nowadays, robotic cells are mostly designed with the main goal to meet the desired production rate without any consideration of the energy efficiency, therefore, it is often possible to achieve significant energy savings without downsizing the production. In our previous study, we established the mathematical formulation of the energy optimization problem, proposed a parallel heuristic, and optimized an existing robotic cell in Škoda Auto, the results of which revealed a 20 % reduction in the energy consumption of robot drive systems. This study proposes a novel parallel Branch & Bound algorithm to optimize the energy consumption of robotic cells without deterioration in throughput. The energy saving is achieved by changing robot speeds and positions, applying robot power-saving modes (brakes, bus power off), and selecting an order of operations. The core part of the algorithm is our tight lower bound, based on convex envelopes. Besides the bounding, a Deep Jumping approach is introduced to guide the search to the promising parts of the Branch & Bound tree, and the parallelization accelerates the exploration of the tree. The experimental results revealed that the performance of the parallel algorithm scales almost linearly up to 12 processor cores, and the quality of obtained solutions is better or comparable to other existing works.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2019

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Computers & Operations Research

ISSN

0305-0548

e-ISSN

1873-765X

Svazek periodika

102

Číslo periodika v rámci svazku

February

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

15

Strana od-do

52-66

Kód UT WoS článku

000452586100005

EID výsledku v databázi Scopus

2-s2.0-85054726937