Search results

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.

Cross-layer approach in media access control (MAC) layer will address interference and jamming problems. Hybrid distributed MAC can be used for simultaneous voice, data transmissions in wireless sensor network (WSN) and Internet of Things (IoT) applications. Choosing the correct objective function in Nash equilibrium for game theory will address fairness index and resource allocation to the nodes. Game theory optimization for distributed may increase the network performance. The purpose of this study is to survey the various operations that can be carried out using distributive and adaptive MAC protocol. Hill climbing distributed MAC does not need a central coordination system and location-based transmission with neighbor awareness reduces transmission power.

Distributed MAC in wireless networks is used to address the challenges like network lifetime, reduced energy consumption and for improving delay performance. In this paper, a survey is made on various cooperative communications in MAC protocols, optimization techniques used to improve MAC performance in various applications and mathematical approaches involved in game theory optimization for MAC protocol.

Spatial reuse of channel improved by 3%–29%, and multichannel improves throughput by 8% using distributed MAC protocol. Nash equilibrium is found to perform well, which focuses on energy utility in the network by individual players. Fuzzy logic improves channel selection by 17% and secondary users’ involvement by 8%. Cross-layer approach in MAC layer will address interference and jamming problems. Hybrid distributed MAC can be used for simultaneous voice, data transmissions in WSN and IoT applications. Cross-layer and cooperative communication give energy savings of 27% and reduces hop distance by 4.7%. Choosing the correct objective function in Nash equilibrium for game theory will address fairness index and resource allocation to the nodes.

Other optimization techniques can be applied for WSN to analyze the performance.

Game theory optimization for distributed may increase the network performance. Optimal cuckoo search improves throughput by 90% and reduces delay by 91%. Stochastic approaches detect 80% attacks even in 90% malicious nodes.

Channel allocations in centralized or static manner must be based on traffic demands whether dynamic traffic or fluctuated traffic. Usage of multimedia devices also increased which in turn increased the demand for high throughput. Cochannel interference keep on changing or mitigations occur which can be handled by proper resource allocations. Network survival is by efficient usage of valid patis in the network by avoiding transmission failures and time slots’ effective usage.

Literature survey is carried out to find the methods which give better performance.

This paper aims to use redundant manipulators to solve the challenge of collision avoidance in construction operations such as welding and painting.

In this paper, a null-space-based task-priority adjustment approach is developed to avoid collisions. The method establishes the relative position of the obstacle and the robot arm by defining the “link space,” and then the priority of the collision avoidance task and the end-effector task is adjusted according to the relative position by introducing the null space task conversion factors.

Numerical simulations demonstrate that the proposed method can realize collision-free maneuvers for redundant manipulators and guarantee the tracking precision of the end-effector task. The experimental results show that the method can avoid dynamic obstacles in redundant manipulator welding tasks.

A new formula for task priority adjustment for collision avoidance of redundant manipulators is proposed, and the original task tracking accuracy is guaranteed under the premise of safety.

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.

The purpose of this paper is to solve the problem that mobile robots are still based on reactive collision avoidance in unknown dynamic environments leading to a lack of interaction with obstacles and limiting the comprehensive performance of mobile robots. A dynamic window approach with multiple interaction strategies (DWA-MIS) is proposed to solve this problem.

The algorithm firstly classifies the moving obstacle movement intention, based on which a rule function is designed to incorporate positive incentives to motivate the robot to make correct avoidance actions. Then, the evaluation mechanism is improved by considering the time cost and future information of the environment to increase the motion states. Finally, the optimal objective function is designed based on genetic algorithm to adapt to different environments with time-varying multiparameter optimization.

Faced with obstacles in different states, the mobile robot can choose a suitable interaction strategy, which solves the limitations of the original DWA evaluation function and avoids the defects of reactive collision avoidance. Simulation results show that the algorithm can efficiently adapt to unknown dynamic environments, has less path length and iterations and has a high comprehensive performance.

A DWA-MIS is proposed, which increases the interaction capability between mobile robots and obstacles by improving the evaluation function mechanism and broadens the navigation strategy of DWA at a lower computational cost. After real machine verification, the algorithm has a high comprehensive performance based on real environment and provides a new idea for local path planning methods.

In the post-capture stage, the tumbling target rotates the combined spacecraft system, and the detumbling operation performed by the space robot is required. To save the costly onboard fuel of the space robot, this paper aims to present a novel post-capture detumbling strategy.

Actuated by the joint rotations of the manipulator, the combined system is driven from three-axis tumbling state to uniaxial rotation about its maximum principal axis. Only unidirectional thrust perpendicular to the axis is needed to slow down the uniaxial rotation, thus saving the thruster fuel. The optimization problem of the collision-free detumbling trajectory of the space robot is described, and it is optimized by the particle swarm optimization algorithm.

The numerical simulation results show that along the trajectory planned by the detumbling strategy, the maneuver of the manipulator can precisely drive the combined system to rotate around its maximum principal axis, and the final kinetic energy of the combined system is smaller than the initial. The unidirectional thrust and the lower kinetic energy can ensure the fuel-saving in the subsequent detumbling stage.

This paper presents a post-capture detumbling strategy to drive the combined system from three-axis tumbling state to uniaxial rotation about its maximum principal axis by redistributing the angular momentum of the parts of the combined system. The strategy reduces the thrust torque for detumbling to effectively save the thruster fuel.

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 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.

In corridor environments, human-following robot encounter difficulties when the target turning around at the corridor intersections, as walls may cause complete occlusion. This paper aims to propose a collision-free following system for robot to track humans in corridors without a prior map.

In addition to following a target and avoiding collisions robustly, the proposed system calculates the positions of walls in the environment in real-time. This allows the system to maintain a stable tracking of the target even if it is obscured after turning. The proposed solution is integrated into a four-wheeled differential drive mobile robot to follow a target in a corridor environment in real-world.

The experimental results demonstrate that the robot equipped with the proposed system is capable of avoiding obstacles and following a human target robustly in the corridors. Moreover, the robot achieves a 90% success rate in maintaining a stable tracking of the target after the target turns around a corner with high speed.

This paper proposes a human target following system incorporating three novel features: a path planning method based on wall positions is introduced to ensure stable tracking of the target even when it is obscured due to target turns; improvements are made to the random sample consensus (RANSAC) algorithm, enhancing its accuracy in calculating wall positions. The system is integrated into a four-wheeled differential drive mobile robot effectively demonstrates its remarkable robustness and real-time performance.

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.