Motion planning with pulley, rope, and baskets
We study a motion planning problem where items have to be transported from the top room of a tower to the bottom of the tower, while simultaneously other items have to be transported into the opposite direction. Item sets are moved in two baskets hanging on a rope and pulley. To guarantee stability of the system, the weight difference between the contents of the two baskets must always stay below a given ::: threshold. ::: ::: We prove that it is Pi-2-p-complete to decide whether some given initial situation of the underlying discrete system can lead to a given goal situation. Furthermore we identify several polynomially solvable special cases of this reachability problem, and we also settle the computational complexity of a number of related questions.
Sooner or later each manufacturer, because of the rising level of competition on the market, will have to find a way to decrease the expenses and to increase the profit. Optimization is the way to make that. In this paper optimization of metal masts construction using ANSYS Mechanical and IOSO algorithms will be discussed. Loads are automatically calculated according to the Code of Rules 20.13330.2011 and load*bearing elements are checked for strength and stability according to the Code of Rules 16.13330.2011. After the optimization run a Pareto set is created which allows to manually choose an optimal variant of construction.