This paper models a platooning system consisting of trucks and a third-party service provider (TPSP), which performs platoon coordination, distributes the platooning profit in platoons, and charges trucks in exchange for the services. Government subsidies used to incentivize platooning are also considered. We propose a pricing rule for the TPSP, which keeps part of the platooning profit including the subsidy each time a platoon is formed. In addition, a platoon coordination solution based on the distributed model predictive control (MPC) is proposed, in which the pricing rule under government subsidies is integrated. We perform a realistic simulation over the Swedish road network to evaluate the impact of the pricing rule and subsidies on the achieved profits and fuel savings. Our results show that subsidies are an effective mean to boost fuel savings from platooning. Moreover, the simulation study indicates that high pricing corresponds to a low platooning rate of the system, as trucks' incentives for platooning decrease.

In this work, we address the problem of charging coordination between electric trucks and charging stations. The problem arises from the tension between the trucks’ nontrivial charging times and the stations’ limited charging facilities. Our goal is to reduce the trucks’ waiting times at the stations while minimizing individual trucks’ operational costs. We propose a distributed coordination framework that relies on computation and communication between the stations and the trucks, and handles uncertainties in travel times and energy consumption. Within the framework, the stations assign a limited number of charging ports to trucks according to the first-come, first-served rule. In addition, each station constructs a waiting time forecast model based on its historical data and provides its estimated waiting times to trucks upon request. When approaching a station, a truck sends its arrival time and estimated arrival-time windows to the nearby station and the distant stations, respectively. The truck then receives the estimated waiting times from these stations in response, and updates its charging plan accordingly while accounting for travel uncertainties. We performed simulation studies for 1,000 trucks traversing the Swedish road network for 40 days, using realistic traffic data with travel uncertainties. The results show that our method reduces the average waiting time of the trucks by 46.1% compared to offline charging plans computed by the trucks without coordination and update, and by 33.8% compared to the coordination scheme assuming zero waiting times at distant stations.

Electric trucks usually need to charge their batteries during long-range delivery missions, and the charging times are often nontrivial. As charging resources are limited, waiting times for some trucks can be prolonged at certain stations. To facilitate the efficient operation of electric trucks, we propose a distributed charging coordination framework. Within the scheme, the charging stations provide waiting estimates to incoming trucks upon request and assign charging ports according to the first-come, first-served rule. Based on the updated information, the individual trucks compute where and how long to charge whenever approaching a charging station in order to complete their delivery missions timely and cost-effectively. We perform empirical studies for trucks traveling over the Swedish road network and compare our scheme with the one where charging plans are computed offline, assuming unlimited charging facilities. It is shown that the proposed scheme outperforms the offline approach at the expense of little communication overhead.

Rapid detection of small objects in remote sensing (RS) images is crucial for intelligence acquisition, for instance, enemy ship detection. Instead of employing images with high resolution, low-resolution images of the same size typically cover a wider area and thus facilitate efficient object detection. However, accurately detecting small objects in such images remains a challenge due to their limited visual information and the difficulty in distinguishing them from the background. To address this issue, we propose a small object detection method called the deeper and stronger feature path aggregation pyramid network (DSFPAP-Net) for low-resolution RS images. First, our approach involves designing aggregation networks with deeper paths and utilizing feature layers closer to the shallow layers to enhance the acquisition of information about small objects. Second, to enhance the network's focus on small objects, we propose a resolution-adjustable 3-D weighted attention (RA3-DWA) mechanism. This mechanism enables independent learning of spatial feature information and assigns 3-D weights specifically to small objects, resulting in improved detection accuracy for small objects. Finally, we propose the Fast-EIoU loss function to accelerate the regression of the model boundary. This loss function assigns an acceleration factor to the length loss and width loss, respectively, thereby improving the detection accuracy of small objects. Experiments on Levir-Ship and DOTA demonstrate the effectiveness and efficiency of the proposed method. Compared to the baseline YOLOv5, our method has improved the average detection accuracy of the Levir-Ship dataset by 6.7% (reaching up to 82.6%) and the accuracy of the DOTA dataset by 6.4% (reaching up to 73.7%).

Liver segmentation is a fundamental prerequisite for the diagnosis and surgical planning of hepatocellular carcinoma. Traditionally, the liver contour is drawn manually by radiologists using a slice-by-slice method. However, this process is time-consuming and error-prone, depending on the radiologist's experience. In this paper, we propose a new end-to-end automatic liver segmentation framework, named ResTransUNet, which exploits the transformer's ability to capture global context for remote interactions and spatial relationships, as well as the excellent performance of the original U-Net architecture. The main contribution of this paper lies in proposing a novel fusion network that combines Unet and Transformer architectures. In the encoding structure, a dual-path approach is utilized, where features are extracted separately using both convolutional neural networks (CNNs) and Transformer networks. Additionally, an effective feature enhancement unit is designed to transfer the global features extracted by the Transformer network to the CNN for feature enhancement. This model aims to address the drawbacks of traditional Unet-based methods, such as feature loss during encoding and poor capture of global features. Moreover, it avoids the disadvantages of pure Transformer models, which suffer from large parameter sizes and high computational complexity. The experimental results on the LiTS2017 dataset demonstrate remarkable performance for our proposed model, with Dice coefficients, volumetric overlap error (VOE), and relative volume difference (RVD) values for liver segmentation reaching 0.9535, 0.0804, and −0.0007, respectively. Furthermore, to further validate the model's generalization capability, we conducted tests on the 3Dircadb, Chaos, and Sliver07 datasets. The experimental results demonstrate that the proposed method outperforms other closely related models with higher liver segmentation accuracy. In addition, significant improvements can be achieved by applying our method when handling liver segmentation with small and discontinuous liver regions, as well as blurred liver boundaries. The code is available at the website: https://github.com/Jouiry/ResTransUNet.

Truck platooning is a promising technology that enables trucks to travel in formations with small inter-vehicle distances for improved aerodynamics and fuel economy. The real-world transportation system includes a vast number of trucks owned by different fleet owners, for example, carriers. To fully exploit the benefits of platooning, efficient dispatching strategies that facilitate the platoon formations across fleets are required. This paper presents a distributed framework for addressing multi-fleet platoon coordination in large transportation networks, where each truck has a fixed route and aims to maximize its own fleet's platooning profit by scheduling its waiting times at hubs. The waiting time scheduling problem of individual trucks is formulated as a distributed optimal control problem with continuous decision space and a reward function that takes non-zero values only at discrete points. By suitably discretizing the decision and state spaces, we show that the problem can be solved exactly by dynamic programming, without loss of optimality. Finally, a realistic simulation study is conducted over the Swedish road network with 5,000 trucks to evaluate the profit and efficiency of the approach. The simulation study shows that, compared to single-fleet platooning, multi-fleet platooning provided by our method achieves around 15 times higher monetary profit and increases the CO2 emission reductions from 0.4% to 5.5%. In addition, it shows that the developed approach can be carried out in real-time and thus is suitable for platoon coordination in large transportation systems.

Truck platooning is a well-studied technology that has the potential to reduce both the environmental impact and operational costs of trucks. The technology has matured over the last 20 years, and the commercial rollout of platooning is approaching. Cooperation across carriers is essential for the viability of platooning; otherwise, many platooning opportunities are lost. We first present a cross-carrier platooning system architecture in which many carriers cooperate in forming platoons through a platoon-hailing service. Then, we present a cross-carrier platoon coordination approach in which each carrier optimizes its platooning plans according to the predicted plans of other carriers. A profit-sharing mechanism to even out the platooning profit in each platoon is embedded in the platoon coordination approach. Finally, a simulation study over the Swedish road network is performed to evaluate the potential of platooning under realistic conditions. The simulation study shows that the energy consumption of trucks in Sweden can be reduced by 5.4% due to platooning and that cooperation across carriers is essential to achieve significant platooning benefits.

Liver cancer is one of the leading causes of cancer-related deaths worldwide. Automatic liver and tumor segmentation are of great value in clinical practice as they can reduce surgeons' workload and increase the probability of success in surgery. Liver and tumor segmentation is a challenging task because of the different sizes, shapes, blurred boundaries of livers and lesions, and low-intensity contrast between organs within patients. To address the problem of fuzzy livers and small tumors, we propose a novel Residual Multi-scale Attention U-Net (RMAU-Net) for liver and tumor segmentation by introducing two modules, i.e., Res-SE-Block and MAB. The Res-SE-Block can mitigate the problem of gradient disappearance by residual connection and enhance the quality of representations by explicitly modeling the interdependencies and feature recalibration between the channels of features. The MAB can exploit rich multi-scale feature information and capture inter -channel and inter-spatial relationships of features simultaneously. In addition, a hybrid loss function, that combines focal loss and dice loss, is designed to improve segmentation accuracy and speed up convergence. We evaluated the proposed method on two publicly available datasets, i.e., LiTS and 3D-IRCADb. Our proposed method achieved better performance than the other state-of-the-art methods, with dice scores of 0.9552 and 0.9697 for LiTS and 3D-IRCABb liver segmentation, and dice scores of 0.7616 and 0.8307 for LiTS and 3D-IRCABb liver tumor segmentation.

Freight drivers of electric trucks need to design charging strategies for where and how long to recharge the truck in order to complete delivery missions on time. Moreover, the charging strategies should be aligned with drivers' driving and rest time regulations, known as hours-of-service (HoS) regulations. This letter studies the optimal charging problems of electric trucks with delivery deadlines under HoS constraints. We assume that a collection of charging and rest stations is given along a pre-planned route with known detours and that the problem data are deterministic. The goal is to minimize the total cost associated with the charging and rest decisions during the entire trip. This problem is formulated as a mixed integer program with bilinear constraints, resulting in a high computational load when applying exact solution approaches. To obtain real-time solutions, we develop a rollout-based approximate scheme, which scales linearly with the number of stations while offering solid performance guarantees. We perform simulation studies over the Swedish road network based on realistic truck data. The results show that our rollout-based approach provides near-optimal solutions to the problem in various conditions while cutting the computational time drastically.

We model a platooning system including trucks and a third-party service provider that performs platoon coordination, distributes the platooning profit within platoons, and charges the trucks in exchange for its services. This paper studies one class of pricing rules, where the third-party service provider keeps part of the platooning profit each time a platoon is formed. Furthermore, we propose a platoon coordination solution based on distributed model predictive control in which the pricing rule is integrated. To evaluate the effect of the pricing on the platooning system, we perform a simulation over the Swedish road network. The simulation shows that the platooning rate and profit highly depend on the pricing. This suggests that pricing needs to be set carefully to obtain a satisfactory platooning system in the future.