APPROACH TO RECONFIGURATION OF A MODULAR ROBOT SYSTEM WITH A SUBOPTIMAL SEARCH POLYNOMIAL ALGORITHM
An approach to connecting modular robots is presented, which includes the algorithm of suboptimal reconfiguration search GreedyCM. This component allows to find nearly optimal solutions in timeframes, polynomially dependent on the robotic system size.