Jan Mikula

14 papers A* 1A 2C 1Journal 7Unranked 3
YearRankTypeTitle / Venue / Authors
2025 J jnl
Anytime Metaheuristic Framework for Global Route Optimization in Expected-Time Mobile Search.
CoRR
Jan Mikula, Miroslav Kulich
2025 J jnl
Optimizing Mesh to Improve the Triangular Expansion Algorithm for Computing Visibility Regions.
CoRR
Jan Mikula, Miroslav Kulich
2024 — conf
Effective Searching for the Honeybee Queen in a Living Colony.
CASE
Jan Blaha, Jan Mikula, Tomás Vintr, Jirí Janota, Jirí Ulrich, Tomás Roucek, Fatemeh Rekabi Bana, Laurenz Alexander Fedotoff, Martin Stefanec, Thomas Schmickl, Farshad Arvin, Miroslav Kulich, Tomás Krajník
2024 J jnl
Hybrid Filtering Heuristic for the Sensor-Placement Problem to Discretize 2D Continuous Environments.
CoRR
Jan Mikula, Miroslav Kulich
2024 J jnl
Optimizing Mesh to Improve the Triangular Expansion Algorithm for Computing Visibility Regions.
SN Comput. Sci.
Jan Mikula, Miroslav Kulich
2024 A conf
Toward Perpetual Occlusion-Aware Observation of Comb States in Living Honeybee Colonies.
IROS
Jan Blaha, Tomás Vintr, Jan Mikula, Jirí Janota, Tomás Roucek, Jirí Ulrich, Fatemeh Rekabi Bana, Laurenz Alexander Fedotoff, Martin Stefanec, Thomas Schmickl, Farshad Arvin, Miroslav Kulich, Tomás Krajník
2024 A conf
TřiVis: Versatile, Reliable, and High-Performance Tool for Computing Visibility in Polygonal Environments.
IROS
Jan Mikula, Miroslav Kulich, Libor Preucil
2024 J jnl
TřiVis: Versatile, Reliable, and High-Performance Tool for Computing Visibility in Polygonal Environments.
CoRR
Jan Mikula, Miroslav Kulich, Libor Preucil
2023 A* conf
Towards Visual Classification Under Class Ambiguity.
ICRA
Viktor Kozák, Jan Mikula, Lukás Bertl, Karel Kosnar, Libor Preucil
2022 — conf
A Metaheuristic Approach for Inspection and Reconnaissance of Organized Areas.
MESAS
David Zahrádka, Jan Mikula, Miroslav Kulich
2022 — conf
On the Travelling Salesman Problem with Neighborhoods in a Polygonal World.
CLAWAR
Miroslav Kulich, Jan Vidasic, Jan Mikula
2022 J jnl
Solving the traveling delivery person problem with limited computational time.
Central Eur. J. Oper. Res.
Jan Mikula, Miroslav Kulich
2022 J jnl
Towards a Continuous Solution of the $d$-Visibility Watchman Route Problem in a Polygon With Holes.
IEEE Robotics Autom. Lett.
Jan Mikula, Miroslav Kulich
2022 C conf
Triangular Expansion Revisited: Which Triangulation Is The Best?
ICINCO
Jan Mikula, Miroslav Kulich