Path Planning for Process Modelling in Chemical Engineering
16th International Conference on Computer Modelling and Simulation: UKSIM '14 Proceedings 2014
Edvards Valbahs, Iljo Dreijers, Peteris Grabusts

Usually, when the practical motion planning and the shortest path are discoursed, mainly the limited number of tasks is observed. Almost all the tasks associated with the path from one point in 2D or 3D space to another point can be attributed to the usual issue in the practical application. Motion planning and the shortest path have vivid and indisputable importance as human activity in such areas as logistics and robotics. In our work we would like to draw particular attention to the field of application seems to be unnoticeable for the task such as motion planning and the shortest path problem. Due to quite simple examples used, we would like to show that the task of motion planning can be used for simulation and optimization of multi-staged and restricted processes which are presented in chemical engineering accordingly. In the article the simulation and optimization of two important chemical-technological processes for the chemical industry are discussed. The work done gave us the possibility to work out software for simulation and optimization of processes that in some cases facilitates and simplifies the work of professionals engaged in the field of chemical engineering.


Keywords
Travelling salesman problem; Simulated Annealing; path planning; chemical engineering
DOI
10.1109/UKSim.2014.18
Hyperlink
http://uksim.info/uksim2014/CD+ToC.pdf

Valbahs, E., Dreijers, I., Grabusts, P. Path Planning for Process Modelling in Chemical Engineering. In: 16th International Conference on Computer Modelling and Simulation: UKSIM '14 Proceedings, United Kingdom, Cambridge, 26-28 March, 2014. Cambridge: Cambridge University, 2014, pp.195-199. ISBN 978-1-4799-4922-9. Available from: doi:10.1109/UKSim.2014.18

Publication language
English (en)
The Scientific Library of the Riga Technical University.
E-mail: uzzinas@rtu.lv; Phone: +371 28399196