5 papers
Anytime Metaheuristic Framework for Global Route Optimization in Expected-Time Mobile Search
Jan Mikula, Miroslav Kulich
Expected-time mobile search (ETS) is a fundamental robotics task where a mobile sensor navigates an environment to minimize the expected time required to locate a hidden object. Gl…
Variable Neighborhood Search for the Electric Vehicle Routing Problem
David Woller, Viktor Kozák, Miroslav Kulich +1
The Electric Vehicle Routing Problem (EVRP) extends the classical Vehicle Routing Problem (VRP) to reflect the growing use of electric and hybrid vehicles in logistics. Due to the…
Optimizing Mesh to Improve the Triangular Expansion Algorithm for Computing Visibility Regions
Jan Mikula, Miroslav Kulich
This paper addresses the problem of improving the query performance of the triangular expansion algorithm (TEA) for computing visibility regions by finding the most advantageous in…
TÅiVis: Versatile, Reliable, and High-Performance Tool for Computing Visibility in Polygonal Environments
Jan Mikula, Miroslav Kulich, Libor PÅeuÄil
Visibility is a fundamental concept in computational geometry, with numerous applications in surveillance, robotics, and games. This software paper presents TÅiVis, a C++ library…
Making a Complete Mess and Getting Away with it: Traveling Salesperson Problems with Circle Placement Variants
David Woller, Masoumeh Mansouri, Miroslav Kulich
This paper explores a variation of the Traveling Salesperson Problem, where the agent places a circular obstacle next to each node once it visits it. Referred to as the Traveling S…