Multifactorial Evolutionary Algorithm For Clustered Minimum Routing Cost Problem

Minimum Routing Cost Clustered Tree Problem (CluMRCT) is applied in various fields in both theory and application. Because the CluMRCT is NP-Hard, the approximate approaches are suitable to find the solution for this problem. Recently, Multifactorial Evolutionary Algorithm (MFEA) has emerged as one of the most efficient approximation algorithms to deal with many different kinds of problems. Therefore, this paper studies to apply MFEA for solving CluMRCT problems. In the proposed MFEA, we focus on crossover and mutation operators which create a valid solution of CluMRCT problem in two levels: first level constructs spanning trees for graphs in clusters while the second level builds a spanning tree for connecting among clusters. To reduce the consuming resources, we will also introduce a new method of calculating the cost of CluMRCT solution. The proposed algorithm is experimented on numerous types of datasets. The experimental results demonstrate the effectiveness of the proposed algorithm, partially on large instance

Vehicle agile maneuvering:From rally drivers to a finite state machine approach

Rally drivers can perform extreme maneuvers and keep a vehicle on track by maximizing the vehicle agility. It is remarkable that this is achieved robustly, without a vehicle or tire model in mind. In this study, the Moment Method Diagram and Beta Method representations are used to show the maximum achievable yaw moment generated by the front and rear tires. A new maneuverability map is proposed to bypass the limitations imposed by the steady-state assumptions, based on the wheel slip - yaw moment representation. Furthermore, a simple driving automation strategy is developed to determine the sequence of inputs required for maximizing vehicle agility and negotiating extreme maneuvers. A finite state machine is designed and implemented using a two track vehicle model. The numerical results show that the finite state machine can resemble a rally driver

Повышение точности прогнозирования генерации фотоэлектрических станций на основе алгоритмов k-средних и k-ближайших соседей

Renewable energy sources (RES) are seen as a means of the fuel and energy complex carbon footprint reduction but the stochastic nature of generation complicates RES integration with electric power systems. Therefore, it is necessary to develop and improve methods for forecasting of the power plants generation using the energy of the sun, wind and water flows. One of the ways to improve the accuracy of forecast models is a deep analysis of meteorological conditions as the main factor affecting the power generation. In this paper, a method for adapting of forecast models to the meteorological conditions of photovoltaic stations operation based on machine learning algorithms was proposed and studied. In this case, unsupervised learning is first performed using the k-means method to form clusters. For this, it is also proposed to use studied the feature space dimensionality reduction algorithm to visualize and estimate the clustering accuracy. Then, for each cluster, its own machine learning model was trained for generation forecasting and the k-nearest neighbours algorithm was built to attribute the current conditions at the model operation stage to one of the formed clusters. The study was conducted on hourly meteorological data for the period from 1985 to 2021. A feature of the approach is the clustering of weather conditions on hourly rather than daily intervals. As a result, the mean absolute percentage error of forecasting is reduced significantly, depending on the prediction model used. For the best case, the error in forecasting of a photovoltaic plant generation an hour ahead was 9 %.Возобновляемые источники энергии рассматриваются как средство снижения углеродного следа топливно-энергетического комплекса, при этом стохастический характер генерации осложняет их интеграцию с электроэнергетическими системами. Эта существенная трудность обусловливает необходимость создавать и совершенствовать методы прогнозирования генерации электрических станций, использующих энергию солнца, ветра и водных потоков. Наиболее важным направлением, обеспечивающим повышение точности прогнозных моделей, является глубокий анализ метеорологических условий как главного фактора, влияющего на выработку электроэнергии. В данной работе предложен и исследован метод адаптации прогнозных моделей под метеорологические условия работы фотоэлектрических станций на базе алгоритмов машинного обучения. При этом вначале выполняется обучение без учителя методом k-средних для формирования кластеров. Для этой задачи также предложено и исследовано использование алгоритма понижения размерности пространства признаков для визуализации оценки точности кластеризации. Затем для каждого кластера построена своя модель машинного обучения для формирования прогнозов и алгоритм k-ближайших соседей для отнесения текущих условий на этапе эксплуатации модели к одному из сформированных кластеров. Исследование было проведено на почасовых метеорологических данных за период с 1985 по 2021 г. Одной из особенностей этого подхода является кластеризация метеоусловий на часовых, а не суточных интервалах. В результате средний модуль относительной ошибки прогнозирования существенно снижается в зависимости от используемой модели прогнозирования. Для наилучшего варианта ошибка прогнозирования генерации фотоэлектрической станции на час вперед составила 9 %

Hybrid system to analyze user's behaviour

The evolution of ambient intelligence systems has allowed for the development of adaptable systems. These systems trace user's habits in an automatic way and act accordingly, resulting in a context aware system. The goal is to make these systems adaptable to the user's environment, without the need for their direct interaction. This paper proposes a system that can learn from users' behavior. In order for the system to perform effectively, an adaptable multi agent system is proposed and the results are compared with the use of several classifiers

Повышение точности прогнозирования генерации фотоэлектрических станций на основе алгоритмов k-средних и k-ближайших соседей

Возобновляемые источники энергии рассматриваются как средство снижения углеродного следа топливно-энергетического комплекса, при этом стохастический характер генерации осложняет их интеграцию с электроэнергетическими системами. Эта существенная трудность обусловливает необходимость создавать и совершенствовать методы прогнозирования генерации электрических станций, использующих энергию солнца, ветра и водных потоков. Наиболее важным направлением, обеспечивающим повышение точности прогнозных моделей, является глубокий анализ метеорологических условий как главного фактора, влияющего на выработку электроэнергии. В данной работе предложен и исследован метод адаптации прогнозных моделей под метеорологические условия работы фотоэлектрических станций на базе алгоритмов машинного обучения. При этом вначале выполняется обучение без учителя методом k-средних для формирования кластеров. Для этой задачи также предложено и исследовано использование алгоритма понижения размерности пространства признаков для визуализации оценки точности кластеризации. Затем для каждого кластера построена своя модель машинного обучения для формирования прогнозов и алгоритм k-ближайших соседей для отнесения текущих условий на этапе эксплуатации модели к одному из сформированных кластеров. Исследование было проведено на почасовых метеорологических данных за период с 1985 по 2021 г. Одной из особенностей этого подхода является кластеризация метеоусловий на часовых, а не суточных интервалах. В результате средний модуль относительной ошибки прогнозирования существенно снижается в зависимости от используемой модели прогнозирования. Для наилучшего варианта ошибка прогнозирования генерации фотоэлектрической станции на час вперед составила 9 %

The Extent and Coverage of Current Knowledge of Connected Health: Systematic Mapping Study

Background: This paper examines the development of the Connected Health research landscape with a view on providing a historical perspective on existing Connected Health research. Connected Health has become a rapidly growing research field as our healthcare system is facing pressured to become more proactive and patient centred. Objective: We aimed to identify the extent and coverage of the current body of knowledge in Connected Health. With this, we want to identify which topics have drawn the attention of Connected health researchers, and if there are gaps or interdisciplinary opportunities for further research. Methods: We used a systematic mapping study that combines scientific contributions from research on medicine, business, computer science and engineering. We analyse the papers with seven classification criteria, publication source, publication year, research types, empirical types, contribution types research topic and the condition studied in the paper. Results: Altogether, our search resulted in 208 papers which were analysed by a multidisciplinary group of researchers. Our results indicate a slow start for Connected Health research but a more recent steady upswing since 2013. The majority of papers proposed healthcare solutions (37%) or evaluated Connected Health approaches (23%). Case studies (28%) and experiments (26%) were the most popular forms of scientific validation employed. Diabetes, cancer, multiple sclerosis, and heart conditions are among the most prevalent conditions studied. Conclusions: We conclude that Connected Health research seems to be an established field of research, which has been growing strongly during the last five years. There seems to be more focus on technology driven research with a strong contribution from medicine, but business aspects of Connected health are not as much studied

Non-dimensional Star-Identification

This study introduces a new "Non-Dimensional" star identification algorithm to reliably identify the stars observed by a wide field-of-view star tracker when the focal length and optical axis offset values are known with poor accuracy. This algorithm is particularly suited to complement nominal lost-in-space algorithms, which may identify stars incorrectly when the focal length and/or optical axis offset deviate from their nominal operational ranges. These deviations may be caused, for example, by launch vibrations or thermal variations in orbit. The algorithm performance is compared in terms of accuracy, speed, and robustness to the Pyramid algorithm. These comparisons highlight the clear advantages that a combined approach of these methodologies provides.Comment: 17 pages, 10 figures, 4 table

Analysing the Impact of Rationality on the Italian Electricity Market

International audienceWe analyze the behavior of the Italian electricity market with an agent-based model. In particular, we are interested in testing the assumption that the market participants are fully rational in the economical sense. To this aim, we extend a previous model by considering a wider class of cases. After checking that the new model is a correct generalization of the existing model, we compare three optimization methods to implement the agents rationality and we verify that the model exhibits a very good fit to the real data. This leads us to conclude that our model can be used to predict the behavior of this market