EnRDeA U-Net Deep Learning of Semantic Segmentation on Intricate Noise Roads.

Road segmentation is beneficial to build a vision-controllable mission-oriented self-driving bot, e.g., the Self-Driving Sweeping Bot, or SDSB, for working in restricted areas. Using road segmentation, the bot itself and physical facilities may be protected and the sweeping efficiency of the SDSB promoted. However, roads in the real world are generally exposed to intricate noise conditions as a result of changing weather and climate effects; these include sunshine spots, shadowing caused by trees or physical facilities, traffic obstacles and signs, and cracks or sealing signs resulting from long-term road usage, as well as different types of road materials, such as cement or asphalt; all of these factors greatly influence the effectiveness of road segmentation. In this work, we investigate the extension of Primordial U-Net by the proposed EnRDeA U-Net, which uses an input channel applying a Residual U-Net block as an encoder and an attention gate in the output channel as a decoder, to validate a dataset of intricate road noises. In addition, we carry out a detailed analysis of the nets' features and segmentation performance to validate the intricate noises dataset on three U-Net extensions, i.e., the Primordial U-Net, Residual U-Net, and EnRDeA U-Net. Finally, the nets' structures, parameters, training losses, performance indexes, etc., are presented and discussed in the experimental results.

A high-performance genetic algorithm: using traveling salesman problem as a case.

This paper presents a simple but efficient algorithm for reducing the computation time of genetic algorithm (GA) and its variants. The proposed algorithm is motivated by the observation that genes common to all the individuals of a GA have a high probability of surviving the evolution and ending up being part of the final solution; as such, they can be saved away to eliminate the redundant computations at the later generations of a GA. To evaluate the performance of the proposed algorithm, we use it not only to solve the traveling salesman problem but also to provide an extensive analysis on the impact it may have on the quality of the end result. Our experimental results indicate that the proposed algorithm can significantly reduce the computation time of GA and GA-based algorithms while limiting the degradation of the quality of the end result to a very small percentage compared to traditional GA.