Open AccessThe optimization of contact sensors motion path in carrying out control operations
Author(s) -
N. Y. Glinskaya,
Vadim Elagin
Publication year - 2019
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1333/4/042008
Subject(s) - travelling salesman problem , path (computing) , mathematical optimization , control (management) , computer science , greedy algorithm , optimization problem , motion planning , control theory (sociology) , robot , mathematics , artificial intelligence , programming language
The article examines the problem of raising control operations efficiency through measurement mechanisms transference optimization. For solving the problem it is proposed to use the discrete optimization method, based on solving the “traveling salesman” problem. The article demonstrates the comparison of the “greedy” algorithm and the branch – and – bound method and proves the necessity to use optimized algorithms, as even approximate algorithms make it possible to reduce the length of the way monitoring sensor passed. Reducing the length of the way the monitoring sensor passes leads to reducing the control operation time. The time gain depends on the quantity of controlled parameters.