Search

This paper addresses the challenge of identifying the paths for vessels with operating routes of repetitive paths, partially repetitive paths, and new paths. We propose a spatial clustering approach for labeling the vessel paths by using only position information. We develop a path clustering framework employing two methods: a distance-based path modeling and a likelihood estimation method. The former enhances the accuracy of path clustering through the integration of unsupervised machine learning techniques, while the latter focuses on likelihood-based path modeling and introduces segmentation for a more detailed analysis. The result findings highlight the superior performance and efficiency of the developed approach, as both methods for clustering vessel paths into five clusters achieve a perfect F1-score. The approach aims to offer valuable insights for route planning, ultimately contributing to improving safety and efficiency in maritime transportation.

In urban settings, the prevalence of traffic lights often leads to fluctuations in traffic patterns and increased energy utilization among vehicles. Recognizing this challenge, this research addresses the adverse effects of traffic lights on the energy efficiency of electric vehicles (EVs) through the introduction of a Multi-Intersections-Based Eco-Approach and Departure strategy (M-EAD). This innovative strategy is designed to enhance various aspects of urban mobility, including vehicle energy efficiency, traffic flow optimization, and battery longevity, all while ensuring a satisfactory driving experience. The M-EAD strategy unfolds in two distinct stages: First, it optimizes eco-friendly green signal windows at traffic lights, with a primary focus on minimizing travel delays by solving the shortest path problem. Subsequently, it employs a receding horizon framework and leverages an iterative dynamic programming algorithm to refine speed trajectories. The overarching objective is to curtail energy consumption and reduce battery wear by identifying the optimal speed trajectory for EVs in urban environments. Furthermore, the research substantiates the real-world efficacy of this approach through on-road vehicle tests, attesting to its viability and practicality in actual road scenarios. In the proposed case, the simulation results showcase notable achievements, with energy consumption reduced by 0.92% and battery wear minimized to a mere 0.0017%. This research, driven by the pressing issue of urban traffic energy efficiency, not only presents a solution in the form of the M-EAD strategy but also contributes to the fields of sustainable urban mobility and EV performance optimization. By tackling the challenges posed by traffic lights, this work offers valuable insights and practical implications for improving the sustainability and efficiency of urban transportation systems.

In classification problems, as the number of classes increases, correctly classifying a new instance into one of them is assumed to be more challenging than making the same decision in the presence of fewer classes. The essence of the problem is that using the learning algorithm on each decision boundary individually is better than using the same learning algorithm on several of them simultaneously. However, why and when it happens is still not well-understood today. This work’s main contribution is to introduce the concept of heterogeneity of decision boundaries as an explanation of this phenomenon. Based on the definition of heterogeneity of decision boundaries, we analyze and explain the differences in the performance of state of the art approaches to solve multi-class classification. We demonstrate that as the heterogeneity increases, the performances of all approaches, except one-vs-one, decrease. We show that by correctly encoding the knowledge of the heterogeneity of decision boundaries in a decomposition of the multi-class problem, we can obtain better results than state of the art decompositions. The benefits can be an increase in classification performance or a decrease in the time it takes to train and evaluate the models. We first provide intuitions and illustrate the effects of the heterogeneity of decision boundaries using synthetic datasets and a simplistic classifier. Then, we demonstrate how a real dataset exhibits these same principles, also under realistic learning algorithms. In this setting, we devise a method to quantify the heterogeneity of different decision boundaries, and use it to decompose the multi-class problem. The results show significant improvements over state-of-the-art decompositions that do not take the heterogeneity of decision boundaries into account.