Search results

In response to the challenge of reduced efficiency or failure of robot motion planning algorithms when faced with end-effector constraints, this study aims to propose a new constraint method to improve the performance of the sampling-based planner.

In this work, a constraint method (TC method) based on the idea of cross-sampling is proposed. This method uses the tangent space in the workspace to approximate the constrained manifold pattern and projects the entire sampling process into the workspace for constraint correction. This method avoids the need for extensive computational work involving multiple iterations of the Jacobi inverse matrix in the configuration space and retains the sampling properties of the sampling-based algorithm.

Simulation results demonstrate that the performance of the planner when using the TC method under the end-effector constraint surpasses that of other methods. Physical experiments further confirm that the TC-Planner does not cause excessive constraint errors that might lead to task failure. Moreover, field tests conducted on robots underscore the effectiveness of the TC-Planner, and its excellent performance, thereby advancing the autonomy of robots in power-line connection tasks.

This paper proposes a new constraint method combined with the rapid-exploring random trees algorithm to generate collision-free trajectories that satisfy the constraints for a high-dimensional robotic system under end-effector constraints. In a series of simulation and experimental tests, the planner using the TC method under end-effector constraints efficiently performs. Tests on a power distribution live-line operation robot also show that the TC method can greatly aid the robot in completing operation tasks with end-effector constraints. This helps robots to perform tasks with complex end-effector constraints such as grinding and welding more efficiently and autonomously.

Higher energy conversion efficiency of internal combustion engine can be achieved with optimal control of unsteady in-cylinder flow fields inside a direct-injection (DI) engine. However, it remains a daunting task to predict the nonlinear and transient in-cylinder flow motion because they are highly complex which change both in space and time. Recently, machine learning methods have demonstrated great promises to infer relatively simple temporal flow field development. This paper aims to feature a physics-guided machine learning approach to realize high accuracy and generalization prediction for complex swirl-induced flow field motions.

To achieve high-fidelity time-series prediction of unsteady engine flow fields, this work features an automated machine learning framework with the following objectives: (1) The spatiotemporal physical constraint of the flow field structure is transferred to machine learning structure. (2) The ML inputs and targets are efficiently designed that ensure high model convergence with limited sets of experiments. (3) The prediction results are optimized by ensemble learning mechanism within the automated machine learning framework.

The proposed data-driven framework is proven effective in different time periods and different extent of unsteadiness of the flow dynamics, and the predicted flow fields are highly similar to the target field under various complex flow patterns. Among the described framework designs, the utilization of spatial flow field structure is the featured improvement to the time-series flow field prediction process.

The proposed flow field prediction framework could be generalized to different crank angle periods, cycles and swirl ratio conditions, which could greatly promote real-time flow control and reduce experiments on in-cylinder flow field measurement and diagnostics.

In response to the issue of traditional algorithms often falling into local minima or failing to find feasible solutions in manipulator path planning. The purpose of this paper is to propose a 3D artificial moment method (3D-AMM) for obstacle avoidance for the robotic arm's end-effector.

A new method for constructing temporary attractive points in 3D has been introduced using the vector triple product approach, which generates the attractive moments that attract the end-effector to move toward it. Second, distance weight factorization and spatial projection methods are introduced to improve the solution of repulsive moments in multiobstacle scenarios. Third, a novel motion vector-solving mechanism is proposed to provide nonzero velocity for the end-effector to solve the problem of limiting the solution of the motion vector to a fixed coordinate plane due to dimensionality constraints.

A comparative analysis was conducted between the proposed algorithm and the existing methods, the improved artificial potential field method and the rapidly-random tree method under identical simulation conditions. The results indicate that the 3D-AMM method successfully plans paths with smoother trajectories and reduces the path length by 20.03% to 36.9%. Additionally, the experimental comparison outcomes affirm the feasibility and effectiveness of this method for obstacle avoidance in industrial scenarios.

This paper proposes a 3D-AMM algorithm for manipulator path planning in Cartesian space with multiple obstacles. This method effectively solves the problem of the artificial potential field method easily falling into local minimum points and the low path planning success rate of the rapidly-exploring random tree method.

In recent decades, the student population in dormitories has increased notably, primarily attributed to the growing number of international students. Dormitories serve as pivotal environments for student development. The coordination and compatibility among students can significantly influence their overall success. This study aims to introduce an innovative method for roommate selection and room allocation within dormitory settings.

In this study, initially, using multi-attribute decision-making methods including the Bayesian best-worst method and weighted aggregated sum product assessment, the incompatibility rate among pairs of students is calculated. Subsequently, using a linear mathematical model, roommates are selected and allocated to dormitory rooms pursuing the twin objectives of minimizing the total incompatibility rate and costs. Finally, the grasshopper optimization algorithm is applied to solve large-sized instances.

The results demonstrate the effectiveness of the proposed method in comparison to two common alternatives, i.e. random allocation and preference-based allocation. Moreover, the proposed method’s applicability extends beyond its current context, making it suitable for addressing various matching problems, including crew pairing and classmate pairing.

This novel method for roommate selection and room allocation enhances decision-making for optimal dormitory arrangements. Inspired by a real-world problem faced by the authors, this study strives to offer a robust solution to this problem.

Path planning is an important part of UAV mission planning. The main purpose of this paper is to overcome the shortcomings of the standard particle swarm optimization (PSO) such as easy to fall into the local optimum, so that the improved PSO applied to the UAV path planning can enable the UAV to plan a better quality path.

Firstly, the adaptation function is formulated by comprehensively considering the performance constraints of the flight target as well as the UAV itself. Secondly, the standard PSO is improved, and the improved particle swarm optimization with multi-strategy fusion (MFIPSO) is proposed. The method introduces class sigmoid inertia weight, adaptively adjusts the learning factors and at the same time incorporates K-means clustering ideas and introduces the Cauchy perturbation factor. Finally, MFIPSO is applied to UAV path planning.

Simulation experiments are conducted in simple and complex scenarios, respectively, and the quality of the path is measured by the fitness value and straight line rate, and the experimental results show that MFIPSO enables the UAV to plan a path with better quality.

Aiming at the standard PSO is prone to problems such as premature convergence, MFIPSO is proposed, which introduces class sigmoid inertia weight and adaptively adjusts the learning factor, balancing the global search ability and local convergence ability of the algorithm. The idea of K-means clustering algorithm is also incorporated to reduce the complexity of the algorithm while maintaining the diversity of particle swarm. In addition, the Cauchy perturbation is used to avoid the algorithm from falling into local optimum. Finally, the adaptability function is formulated by comprehensively considering the performance constraints of the flight target as well as the UAV itself, which improves the accuracy of the evaluation model.

The adverse interactions between disruptions can increase the supply chain's vulnerability. Accordingly, establishing supply chain resilience to deal with disruptions and employing business continuity planning to preserve risk management achievements is of considerable importance. The aforementioned idea is discussed in this study.

This study proposes a multi-objective optimization model for employing business continuity management and organizational resilience in a supply chain for responding to multiple interrelated disruptions. The improved augmented e-constraint and the scenario-based robust optimization methods are adopted for multi-objective programming and dealing with uncertainty, respectively. A case study of the automotive battery manufacturing industry is also considered to ensure real-world conformity of the model.

The results indicate that interactions between disruptions remarkably increase the supply chain's vulnerability. Choosing a higher fortification level for the supply chain and foreign suppliers reduces disruption impacts on resources and improves the supply chain's resilience and business continuity. Facilities dispersion, fortification of facilities, lateral transshipment, order deferral policy, dynamic capacity planning and direct transportation of products to markets are the most efficient resilience strategies in the under-study industry.

Applying resource allocation planning and portfolio selection to adopt preventive and reactive resilience strategies simultaneously to manage multiple interrelated disruptions in a real-world automotive battery manufacturing industry, maintaining the long-term achievements of supply chain resilience using business continuity management and dynamic capacity planning are the main contributions of the presented paper.

Safety management plays an important part in coal mine construction. Due to complex data, the implementation of the construction safety knowledge scattered in standards poses a challenge. This paper aims to develop a knowledge extraction model to automatically and efficiently extract domain knowledge from unstructured texts.

Bidirectional encoder representations from transformers (BERT)-bidirectional long short-term memory (BiLSTM)-conditional random field (CRF) method based on a pre-training language model was applied to carry out knowledge entity recognition in the field of coal mine construction safety in this paper. Firstly, 80 safety standards for coal mine construction were collected, sorted out and marked as a descriptive corpus. Then, the BERT pre-training language model was used to obtain dynamic word vectors. Finally, the BiLSTM-CRF model concluded the entity’s optimal tag sequence.

Accordingly, 11,933 entities and 2,051 relationships in the standard specifications texts of this paper were identified and a language model suitable for coal mine construction safety management was proposed. The experiments showed that F1 values were all above 60% in nine types of entities such as security management. F1 value of this model was more than 60% for entity extraction. The model identified and extracted entities more accurately than conventional methods.

This work completed the domain knowledge query and built a Q&A platform via entities and relationships identified by the standard specifications suitable for coal mines. This paper proposed a systematic framework for texts in coal mine construction safety to improve efficiency and accuracy of domain-specific entity extraction. In addition, the pretraining language model was also introduced into the coal mine construction safety to realize dynamic entity recognition, which provides technical support and theoretical reference for the optimization of safety management platforms.

This study aims to propose an efficient dual-robot task collaboration strategy to address the issue of low work efficiency and inability to meet the production needs of a single robot during construction operations.

A hybrid task allocation method based on integer programming and auction algorithms, with the aim of achieving a balanced workload between two robots has been proposed. In addition, while ensuring reasonable workload allocation between the two robots, an improved dual ant colony algorithm was used to solve the dual traveling salesman problem, and the global path planning of the two robots was determined, resulting in an efficient and collision-free path for the dual robots to operate. Meanwhile, an improved fast Random tree rapidly-exploring random tree algorithm is introduced as a local obstacle avoidance strategy.

The proposed method combines randomization and iteration techniques to achieve an efficient task allocation strategy for two robots, ensuring the relative optimal global path of the two robots in cooperation and solving complex local obstacle avoidance problems.

This method is applied to the scene of steel bar tying in construction work, with the workload allocation and collaborative work between two robots as evaluation indicators. The experimental results show that this method can efficiently complete the steel bar banding operation, effectively reduce the interference between the two robots and minimize the interference of obstacles in the environment.

This paper aims to develop a multi-objective problem for scheduling the operations of trucks entering and exiting cross-docks where the number of unloaded or loaded products by trucks is fuzzy logistic. The first objective function minimizes the maximum time to receive the products. The second objective function minimizes the emission cost of trucks. Finally, the third objective function minimizes the number of trucks assigned to the entrance and exit doors.

Two steps are implemented to validate and modify the proposed model. In the first step, two random numerical examples in small dimensions were solved by GAMS software with min-max objective function as well as genetic algorithms (GA) and particle swarm optimization. In the second step, due to the increasing dimensions of the problem and computational complexity, the problem in question is part of the NP-Hard problem, and therefore multi-objective meta-heuristic algorithms are used along with validation and parameter adjustment.

Therefore, non-dominated sorting genetic algorithm (NSGA-II) and non-dominated ranking genetic algorithm (NRGA) are used to solve 30 random problems in high dimensions. Then, the algorithms were ranked using the TOPSIS method for each problem according to the results obtained from the evaluation criteria. The analysis of the results confirms the applicability of the proposed model and solution methods.

This paper proposes mathematical model of truck scheduling for a real problem, including cross-docks that play an essential role in supply chains, as they could reduce order delivery time, inventory holding costs and shipping costs. To solve the proposed multi-objective mathematical model, as the problem is NP-hard, multi-objective meta-heuristic algorithms are used along with validation and parameter adjustment. Therefore, NSGA-II and NRGA are used to solve 30 random problems in high dimensions.

This research investigates how to optimize storage location assignment to decrease the order picking time and the waiting time of orders in the staging area of low-temperature logistics centers, with the goal of reducing food loss caused by temperature abuse.

The authors applied ABC clustering to the products in a simulated database of historical orders modeled after the actual order pattern of a large cold logistics company; then, the authors mined the association rules and calculated the sales volume correlation indices of the ordered products. Finally, the authors generated three different simulated order databases to compare order picking time and waiting time of orders in the staging area under eight different storage location assignment strategies.

All the eight proposed storage location assignment strategies significantly improve the order picking time (by up to 8%) and the waiting time of orders in the staging area (by up to 22%) compared with random placement.

The results of this research are based on a case study and simulated data, which implies that, if the best performing strategies are applied to different environments, the extent of the improvements may vary. Additionally, the authors only considered specific settings in terms of order picker routing, zoning and batching: other settings may lead to different results.

A storage location assignment strategy that adopts dispersion and takes into consideration ABC clustering and shipping frequency provides the best performance in minimizing order picker's travel distance, order picking time, and waiting time of orders in the staging area. Other strategies may be a better fit if the company's objectives differ.

Previous research on optimal storage location assignment rarely considered item association rules based on sales volume correlation. This study combines such rules with several storage planning strategies, ABC clustering, and two warehouse layouts; then, it evaluates their performance compared to the random placement, to find which one minimizes the order picking time and the order waiting time in the staging area, with a 30-min time limit to preserve the integrity of the cold chain. Order picking under these conditions was rarely studied before, because they may be irrelevant when dealing with temperature-insensitive items but become critical in cold warehouses to prevent temperature abuse.