In this paper, we incorporate a local search procedure into a micro differential evolution algorithm MED with the aim of solving the HappyCat function. Our purpose is to find out if our proposal is more competitive than a Ray-ES algorithm. We test our micro Differential Evolution algorithm (µDE) on HappyCat and HGBat functions. The results that we obtained with micro-DE are better compared with the results the original RayES reference algorithm. This analysis supports our conjecture that a reduced population DE hybridized with a local search (Ray search) is a key combination in dealing with this function. Our results support the hypothesis that a well-focused micro population is more accurate and efficient than existing techniques, representing (that of micro-algorithms) a serious competitor because of its efficiency and accuracy. In fact, the proposed (but never solved) HGBat function can be dealt with, showing the scalability and potential future uses of our technique.

A new bio-inspired meta-heuristic, called the micro artificial immune system (MAIS), has been developed in order to reduce the rates of pollution for a specific region of Mexico City through the optimization of vehicular flow. Simulation of urban mobility (SUMO) was used to simulate the effects of the programming of the traffic lights obtained by the MAIS. Currently, pollution and travel times from one place to another are increasing due to the number of inhabitants that live in big cities, which has generated a decrease in people’s quality of life. Hence, we propose the optimization of the programming of the sequences of traffic lights through this bio-inspired meta-heuristic. The obtained results show that the MAIS outperforms most of the algorithms tested in this research.

Robots able to roll and jump are used to solve complex trajectories. These robots have a low level of autonomy, and currently, only teleoperation is available. When researching the literature about these robots, limitations were found, such as a high risk of damage by testing, lack of information, and nonexistent tools. Therefore, the present research is conducted to minimize the dangers in actual tests, increase the documentation through a platform repository, and solve the autonomous trajectory of a maze with obstacles. The methodology consisted of: replicating a scenario with the parrot robot in the gazebo simulator; then the computational resources, the mechanism, and the available commands of the robot were studied; subsequently, it was determined that the genetic micro-algorithm met the minimum requirements of the robot; in the last part, it was programmed in simulation and the solution was validated in the natural environment. The results were satisfactory and it was possible to create a parrot robot in a simulation environment analogous to the typical specifications. The genetic micro-algorithm required only 100 generations to converge; therefore, the demand for computational resources did not affect the execution of the essential tasks of the robot. Finally, the maze problem could be solved autonomously in a real environment from the simulations with an error of less than 10% and without damaging the robot.

In this work a new method to retrieve images with similar lighting conditions is presented. It is based on automatic clustering and automatic indexing. Our proposal belongs to Content Based Image Retrieval (CBIR) category. The goal is to retrieve from a database, images (by their content) with similar lighting conditions. When we look at images taken from outdoor scenes, much of the information perceived depends on the lighting conditions. The proposal combines fixed and random extracted points for feature extraction. The describing features are the mean, the standard deviation and the homogeneity (from the co-occurrence matrix) of a sub-image extracted from the three color channels: (H, S, I). A K-MEANS algorithm and a 1-NN classifier are used to build an indexed database of 300 images in order to retrieve images with similar lighting conditions applied on sky regions such as: sunny, partially cloudy and completely cloudy. One of the advantages of the proposal is that we do not need to manually label the images for their retrieval. The performance of our framework is demonstrated through several experimental results, including the improved rates for images retrieval with similar lighting conditions. A comparison with another similar work is also presented.

This paper presents a markerless augmented reality (AR) navigation system for guiding users across a university campus, independent of internet or wireless connectivity, integrating machine learning (ML) and deep learning techniques. The system employs computer vision to detect campus signage “Meeting Point” and “Directory”, and classifies them through a binary classifier (BC) and convolutional neural networks (CNNs). The BC distinguishes between the two types of signs using RGB values with algorithms such as Perceptron, Bayesian classification, and k-Nearest Neighbors (KNN), while the CNN identifies the specific sign ID to link it to a campus location. Navigation routes are generated with the Floyd–Warshall algorithm, which computes the shortest path between nodes on a digital campus map. Directional arrows are then overlaid in AR on the user’s device via ARCore, updated every 200 milliseconds using sensor data and direction vectors. The prototype, developed in Android Studio, achieved over 99.5% accuracy with CNNs and 100% accuracy with the BC, even when signs were worn or partially occluded. A usability study with 27 participants showed that 85.2% successfully reached their destinations, with more than half rating the system as easy or very easy to use. Users also expressed strong interest in extending the application to other environments, such as shopping malls or airports. Overall, the solution is lightweight, scalable, and sustainable, requiring no additional infrastructure beyond existing campus signage.