Welcome to the website of the Artificial Intelligence Laboratory at the Department of Informatics and Artificial Intelligence of the Faculty of Applied Informatics of Tomas Bata University in Zlin.


Ph.D. study opportunities in A.I.Lab:

Interested in studying your Ph.D. in A.I.lab? Head to the Thesis topics section and start your career in Artificial Intelligence today!


Research spotlight:

PDF

Context matters in LLM-driven algorithm design: A controlled study in black-box optimization

Adam Viktorin, Tomas Martinek, Zuzana Kominkova Oplatkova, Roman Senkerik, Jozef Kovac, Tomas Kadavy

Computer Science Review, February 2027, 101079, Volume 63, Part A

Large language models (LLMs) can turn task descriptions into executable algorithms. Coupled with automatic evaluation, this creates an appealing end-user workflow: an engineer can state a computational problem and guide candidate design without first becoming an expert in the relevant algorithmic field. The practical question is what information from earlier generations should be returned to the model.
We investigate this question with EASE (Effortless Algorithmic Solution Evolution), using problem-specific black-box optimizer generation as a controlled case study. Twelve strategies vary whether the prompt includes recent algorithms, high-performing algorithms, their combinations, or no earlier outputs. The strategies are evaluated with Gemini 3 Pro, GPT-5.2, and Claude Opus 4.6 on a difficult 30-dimensional GNBG-II benchmark instance.
The observed ranking of individual strategies differs across model configurations, but analysis of the underlying context factors reveals a more consistent descriptive pattern. Combining the most recent candidate with the best-performing candidate yields lower mean repetition-best scores than using either component alone for all three evaluated models. In contrast, increasing the amount of recent or performance-selected context does not show a consistent additional benefit across models. The results therefore favor selective context construction over simply maximizing the amount of previous information supplied to the model. The largest improvements also tend to occur during the early generations, while substantial variation remains across repetitions and model configurations.
Because the experiment is restricted to a single benchmark instance and five independent repetitions per model–strategy cell, the comparisons are interpreted descriptively and do not establish a universal context strategy or transfer across optimization problems. Within this controlled setting, however, the results indicate that recency and performance-based selection can provide complementary feedback signals, whereas larger contexts are not consistently advantageous.
An interactive result explorer is available at https://tbu-ailab.github.io/PaperContext/; generated data and source files are available at https://github.com/TBU-AILab/PaperContext.

Cite as:

Viktorin, A., Martinek, T., Oplatkova, Z. K., Senkerik, R., Kovac, J., & Kadavy, T. (2027). Context matters in LLM-driven algorithm design: A controlled study in black-box optimization. Computer Science Review, 63, 101079.
PDF

Artificial Size Slicing Aided Fine Tuning (ASSAFT) and Hyper Inference (ASSAHI) in tomato detection

Alžběta Turečková,Tomáš Tureček, Zuzana Komínková Oplatková

Computers and Electronics in Agriculture, Volume 225,October 2024, 109280

In the realm of precision agriculture, accurate harvest prediction is vital, as any discrepancies between forecasted and actual yields can lead to significant commercial and logistical challenges. This paper presents a novel deep learning-based approach for detecting and counting tomato fruits using advanced computer vision techniques. Building upon our previously established framework for ultra-wide image acquisition, this approach focuses on a unique patch-cropping technique tailored to tomatoes. This method aligns with the natural clustering of tomatoes, significantly improving object detection in greenhouse settings and thereby enhancing the model’s performance in identifying individual fruits. The detection results exhibit a precision of 0.85, a recall of 0.93, and an F1-score of 0.89. Our approach’s efficacy is also demonstrated through a case study on harvest prediction in a tomato greenhouse. The proposed methodology exhibited a lower error rate than the agronomist’s estimates and proved its practical applicability. These findings suggest that our methodology could substantially contribute to optimizing sustainable farming practices, offering a promising direction for future research and application in the agricultural sector.

Cite as:

Turečková, A., Tureček, T., & Oplatková, Z. K. (2024). Artificial Size Slicing Aided Fine Tuning (ASSAFT) and Hyper Inference (ASSAHI) in tomato detection. Computers and Electronics in Agriculture, 225, 109280.
PDF

Evolutionary Optimized 3D WiFi Antennas Manufactured via Laser Powder Bed Fusion

Dominik Mair, Michael Renzler, Stanislav Kovar, Tomas Martinek, Tomas Kadavy, Simon Bergmueller, Andrada Horn, Jakob Braun, Lukas Kaserer

IEEE Access, vol. 11, 2023

The swift and automated design of antennas remains a challenging aspect in research due to the specific design needs for individual applications. Alterations in resonance frequency or boundary conditions necessitate time-consuming re-designs. Though the application of evolutionary optimization and generative methods in general to antenna design has seen success, it has been mostly restricted to two-dimensional structures. In this work, we present an approach for designing three-dimensional antennas using a genetic algorithm coupled with a region-growing algorithm – to ensure manufacturability – implemented in Matlab manufactured via laser powder bed fusion (LPBF). As a simulation tool for optimization CST is used. The antenna has been optimized in a completely automated manner and was produced using the metal 3D printing technology LPBF and aluminium based AlSi10Mg powder. The presented concept, which builds upon previous two-dimensional techniques, allows for significant flexibility in design, adapting to changing boundary conditions, and avoiding the geometric restrictions seen in prior methods. The optimized antenna has a size of 3.01cm×3.43cm×1.67cm and was measured in an anechoic chamber. According to measurements a minimum reflection coefficient of −19.95dB at 2.462 G Hz and a bandwidth of 308.8 M Hz are observed. CST simulation results predict an efficiency of 98.91 % and the maximum antenna gain is measured at 2.45 G Hz to be 3.27 dBi . Simulations made with CST and Ansys HFSS and measurements are in excellent agreement with a deviation of the resonance frequency of only 0.13 % , thus further establishing genetic algorithms as a highly viable option for the design of novel antenna structures.

Cite as:

Mair, D., Renzler, M., Kovar, S., Martinek, T., Kadavy, T., Bergmueller, S., … & Kaserer, L. (2023). Evolutionary optimized 3d wifi antennas manufactured via laser powder bed fusion. IEEE Access, 11, 121914-121923.
PDF

Impact of Boundary Control Methods on Bound-Constrained Optimization Benchmarking

Tomas Kadavy, Adan Viktorin, Anezka Kazikova, Michal Pluhacek, Roman Senkerik

IEEE Transactions on Evolutionary Computation Volume: 26, Issue: 6, December 2022

Benchmarking various metaheuristics and their new enhancements, strategies, and adaptation mechanisms has become standard in computational intelligence research. Recently, many challenges and issues regarding fair comparisons and recommendations toward good practices for benchmarking of metaheuristic algorithms, have been identified. This article is aimed at an important issues in metaheuristics design and benchmarking, which are boundary strategies or boundary control methods (BCMs). This work aims to investigate whether the choice of a BCM could significantly influence the performance of competitive algorithms. The experiments encompass the top three performing algorithms from IEEE CEC competitions 2017 and 2020 with six different BCMs. We provide extensive statistical analysis and rankings resulting in conclusions and recommendations for metaheuristics researchers and possibly also for the future direction of benchmark definitions. We conclude that the BCM should be considered another vital metaheuristics input variable for unambiguous reproducibility of results in benchmarking and for a better understanding of population dynamics, since the BCM setting could impact the optimization method performance.

Cite as:

Kadavy, T., Viktorin, A., Kazikova, A., Pluhacek, M., & Senkerik, R. (2022). Impact of boundary control methods on bound-constrained optimization benchmarking. IEEE Transactions on Evolutionary Computation.

PDF

Slicing aided large scale tomato fruit detection and counting in 360-degree video data from a greenhouse

Alžběta Turečková, Tomáš Tureček, Peter Janků, Pavel Vařacha, Roman Šenkeřík, Roman Jašek, Václav Psota, Vit Štěpánek, Zuzana Komínková Oplatková

Measurement, Volume 204, 30 November 2022, 111977

This paper proposes an automated tomato fruit detection and counting process without a need for any human intervention. First of all, wide images of whole tomato plant rows were extracted from a 360-degree video taken in a greenhouse. These images were utilized to create a new object detection dataset. The original tomato detection methodology uses a deep CNN model with slicing-aided inference. The process encompasses two stages: first, the images are cut into patches for object detection, and consequently, the predictions are stitched back together. The paper also presents an extensive study of post-processing parameters needed to stitch object detections correctly, especially on the patch’s borders. Final results reach 83.09% F1 score value on a test set, proving the suitability of the proposed methodology for robotic farming.

Cite as:

Turečková, A., Tureček, T., Janků, P., Vařacha, P., Šenkeřík, R., Jašek, R., … & Oplatková, Z. K. (2022). Slicing aided large scale tomato fruit detection and counting in 360-degree video data from a greenhouse. Measurement, 204, 111977.

PDF
(Open Access)

How Does the Number of Objective Function Evaluations Impact Our Understanding of Metaheuristics Behavior?

Anezka Kazikova, Michal Pluhacek, Roman Senkerik

IEEE Access, Volume: 9, 2021

Comparing various metaheuristics based on an equal number of objective function evaluations has become standard practice. Many contemporary publications use a specific number of objective function evaluations by the benchmarking sets definitions. Furthermore, many publications deal with the recurrent theme of late stagnation, which may lead to the impression that continuing the optimization process could be a waste of computational capabilities. But is it? Recently, many challenges, issues, and questions have been raised regarding fair comparisons and recommendations towards good practices for benchmarking metaheuristic algorithms. The aim of this work is not to compare the performance of several well-known algorithms but to investigate the issues that can appear in benchmarking and comparisons of metaheuristics performance (no matter what the problem is). This article studies the impact of a higher evaluation number on a selection of metaheuristic algorithms. We examine the effect of a raised evaluation budget on overall performance, mean convergence, and population diversity of selected swarm algorithms and IEEE CEC competition winners. Even though the final impact varies based on current algorithm selection, it may significantly affect the final verdict of metaheuristics comparison. This work has picked an important benchmarking issue and made extensive analysis, resulting in conclusions and possible recommendations for users working with real engineering optimization problems or researching the metaheuristics algorithms. Especially nowadays, when metaheuristic algorithms are used for increasingly complex optimization problems, and meet machine learning in AutoML frameworks, we conclude that the objective function evaluation budget should be considered another vital optimization input variable.

Cite as:

A. Kazikova, M. Pluhacek and R. Senkerik, „How Does the Number of Objective Function Evaluations Impact Our Understanding of Metaheuristics Behavior?,“ in IEEE Access, vol. 9, pp. 44032-44048, 2021, DOI: 10.1109/ACCESS.2021.3066135.