News
Selected publications
The Close Enough Traveling Salesman Problem in environment with polygonal obstacles is addressed by an improvement heuristic based on the Mixed Integer Non-Linear Programming (MINLP) model.
A fast heuristics based on the Growing Self-Organizing Array (GSOA) and sampled-based approches to tackle the complex Generalized Traveling Salesman Problem with Neighborhoods (GTSPN).
The non-Euclidean Traveling Salesman Problem with Neighborhoods on a Sphere (TSPNS) is motivated by practical scenarios of employing unmanned aerial vehicles in the reflectance transformation imaging (RTI). We propose an unsupervised learning of the Growing Self-Organizing Array (GSOA) and fast post-processing procedure.
About
Jindřiška Deckerová
PhD student at the CTU in Prague.
Focus on routing and multi-goal path planning.
I am 2nd year PhD student at the Czech Technical University in Prague. I work in the Computational Robotics Laboratory with the Articial Inteligence Center in Faculty of Electrical Engineer. My main focus is on the routing problems, the optimal solution of these problems and solution in dynamic environments.
Besides, one of my hobbies is popularization of science. I have a podcast with my friend Míša called věda bez cenzury where we talk about doctorate studies, academia, and science.