Search results

Traditional robot arm trajectory planning methods have problems such as insufficient generalization performance and low adaptability. This paper aims to propose a method to plan the robot arm’s trajectory using the trajectory learning and generalization characteristics of dynamic motion primitives (DMPs).

This study aligns multiple demonstration motion primitives using dynamic time warping; use the Gaussian mixture model and Gaussian mixture regression methods to obtain the ideal primitive trajectory actions. By establishing a system model that improves DMPs, the parameters of the nonlinear function are learned based on the ideal primitive trajectory actions of the robotic arm, and the robotic arm motion trajectory is reproduced and generalized.

Experiments have proven that the robot arm motion trajectory learned by the method proposed in this article can not only learn to generalize and demonstrate the movement trend of the primitive trajectory, but also can better generate ideal motion trajectories and avoid obstacles when there are obstacles. The maximum Euclidean distance between the generated trajectory and the demonstration primitive trajectory is reduced by 29.9%, and the average Euclidean distance is reduced by 54.2%. This illustrates the feasibility of this method for robot arm trajectory planning.

It provides a new method for the trajectory planning of robotic arms in unstructured environments while improving the adaptability and generalization performance of robotic arms in trajectory planning.

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.

The purpose of the paper is to propose and demonstrate a novel approach for addressing the challenges of path planning and obstacle avoidance in the context of mobile robots (MR). The specific objectives and purposes outlined in the paper include: introducing a new methodology that combines Q-learning with dynamic reward to improve the efficiency of path planning and obstacle avoidance. Enhancing the navigation of MR through unfamiliar environments by reducing blind exploration and accelerating the convergence to optimal solutions and demonstrating through simulation results that the proposed method, dynamic reward-enhanced Q-learning (DRQL), outperforms existing approaches in terms of achieving convergence to an optimal action strategy more efficiently, requiring less time and improving path exploration with fewer steps and higher average rewards.

The design adopted in this paper to achieve its purposes involves the following key components: (1) Combination of Q-learning and dynamic reward: the paper’s design integrates Q-learning, a popular reinforcement learning technique, with dynamic reward mechanisms. This combination forms the foundation of the approach. Q-learning is used to learn and update the robot’s action-value function, while dynamic rewards are introduced to guide the robot’s actions effectively. (2) Data accumulation during navigation: when a MR navigates through an unfamiliar environment, it accumulates experience data. This data collection is a crucial part of the design, as it enables the robot to learn from its interactions with the environment. (3) Dynamic reward integration: dynamic reward mechanisms are integrated into the Q-learning process. These mechanisms provide feedback to the robot based on its actions, guiding it to make decisions that lead to better outcomes. Dynamic rewards help reduce blind exploration, which can be time-consuming and inefficient and promote faster convergence to optimal solutions. (4) Simulation-based evaluation: to assess the effectiveness of the proposed approach, the design includes a simulation-based evaluation. This evaluation uses simulated environments and scenarios to test the performance of the DRQL method. (5) Performance metrics: the design incorporates performance metrics to measure the success of the approach. These metrics likely include measures of convergence speed, exploration efficiency, the number of steps taken and the average rewards obtained during the robot’s navigation.

The findings of the paper can be summarized as follows: (1) Efficient path planning and obstacle avoidance: the paper’s proposed approach, DRQL, leads to more efficient path planning and obstacle avoidance for MR. This is achieved through the combination of Q-learning and dynamic reward mechanisms, which guide the robot’s actions effectively. (2) Faster convergence to optimal solutions: DRQL accelerates the convergence of the MR to optimal action strategies. Dynamic rewards help reduce the need for blind exploration, which typically consumes time and this results in a quicker attainment of optimal solutions. (3) Reduced exploration time: the integration of dynamic reward mechanisms significantly reduces the time required for exploration during navigation. This reduction in exploration time contributes to more efficient and quicker path planning. (4) Improved path exploration: the results from the simulations indicate that the DRQL method leads to improved path exploration in unknown environments. The robot takes fewer steps to reach its destination, which is a crucial indicator of efficiency. (5) Higher average rewards: the paper’s findings reveal that MR using DRQL receive higher average rewards during their navigation. This suggests that the proposed approach results in better decision-making and more successful navigation.

The paper’s originality stems from its unique combination of Q-learning and dynamic rewards, its focus on efficiency and speed in MR navigation and its ability to enhance path exploration and average rewards. These original contributions have the potential to advance the field of mobile robotics by addressing critical challenges in path planning and obstacle avoidance.

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.

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.

The purpose of this paper is to achieve optimal climbing control of the gas-insulated switchgear (GIS) robot, as the authors know that the GIS inspection robot is a kind of artificial intelligent mobile equipment which auxiliary or even substitute human labor drive on the inner wall of the gas-insulated metal enclosed switchgear. The GIS equipment fault inspection and maintenance can be realized through the robot manipulator on the mobile platform and the camera carried on the fuselage, and it is a kind of intelligent equipment for operation. To realize the inspection and operation of the GIS equipment pipeline without blind spots, the robot is required to be able to travel on any wall inside the pipeline, especially the top of the pipeline and both right and left sides of the pipeline, which requires the flexible climbing of the GIS inspection robot. The robot device has a certain adsorption function to ensure that the robot is fully attached to the wall surface. At the same time, the robot manipulator can be used for collision-free obstacle avoidance operation planning in the narrow operation space inside the GIS equipment.

The above two technologies are the key that the robot completes the GIS equipment inspections. Based on this, this paper focuses on modeling and analysis of the chassis adsorption characteristics for the GIS inspection robot. At the same time, the Denavit Hartenberg (D-H) coordinate model of the robot arm system has been established, and the kinematics forward and inverse solutions of the robot manipulator system have been derived.

The reachable working space point cloud diagram of the robot manipulator in MATLAB has been obtained based on the kinematics analysis, and the operation trajectory planning of the robot manipulator using the robot toolbox has been obtained. The simulation results show that the robot manipulator system can realize the movement without collision and obstacle avoidance. The space can cover the entire GIS pipeline so as to achieve no blind area operation.

Finally, the GIS inspection robot physical prototype system has been developed through system integration design, and the inspection, maintenance operation experiment has been carried out in the actual GIS equipment. The entire robot system can complete the GIS equipment inspection operation soundly and improve the operation efficiency. The research in this paper has important theoretical significance and practical application value for the optimization design and practical research of the GIS inspection robot system.

The purpose of this paper is to address two major challenges faced by robotic fish when operating in underwater environments: insufficient path planning capabilities and difficulties in avoiding dynamic obstacles. To achieve this, a method is proposed that combines the Improved Rapid Randomized Tree Star (IRRT*) with the dynamic window approach (DWA).

The RRT-connect algorithm is used to determine an initial feasible path quickly. The quality of sampling points is then improved by dividing the regions and selecting each region’s probability based on its fitness value. The fitness function and roulette wheel method are introduced for region selection. Subtarget points of the DWA algorithm are extracted from the IRRT* algorithm to achieve real-time dynamic path planning.

In various maps, the iteration count for the IRRT* algorithm decreased by 61%, 35% and 51% respectively, compared to the RRT* algorithm, whereas the iteration time was reduced by 75%, 34% and 57%, respectively. In addition, the IRRT*-DWA algorithm can successfully navigate through multiple dynamic obstacles, and the average time, path length, etc. do not change much when parameters change, and the stability is high.

A novel IRRT*-DWA algorithm is proposed, which, by refining the sampling strategy and updating sub-target points in real time, not only addresses the limitations of existing algorithms in terms of path planning efficiency in complex environments but also enhances their capability to avoid dynamic obstacles. Ultimately, experimental results indicate a high level of similarity between the actual and ideal paths.

The purpose of this research is to achieve multi-task autonomous driving by adjusting the network architecture of the model. Meanwhile, after achieving multi-task autonomous driving, the authors found that the trained neural network model performs poorly in untrained scenarios. Therefore, the authors proposed to improve the transfer efficiency of the model for new scenarios through transfer learning.

First, the authors achieved multi-task autonomous driving by training a model combining convolutional neural network and different structured long short-term memory (LSTM) layers. Second, the authors achieved fast transfer of neural network models in new scenarios by cross-model transfer learning. Finally, the authors combined data collection and data labeling to improve the efficiency of deep learning. Furthermore, the authors verified that the model has good robustness through light and shadow test.

This research achieved road tracking, real-time acceleration–deceleration, obstacle avoidance and left/right sign recognition. The model proposed by the authors (UniBiCLSTM) outperforms the existing models tested with model cars in terms of autonomous driving performance. Furthermore, the CMTL-UniBiCL-RL model trained by the authors through cross-model transfer learning improves the efficiency of model adaptation to new scenarios. Meanwhile, this research proposed an automatic data annotation method, which can save 1/4 of the time for deep learning.

This research provided novel solutions in the achievement of multi-task autonomous driving and neural network model scenario for transfer learning. The experiment was achieved on a single camera with an embedded chip and a scale model car, which is expected to simplify the hardware for autonomous driving.

Based on the C-A-C framework, this article examined users' information avoidance intention in social media platforms.

The authors conducted data analysis using a mixed method of the SEM and fsQCA.

The results indicated that information overload, functional overload and social overload influence fatigue and dissatisfaction, both of which further determine users' information avoidance intention. The results of the fsQCA identified two paths that trigger users' information avoidance intention.

Extant studies have examined the information avoidance in the contexts of healthcare, academics and e-commerce, but have seldom explored the mechanism underlying users' information avoidance in social media. To fill this gap, this article will empirically investigate users' information avoidance in social media platforms based on the C-A-C framework.

To make the robot that have real autonomous ability is always the goal of mobile robot research. For mobile robots, simultaneous localization and mapping (SLAM) research is no longer satisfied with enabling robots to build maps by remote control, more needs will focus on the autonomous exploration of unknown areas, which refer to the low light, complex spatial features and a series of unstructured environment, lick underground special space (dark and multiintersection). This study aims to propose a novel robot structure with mapping and autonomous exploration algorithms. The experiment proves the detection ability of the robot.

A small bio-inspired mobile robot suitable for underground special space (dark and multiintersection) is designed, and the control system is set up based on STM32 and Jetson Nano. The robot is equipped with double laser sensor and Ackerman chassis structure, which can adapt to the practical requirements of exploration in underground special space. Based on the graph optimization SLAM method, an optimization method for map construction is proposed. The Iterative Closest Point (ICP) algorithm is used to match two frames of laser to recalculate the relative pose of the robot, which improves the sensor utilization rate of the robot in underground space and also increase the synchronous positioning accuracy. Moreover, based on boundary cells and rapidly-exploring random tree (RRT) algorithm, a new Bio-RRT method for robot autonomous exploration is proposed in addition.

According to the experimental results, it can be seen that the upgraded SLAM method proposed in this paper achieves better results in map construction. At the same time, the algorithm presents good real-time performance as well as high accuracy and strong maintainability, particularly it can update the map continuously with the passing of time and ensure the positioning accuracy in the process of map updating. The Bio-RRT method fused with the firing excitation mechanism of boundary cells has a more purposeful random tree growth. The number of random tree expansion nodes is less, and the amount of information to be processed is reduced, which leads to the path planning time shorter and the efficiency higher. In addition, the target bias makes the random tree grow directly toward the target point with a certain probability, and the obtained path nodes are basically distributed on or on both sides of the line between the initial point and the target point, which makes the path length shorter and reduces the moving cost of the mobile robot. The final experimental results demonstrate that the proposed upgraded SLAM and Bio-RRT methods can better complete the underground special space exploration task.

Based on the background of robot autonomous exploration in underground special space, a new bio-inspired mobile robot structure with mapping and autonomous exploration algorithm is proposed in this paper. The robot structure is constructed, and the perceptual unit, control unit, driving unit and communication unit are described in detail. The robot can satisfy the practical requirements of exploring the underground dark and multiintersection space. Then, the upgraded graph optimization laser SLAM algorithm and interframe matching optimization method are proposed in this paper. The Bio-RRT independent exploration method is finally proposed, which takes shorter time in equally open space and the search strategy for multiintersection space is more efficient. The experimental results demonstrate that the proposed upgrade SLAM and Bio-RRT methods can better complete the underground space exploration task.