
Difference systems of sets (DSSs) are combinatorial structures introduced by Levenshtein, which are a generalization of cyclic difference sets and arise in connection with code synchronization. In this paper, we describe four direct constructions of optimal DSSs from finite projective geometries and present a recursive construction of DSSs by extending the known construction. As a consequence, new infinite families of optimal DSSs can be obtained.
The large-scale multi-objective optimization problem is characterized by a large decision space. How to design an efficient optimization algorithm that can search a large decision space and find the global optimum in the objective space is a very challenging problem at present. In order to solve this problem, this paper proposes a sampling strategy based on direction vectors, which takes into account both convergence and diversity. First, select some excellent individuals who are close to the ideal point based on the reference vector. Secondly, construct a three-way search direction vector using the boundary point and an additional center point, and execute a directional sampling strategy called the convergence-related sampling strategy to improve the convergence of the algorithm. After, the direction vector is constructed among excellent individuals and executes a directional sampling strategy called the diversity-related sampling strategy to maintain the diversity of the population. Finally, the adjustment strategy of the reference vector in the Reference Vector Guidance Algorithm (RVEA) is adopted to adjust the reference vector. Numerical experiments are performed on large-scale multi-objective benchmark problem sets with 500, 1000, and 2000 decision variables and compared with the state-of-the-art algorithms. Experimental results show that the algorithm proposed in this paper is effective and can obtain solutions that are significantly better than those of the compared algorithms.
The accuracy of the kinematic model is affected by the error of geometric parameters caused by the machining and assembly of the robot, causing decline of the accuracy of the motion control and the odometry. In order to improve the motion accuracy of the omnidirectional mobile robot(OMR), a step-by-step calibration method is proposed for an omnidirectional mobile robot based on decoupled powered caster wheels(DPCW).This method simplifies the kinematic matrix by limiting the input of motion in joint space. Then the least squares method is used to obtain actual values of kinematic parameters. As a result, the precision of the kinematic model is improved. The experimental platform for the OMR based on DPCW is built, and the calibration algorithm is verified by simulation and experiment. The results show that the accuracies of both velocity control and odometry are significantly improved in three degrees of freedom in the plane, which proves the effectiveness of the calibration algorithm.
Task allocation is one of the key issues in multi-mobile robot scheduling system. The existing methods tend to focus on improving the efficiency of task assignment without considering the task execution time, ignoring the overall task completion efficiency and the computational cost. In addition, they usually adopt a centralized control architecture, which requires the robot to be in a stable and reliable communication environment. In order to solve the above problems, a distributed auction mechanism-based dynamic task assignment algorithm for multiple mobile robots is proposed. The method adopts a distributed control method for robot groups, shares and dynamically updates task sets with each other, bids for tasks using a distributed auction mechanism, adds a link to adjust the task execution order, and considers the overall task completion efficiency. Finally, a simulation environment with multiple robots and obstacles is built under Linux system and relevant experiments are conducted. The experimental results show that the algorithm has higher allocation efficiency than the linear and mixed integer solving algorithms CLP and CBC, and has stability. Comparing with the Deep Reinforcement Learning(DQN) and Vacancy Chain(VC) algorithms, the execution efficiency remains stable while the movement cost is significantly reduced by 55%, which achieves a balance between the efficiency and cost in operation. This study, as believed, can be put to the real-world applications with promising outlook.
The current study is to determine the safety of inactivated severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) vaccines in patients with skin allergies and egg intolerance but lacking laboratory evidence of egg allergy. This retrospective study included adults with skin allergies but lacking laboratory evidence of egg allergy who received two doses of the SARS-CoV-2 vaccines. Local and systemic reactions for 7 days following each vaccine dose were recorded during telephone interviews. 122 participants with skin allergies (mean age, 30±9.47 years) were enrolled. Egg-intolerant individuals had more anaphylactic reactions after receiving the vaccine than did egg-tolerant individuals (39.78%vs.17.24%, P<0.05). A higher titer of egg sIgG4 was associated with the increased risk of allergic responses after receiving the vaccine (P for trend=0.008). Unusual pain and new or worsened skin rashes were common reactions, especially after the first dose. After adjustments, egg-intolerance was correlated with a higher risk of unusual pain (P=0.044, adjusted odds ratio (aOR): 5.061, 95% confidence interval (CI): 1.047-24.457) and new or worsened skin rashes (P=0.041, aOR: 9.109, 95%CI: 1.098-75.563) after the first injection. The results supported the overall safety of inactivated SAR-CoV-2 vaccines. Egg intolerance increased the risk of allergic reactions in adults with skin allergies but lacking laboratory evidence of egg allergy within 7 days of receiving the inactivated vaccine. These reactions were more frequent after the first dose and were positively associated with egg serum concentration.