Search results

As the demand for human–robot collaboration in manufacturing applications grows, the necessity for collision detection functions in robots becomes increasingly paramount for safety. Hence, this paper aims to improve the existing method to achieve efficient, accurate and sensitive robot collision detection.

The external torque is estimated by momentum observers based on the robot dynamics model. Because the state of the joints is more accessible to distinguish under the action of the suppression operator proposed in this paper, the mutated external torque caused by joint reversal can be accurately attenuated. Finally, time series analysis (TSA) methods can continuously generate dynamic thresholds based on external torques.

Compared with the collision detection method based only on TSA, the invalid time of the proposed method is less during joint reversal. Although the soft-collision detection accuracy of this method is lower than that of the symmetric threshold method, it is superior in terms of detection delay and has a higher hard-collision detection accuracy.

Owing to the mutated external torque caused by joint reversal, which seriously affects the stability of time series models, the collision detection method based only on TSA cannot detect continuously. The consequences are disastrous if the robot collides with people or the environment during joint reversal. After multiple experimental verifications, the proposed method still exhibits detection capabilities during joint reversal and can implement real-time collision detection. Therefore, it is suitable for various engineering applications.

The purpose of this paper is to propose a new velocity prediction navigation algorithm to develop a conflict-free path for robots in dynamic crowded environments. The algorithm BP-prediction and reciprocal velocity obstacle (PRVO) combines the BP neural network for velocity PRVO to accomplish dynamic collision avoidance.

This presented method exhibits innovation by anticipating ahead velocities using BP neural networks to reconstruct the velocity obstacle region; determining the optimized velocity corresponding to the robot’s scalable radius range from the error generated by the non-holonomic robot tracking the desired trajectory; and considering acceleration constraints, determining the set of multi-step reachable velocities of non-holonomic robot in the space of velocity variations.

The method is validated using three commonly used metrics of collision rate, travel time and average distance in a comparison between simulation experiments including multiple differential drive robots and physical experiments using the Turtkebot3 robot. The experimental results show that our method outperforms other RVO extension methods on the three metrics.

In this paper, the authors propose navigation algorithms capable of adaptively selecting the optimal speed for a multi-robot system to avoid robot collisions during dynamic crowded interactions.

This paper aims to focus on solving the path optimization problem by modifying the probabilistic roadmap (PRM) technique as it suffers from the selection of the optimal number of nodes and deploy in free space for reliable trajectory planning.

Traditional PRM is modified by developing a decision-making strategy for the selection of optimal nodes w.r.t. the complexity of the environment and deploying the optimal number of nodes outside the closed segment. Subsequently, the generated trajectory is made smoother by implementing the modified Bezier curve technique, which selects an optimal number of control points near the sharp turns for the reliable convergence of the trajectory that reduces the sum of the robot’s turning angles.

The proposed technique is compared with state-of-the-art techniques that show the reduction of computational load by 12.46%, the number of sharp turns by 100%, the number of collisions by 100% and increase the velocity parameter by 19.91%.

The proposed adaptive technique provides a better solution for autonomous navigation of unmanned ground vehicles, transportation, warehouse applications, etc.

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.

In regarding to operational efficiency and safety improvements, multiple tower crane service scheduling problem is one of the main problems related to tower crane operation but receives limited attention. The current work presents an optimization model for scheduling multiple tower cranes' service with overlapping areas while achieving collision-free between cranes.

The cooperative coevolutionary genetic algorithm (CCGA) was proposed to solve this model. Considering the possible types of cross-tasks, through effectively allocating overlapping area tasks to each crane and then prioritizing the assigned tasks for each crane, the makespan of tower cranes was minimized and the crane collision avoidance was achieved by only allowing one crane entering the overlapping area at one time. A case study of the mega project Daxing International Airport has been investigated to evaluate the performance of the proposed algorithm.

The computational results showed that the CCGA algorithm outperforms two compared algorithms in terms of the optimal makespan and the CPU time. Also, the convergence of CCGA was discussed and compared, which was better than that of traditional genetic algorithm (TGA) for small-sized set (50 tasks) and was almost the same as TGA for large-sized sets.

This paper can provide new perspectives on multiple tower crane service sequencing problem. The proposed model and algorithm can be applied directly to enhance the operational efficiency of tower cranes on construction site.

This paper shows how Bruno Latour’s novel work and methodological approach can enrich management and organization studies, accounting and science and technology studies on what it takes to redesign sustainable societal infrastructures. Latour’s notions of trials of strength, macro-actor and design as redesign are used in a case study to describe and analyse how the laboratory becomes decisive in negotiating the bridge design and project budget to the benefit of a more sustainable transport infrastructure.

Latour’s notion of the detective-author is used to research and write a longitudinal qualitative case study that reconstructs the project processes and chain of related events by following the actors/actants.

The case analysis shows how a project design becomes an emerging powerful macro-actor through the mobilization of laboratory simulations and calculations. The role of the project budget changes; from a strong supporting role as input to a decision option in favour of a cheaper stayed bridge to a weak role as an output from a process of redesign supporting a much larger, costlier and more sustainable suspension bridge.

We use Latour’s methodological approach to engage primarily in detailed process descriptions to go beyond the often-pointless call for further theory development and to rather account for what is at work in specific situations. Latour’s notions of redesign as an outcome from trials of strength, we consider a useful approach to further our understanding since it also takes account of the distributed knowledge production that is integral to the actors’ cognitions and recognitions. Relatedly, the specific Latourian notion of redesign opens up new avenues for researching the more or less powerful role accounting devices such as a project budget can play in valuing, supporting and/or undermining the design of sustainable societal infrastructures.

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.

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.

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.

This study aims to solve the problem of job scheduling and multi automated guided vehicle (AGV) cooperation in intelligent manufacturing workshops.

In this study, an algorithm for job scheduling and cooperative work of multiple AGVs is designed. In the first part, with the goal of minimizing the total processing time and the total power consumption, the niche multi-objective evolutionary algorithm is used to determine the processing task arrangement on different machines. In the second part, AGV is called to transport workpieces, and an improved ant colony algorithm is used to generate the initial path of AGV. In the third part, to avoid path conflicts between running AGVs, the authors propose a simple priority-based waiting strategy to avoid collisions.

The experiment shows that the solution can effectively deal with job scheduling and multiple AGV operation problems in the workshop.

In this paper, a collaborative work algorithm is proposed, which combines the job scheduling and AGV running problem to make the research results adapt to the real job environment in the workshop.