Jan Mikula

Tel: +420-2-2435-4249  ORCID: 0000-0003-3404-8742
E-mail: jan.mikula@cvut.cz  Jan Mikula at ResearchGate
Room: CIIRC B-324  Jan Mikula at LinkedIn





Member Of   Intelligent and Mobile Robotics (IMR), CIIRC, CTU in Prague,
Department of Cybernetics, FEE, CTU
Position   Ph.D. Candidate in Computer Science; Researcher and Software Engineer
Research Interests   Mobile Robot Inspection & Search; Planning in Mobile Robotics;
Combinatorial Optimization; Metaheuristics; Computational Geometry; Artificial Intelligence
Current Projects   Time-Efficient Planning for Mobile Robot Inspection & Search (PhD Thesis);
DiPreFe—Diagnostic of Photovoltaic Power Plants by Autonomous Means (2020-2024)
Past Projects   I-Nav—Navigation System for Industrial Mobile Robots (2021-2022);
Anomaly Detection and Classification (2021)
Education   2021 Ing. (MSc equiv.) With Honours/Distinction in Cybernetics and Robotics; FEE, CTU
   Master's Thesis: Search for a static object in a known environment (Dean Award)
2018 Bc. (BSc equiv.) in Systems and Control, Cybernetics and Robotics; FEE, CTU
   Bachelor's Thesis: Meta-heuristics for routing problems (Dean Award)





  Publications

   Journal Articles

  • Mikula, J., & Kulich, M. (2022). Towards a Continuous Solution of the d-Visibility Watchman Route Problem in a Polygon With Holes. IEEE Robotics and Automation Letters, vol. 7, no. 3, pp. 5934-5941.
    • doi: 10.1109/LRA.2022.3159824
    • About   PDF   URL   BibTeX
      @ARTICLE{Mikula2022ral,
  author={Mikula, Jan and Kulich, Miroslav},
  doi={10.1109/LRA.2022.3159824},
  issn={2377-3766},
  journal={IEEE Robotics and Automation Letters}, 
  number={3},
  title={Towards a Continuous Solution of the d-Visibility Watchman Route Problem in a Polygon With Holes}, 
  pages={5934--5941},
  title={{Towards a Continuous Solution of the $d$-Visibility Watchman Route Problem in a Polygon With Holes}},
  url={https://ieeexplore.ieee.org/document/9736678/},
  volume={7},
  year={2022},
}
  • Mikula, J., & Kulich, M. (2022). Solving the traveling delivery person problem with limited computational time. Central European Journal of Operations Research.
    • doi: 10.1007/s10100-021-00793-y
    • About   Download Code   PDF   EPDF   URL   BibTeX
      @ARTICLE{Mikula2022cejor,
  author={Mikula, Jan and Kulich, Miroslav},
  doi={10.1007/s10100-021-00793-y},
  issn = {1435-246X},
  journal={Central European Journal of Operations Research},
  publisher = {Springer Berlin Heidelberg},
  title={{Solving the traveling delivery person problem with limited computational time}},
  url={https://link.springer.com/10.1007/s10100-021-00793-y},
  year={2022}
}

   Conference Papers

  • Mikula, J., & Kulich, M. (2022). Triangular Expansion Revisited: Which Triangulation Is The Best? Proceedings of the 19th International Conference on Informatics in Control, Automation and Robotics - ICINCO, pp. 313-319.
    • doi: 10.5220/0011278700003271
    • About   URL   BibTeX
      @CONFERENCE{Mikula2022icinco,
  author={Mikula, Jan and Kulich, Miroslav},
  booktitle={Proceedings of the 19th International Conference on Informatics in Control, Automation and Robotics - ICINCO},
  doi={10.5220/0011278700003271},
  isbn={978-989-758-585-2},
  issn={2184-2809},
  organization={INSTICC},
  pages={313--319},
  publisher={SCITEPRESS - Science and Technology Publications},
  title={{Triangular Expansion Revisited: Which Triangulation Is The Best?}},
  url={https://www.scitepress.org/DigitalLibrary/Link.aspx?doi=10.5220/0011278700003271},
  year={2022}
}
    • Nominated for the Best Student Paper Award
Page last modified on April 02, 2023, at 02:06 PM EST
Powered by PmWiki