The rise of edge computing has promoted the development of the industrial internet of things (IIoT). Supported by edge computing technology, data acquisition can also support more complex and perfect application requirements in industrial field. Most of traditional sampling methods use constant sampling frequency and ignore the impact of changes of sampling objects during the data acquisition. For the problem of sampling distortion, edge data redundancy and energy consumption caused by constant sampling frequency of sensors in the IIoT, a data-driven adaptive sampling method based on edge computing is proposed in this paper. The method uses the latest data collected by the sensors at the edge node for linear fitting and adjusts the next sampling frequency according to the linear median jitter sum and adaptive sampling strategy. An edge data acquisition platform is established to verify the validity of the method. According to the experimental results, the proposed method is more effective than other adaptive sampling methods. Compared with constant sampling frequency, the proposed method can reduce the edge data redundancy and energy consumption by more than 13.92% and 12.86%, respectively.

Ultra-wideband (UWB) technology is used for indoor positioning, but its positioning accuracy is usually degenerated by various obstacles in the indoor environment because of non-line-of-sight (NLOS). Facing the complex and changeable indoor environment, an indoor positioning system with UWB based on a digital twin is presented in this paper. The indoor positioning accuracy is improved with a perception–prediction feedback of cyber-physics space in this indoor positioning system. In addition, an anchor layout method with virtuality–reality interaction and an error mitigation method based on neural networks is put forward in this system. Finally, a case study is presented to validate this indoor positioning system with a significant improvement in positioning accuracy.

With the rapid development of e-commerce, the importance of logistics distribution is becoming increasingly prominent. In particular, the last-mile delivery is particularly important because it serves customers directly. Improving customer satisfaction is one of the important factors to ensure the quality of service in delivery and also an important guarantee for improving the market competitiveness of logistics enterprises. In the process of last-mile delivery, flexible delivery locations and variable delivery times are effective means to improve customer satisfaction. Therefore, this paper introduces a Vehicle Routing Problem with flexible time windows and delivery locations, considering customer satisfaction (VRP-CS), which considers customer satisfaction by using prospect theory from two aspects: the flexibility of delivery time and delivery locations. This VRP-CS is formally modeled as a bi-objective optimization problem, which is an NP-hard problem. To solve this problem, a Multi-Strategy Adaptive Large Neighborhood Search (MSALNS) method is proposed. Operators guided by strategies such as backtracking and correlation are introduced to create different neighborhoods for ALNS, thereby enriching search diversity. In addition, an acceptance criterion inspired by simulated annealing is designed to balance exploration and exploitation, helping the algorithm avoid being trapped in local optima. Extensive numerical experiments on generated benchmark instances demonstrate the effectiveness of the VRP-CS model and the efficiency of the proposed MSALNS algorithm. The experiment results on the generated benchmark instances show that the total cost of the VRP-CS is reduced by an average of 14.22% when optional delivery locations are utilized compared to scenarios with single delivery locations.

In recent years, the utilization of dual-arm robots has gained substantial prominence across various industries owing to their collaborative operational capabilities. In order to achieve collision avoidance and facilitate cooperative task completion, efficient path planning plays a pivotal role. The high dimensionality associated with collaborative task execution in dual-arm robots renders existing path planning methods ineffective for conducting efficient exploration. This paper introduces a multi-agent path planning reinforcement learning algorithm that integrates an experience replay strategy, a shortest-path constraint, and the policy gradient method. To foster collaboration and avoid competition between the robot arms, the proposed approach incorporates a mechanism known as “reward cooperation, punishment competition” during the training process. Our algorithm demonstrates strong performance in the control of dual-arm robots and exhibits the potential to mitigate the challenge of reward sparsity encountered during the training process. The effectiveness of the proposed algorithm is validated through simulations and experiments, comparing the results with existing methods and showcasing its superiority in dual-arm robot path planning.

With the increasingly busy transportation of cargo at container terminals (CTs), the requirements for terminal throughput and operational efficiency are constantly increasing. The operational efficiency and cost of CTs are closely related to the seamless docking of terminal facilities, especially the joint operation between berths and quay cranes (QCs). Therefore, a joint allocation problem of berths and QCs (BACASP) is presented in this paper and formalized as a mathematical model to minimize terminal operation costs and shipowner dissatisfaction. Given that BACASP is an NP-hard problem, an improved multi-objective cuckoo search (IMOCS) algorithm is proposed to solve this problem, in which an elite-guided tangent flight strategy is presented to speed up the convergence for making up the lack of random search direction of the traditional cuckoo search algorithm; and an information-enhanced abandonment strategy is put forward to increase the possibility of escaping from local optima. Numerical experimental results show the effectiveness of the proposed algorithm.