Search results

This paper aims to select an appropriate contact force model and apply it to the interaction model between the balls and the cage in the rolling bearings to describe the elastic–plastic collision phenomena between the two.

Taking the ball–disk collision mode as an example, several main contact force models were compared and analyzed through simulation and experiment. In addition, based on the consideration of yield strength of materials and initial collision velocity, a variable recovery coefficient model was proposed, and its validity and accuracy were verified by the ball–disk collision experiments. Then, respectively, the Flores model and the Hertz model were applied to the interaction between the balls and the cage, and the dynamics simulation results were compared.

The results indicate that the Flores model has good regression of recovery coefficient, indicating good applicability for both elastic and elastic–plastic contacts and can be applied to the contact collision situations of various materials. Under certain working conditions, there are significant differences in the dynamics results of rolling bearings simulated using the Flores model and Hertz model, respectively.

This paper applies the Flores model with variable recovery coefficients to the dynamics simulation analysis of ball bearings to solve the elastic–plastic collision problem between the rolling elements and the cage that cannot be reasonably handled by the Hertz model.

The peer review history for this article is available at: https://publons.com/publon/10.1108/ILT-04-2024-0138/

The spatial–temporal conflicts in the construction process of concrete arch dams are related to the construction quality and duration, especially for pouring blocks with a continuous high-strength and high-density construction process. Furthermore, the complicated construction technology and limited space resources aggravate the spatial–temporal conflicts in the process of space resource allocation and utilization, directly affecting the pouring quality and progress of concrete. To promote the high-strength, quality-preserving and rapid construction of dams and to clarify the explosion moment and influence degree of the spatial–temporal conflicts of construction machinery during the pouring process, a quantification method and algorithm for a “Conflict Bubble” (CB) between construction machines is proposed based on the “Time–Space Microelement” (TSM).

First, the concept of a CB is proposed, which is defined as the spatial overlap of different entities in the movement process. The subsidiary space of the entity is divided into three layered spaces: the physical space, safe space and efficiency space from the inside to the outside. Second, the processes of “creation,” “transition” and “disappearance” of the CB at different levels with the movement of the entity are defined as the evolution of the spatial–temporal state of the entity. The mapping relationship between the spatial variation and the running time of the layered space during the movement process is defined as “Time–Space” (TS), which is intended to be processed by a microelement.

The quantification method and algorithm of the CB between construction machinery are proposed based on the TSM, which realizes the quantification of the physical collision accident rate, security risk rate and efficiency loss rate of the construction machinery at any time point or time period. The risk rate of spatial–temporal conflicts in the construction process was calculated, and the outbreak condition of spatial–temporal conflict in the pouring process was simulated and rehearsed. The quantitative calculation results show that the physical collision accident rate, security risk rate and efficiency loss rate of construction machinery at any time point or time period can be quantified.

This study provides theoretical support for the quantitative evaluation and analysis of the spatial–temporal conflict risk in the pouring construction process. It also serves as a reference for the rational organization and scientific decision-making for pouring blocks and provides new ideas and methods for the safe and efficient construction and the scientific and refined management of dams.

The purpose of this study is to propose a path-planning strategy based on the velocity-virtual spring method to realize collision-free tasks in dynamic environments and further improve the effect.

By considering factors such as the relative velocity and direction of dynamic obstacles, the repulsive force of the robot is improved, thereby enhancing the adaptability of the strategy and achieving flexible and effective avoidance against dynamic obstacles. The attraction formula has been designed to allow the robot to have better smooth changes and higher gradients near the target, helping robots better reach the target and follow formations. Moreover, to meet the demands of the various stages during the driving process, the null space behavioral control is used to solve multi-task conflict problems and strengthen formation coordination and control.

Comparison of the planning path and formation effects through simulation and physical experiments, the results of this study show that the algorithm proposed can successfully maintain formation stability and plan smooth and safe paths in static or dynamic environments.

This paper proposes a path-planning strategy based on the velocity-virtual spring method to plan collision-free paths for formation in dynamic environments.

The purpose of the study is to address concerns regarding the subjectivity and imprecision of decision-making in table tennis refereeing by developing and enhancing a sensor node system. This system is designed to accurately detect the points on the table tennis table where balls collide. The study introduces the twined-reinforcement chimp optimization (TRCO) framework, which combines two novel approaches to optimize the distribution of sensor nodes. The main goal is to reduce the number of sensor units required while maintaining high accuracy in determining the locations of ball collisions, with error margins significantly below the critical 3.5 mm cutoff. Through complex optimization procedures, the study aims to improve the efficiency and reliability of decision-making in table tennis refereeing by leveraging sensor technology.

The study employs a design methodology focused on developing a sensor array system to enhance decision-making in table tennis refereeing. It introduces the twined-reinforcement chimp optimization (TRCO) framework, combining dual adaptive weighting strategies and a stochastic approach for optimization. By meticulously engineering the sensor array and utilizing complex optimization procedures, the study aims to improve the accuracy of detecting ball collisions on the table tennis table. The methodology aims to reduce the number of sensor units required while maintaining high precision, ultimately enhancing the reliability of decision-making in the sport.

The optimization research study yielded promising outcomes, showcasing a substantial reduction in the number of sensor units required from the initial count of 60 to a more practical 49. The sensor array system demonstrated excellent accuracy in identifying the locations of ball collisions, with error margins significantly below the critical 3.5 mm cutoff. Through the implementation of the twined-reinforcement chimp optimization (TRCO) framework, which integrates dual adaptive weighting strategies and a stochastic approach, the study achieved its goal of enhancing the efficiency and reliability of decision-making in table tennis refereeing.

This study introduces novel contributions to the field of table tennis refereeing by pioneering the development and optimization of a sensor array system. The innovative twined-reinforcement chimp optimization (TRCO) framework, integrating dual adaptive weighting strategies and a stochastic approach, sets a new standard for sensor node distribution in sports technology. By substantially reducing the number of sensor units required while maintaining high accuracy in detecting ball collisions, this research offers practical solutions to address the inherent subjectivity and imprecision in decision-making processes. The study’s originality lies in its meticulous design methodology and complex optimization procedures, offering significant value to the field of sports technology and officiating.

Multi-unmanned aerial vehicle (UAV) systems have succeeded in gaining the attention of researchers in diversified fields, especially in the past decade, owing to their capability to operate in complex scenarios in a coordinated manner. Path planning for UAV swarms is a challenging task depending upon the environmental conditions, the limitations of fixed-wing UAVs and the swarm constraints. Multiple optimization techniques have been studied for path-planning problems. However, there are local optimum and convergence rate problems. This study aims to propose a multi-UAV cooperative path planning (CoPP) scheme with four-dimensional collision avoidance and simultaneous arrival time.

A new two-step optimization algorithm is developed based on multiple populations (MP) of disturbance-based modified grey-wolf optimizer (DMGWO). The optimization is performed based on the objective function subject to multi constraints, including collision avoidance, same minimum time of flight and threat and obstacle avoidance in the terrain while meeting the UAV constraints. Comparative simulations using two different algorithms are performed to authenticate the proposed DMGWO.

The critical features of the proposed MP-DMGWO-based CoPP algorithm are local optimum avoidance and rapid convergence of the solution, i.e. fewer iterations as compared to the comparative algorithms. The efficiency of the proposed method is evident from the comparative simulation results.

A new algorithm DMGWO is proposed for the CoPP problem of UAV swarm. The local best position of each wolf is used in addition to GWO. Besides, a disturbance is introduced in the best solutions for faster convergence and local optimum avoidance. The path optimization is performed based on a newly designed objective function that depends upon multiple constraints.

The purpose of this study is to address the welding demands within large steel structures by presenting a global spatial motion planning algorithm for a mobile manipulator. This algorithm is based on an independently developed wall-climbing robot, which comprises a four-wheeled climbing mobile platform and a six-degree-of-freedom robotic manipulator, ensuring high mobility and operational flexibility.

A convex hull feasible domain constraint is developed for motion planning in the mobile manipulator. For extensive spatial movements, connected sequences of convex polyhedra are established between the composite robot’s initial and target states. The composite robot’s path and obstacle avoidance optimization problem are solved by constraining the control points on B-spline curves. A dynamic spatial constraint rapidlye-xploring random trees-connect (RRTC) motion planning algorithm is proposed for the manipulator, which quickly generates reference paths using spherical spatial constraints at the manipulator’s end, eliminating the need for complex nonconvex constraint modeling.

Experimental results show that the proposed motion planning algorithm achieves optimal paths that meet task constraints, significantly reducing computation times in task conditions and shortening operation times in non-task conditions.

The algorithm proposed in this paper holds certain application value for the realization of automated welding operations within large steel structures using mobile manipulator.

Fast obstacle avoidance path planning is a challenging task for multijoint robots navigating through cluttered workspaces. This paper aims to address this issue by proposing an improved path-planning method based on the distorted space (DS) method, specifically designed for high-dimensional complex environments.

The proposed method, termed topology-preserved distorted space (TP-DS) method, mitigates the limitations of the original DS method by preserving space topology through elastic deformation. By applying distinct spring constants, the TP-DS autonomously shrinks obstacles to microscopic areas within the configuration space, maintaining consistent topology. This enhancement extends the application scope of the DS method to handle complex environments effectively.

Comparative analysis demonstrates that the proposed TP-DS method outperforms traditional methods regarding planning efficiency. Successful obstacle avoidance tasks in the cluttered workspace validate its applicability on a physical 6-DOF manipulator, highlighting its potential for industrial implementations.

The novel TP-DS method generates a topology-preserved collision-free space by leveraging elastic deformation and shows significant capability and efficiency in planning obstacle-avoidance paths in complex application scenarios.

The present paper aims to address challenges associated with path planning and obstacle avoidance in mobile robotics. It introduces a pioneering solution called the Bi-directional Adaptive Enhanced A* (BAEA*) algorithm, which uses a new bidirectional search strategy. This approach facilitates simultaneous exploration from both the starting and target nodes and improves the efficiency and effectiveness of the algorithm in navigation environments. By using the heuristic knowledge A*, the algorithm avoids unproductive blind exploration, helps to obtain more efficient data for identifying optimal solutions. The simulation results demonstrate the superior performance of the BAEA* algorithm in achieving rapid convergence towards an optimal action strategy compared to existing methods.

The paper adopts a careful design focusing on the development and evaluation of the BAEA* for mobile robot path planning, based on the reference [18]. The algorithm has remarkable adaptability to dynamically changing environments and ensures robust navigation in the context of environmental changes. Its scale further enhances its applicability in large and complex environments, which means it has flexibility for various practical applications. The rigorous evaluation of our proposed BAEA* algorithm with the Bidirectional adaptive A* (BAA*) algorithm [18] in five different environments demonstrates the superiority of the BAEA* algorithm. The BAEA* algorithm consistently outperforms BAA*, demonstrating its ability to plan shorter and more stable paths and achieve higher success rates in all environments.

The paper adopts a careful design focusing on the development and evaluation of the BAEA* for mobile robot path planning, based on the reference [18]. The algorithm has remarkable adaptability to dynamically changing environments and ensures robust navigation in the context of environmental changes. Its scale further enhances its applicability in large and complex environments, which means it has flexibility for various practical applications. The rigorous evaluation of our proposed BAEA* algorithm with the Bi-directional adaptive A* (BAA*) algorithm [18] in five different environments demonstrates the superiority of the BAEA* algorithm.

The rigorous evaluation of our proposed BAEA* algorithm with the BAA* algorithm [18] in five different environments demonstrates the superiority of the BAEA* algorithm. The BAEA* algorithm consistently outperforms BAA*, demonstrating its ability to plan shorter and more stable paths and achieve higher success rates in all environments.

The originality of this paper lies in the introduction of the bidirectional adaptive enhancing A* algorithm (BAEA*) as a novel solution for path planning for mobile robots. This algorithm is characterized by its unique characteristics that distinguish it from others in this field. First, BAEA* uses a unique bidirectional search strategy, allowing to explore the same path from both the initial node and the target node. This approach significantly improves efficiency by quickly converging to the best paths and using A* heuristic knowledge. In particular, the algorithm shows remarkable capabilities to quickly recognize shorter and more stable paths while ensuring higher success rates, which is an important feature for time-sensitive applications. In addition, BAEA* shows adaptability and robustness in dynamically changing environments, not only avoiding obstacles but also respecting various constraints, ensuring safe path selection. Its scale further increases its versatility by seamlessly applying it to extensive and complex environments, making it a versatile solution for a wide range of practical applications. The rigorous assessment against established algorithms such as BAA* consistently shows the superior performance of BAEA* in planning shorter paths, achieving higher success rates in different environments and cementing its importance in complex and challenging environments. This originality marks BAEA* as a pioneering contribution, increasing the efficiency, adaptability and applicability of mobile robot path planning methods.

Loitering aerial vehicle (LAV) swarm safety flight control is an unmanned system control problem under multiple constraints, which are derived to prevent the LAVs from suffering risks inside and outside the swarms. The computational complexity of the safety flight control problem grows as the number of LAVs and of the constraints increases. Besides some important constraints, the swarms will encounter with sudden appearing risks in a hostile environment. The purpose of this study is to design a safety flight control algorithm for LAV swarm, which can timely respond to sudden appearing risks and reduce the computational burden.

To address the problem, this paper proposes a distributed safety flight control algorithm that includes a trajectory planning stage using kinodynamic rapidly exploring random trees (KRRT*) and a tracking stage based on distributed model predictive control (DMPC).

The proposed algorithm reduces the computational burden of the safety flight control problem and can fast find optimal flight trajectories for the LAVs in a swarm even there are multi-constraints and sudden appearing risks.

The proposed algorithm did not handle the constraints synchronously, but first uses the KRRT* to handle some constraints, and then uses the DMPC to deal with the rest constraints. In addition, the proposed algorithm can effectively respond to sudden appearing risks by online re-plan the trajectories of LAVs within the swarm.

Prefabricated building has been widely applied in the construction industry all over the world, which can significantly reduce labor consumption and improve construction efficiency compared with conventional approaches. During the construction of prefabricated buildings, the overall efficiency largely depends on the lifting sequence and path of each prefabricated component. To improve the efficiency and safety of the lifting process, this study proposes a framework for automatically optimizing the lifting path of prefabricated building components using building information modeling (BIM), improved 3D-A* and a physic-informed genetic algorithm (GA).

Firstly, the industry foundation class (IFC) schema for prefabricated buildings is established to enrich the semantic information of BIM. After extracting corresponding component attributes from BIM, the models of typical prefabricated components and their slings are simplified. Further, the slings and elements’ rotations are considered to build a safety bounding box. Secondly, an efficient 3D-A* is proposed for element path planning by integrating both safety factors and variable step size. Finally, an efficient GA is designed to obtain the optimal lifting sequence that satisfies physical constraints.

The proposed optimization framework is validated in a physics engine with a pilot project, which enables better understanding. The results show that the framework can intuitively and automatically generate the optimal lifting path for each type of prefabricated building component. Compared with traditional algorithms, the improved path planning algorithm significantly reduces the number of nodes computed by 91.48%, resulting in a notable decrease in search time by 75.68%.

In this study, a prefabricated component path planning framework based on the improved A* algorithm and GA is proposed for the first time. In addition, this study proposes a safety-bounding box that considers the effects of torsion and slinging of components during lifting. The semantic information of IFC for component lifting is enriched by taking into account lifting data such as binding positions, lifting methods, lifting angles and lifting offsets.