Search results

To solve the path planning problem of the intelligent driving vehicular, this paper designs a hybrid path planning algorithm based on optimized reinforcement learning (RL) and improved particle swarm optimization (PSO).

First, the authors optimized the hyper-parameters of RL to make it converge quickly and learn more efficiently. Then the authors designed a pre-set operation for PSO to reduce the calculation of invalid particles. Finally, the authors proposed a correction variable that can be obtained from the cumulative reward of RL; this revises the fitness of the individual optimal particle and global optimal position of PSO to achieve an efficient path planning result. The authors also designed a selection parameter system to help to select the optimal path.

Simulation analysis and experimental test results proved that the proposed algorithm has advantages in terms of practicability and efficiency. This research also foreshadows the research prospects of RL in path planning, which is also the authors’ next research direction.

The authors designed a pre-set operation to reduce the participation of invalid particles in the calculation in PSO. And then, the authors designed a method to optimize hyper-parameters to improve learning efficiency of RL. And then they used RL trained PSO to plan path. The authors also proposed an optimal path evaluation system. This research also foreshadows the research prospects of RL in path planning, which is also the authors’ next research direction.

The purpose of this paper is to propose a strategy for the final assembly of helicopter fuselage with weak rigidity parts and mismatched jointing butt ends.

The strategy is based on path planning methods. Compared with traditional path planning methods, the configuration-space and collision detection in the method are different. The obstacles in the configuration-space are weakly rigid and allow continuous contact with the robot. The collision detection is based on interference magnitudes, and the result is divided into no collision, weak collision and strong collision. Only strong collision is unacceptable. Then a compliant jointing path planning algorithm based on RRT is designed, combined with some improvements in search efficiency.

A series of planning results show that the efficiency of this method is higher than original RRT under the same conditions. The effectiveness of the method is verified by a series of simulations and experiments on two sets of systems.

There are few reports on the automation technology of helicopter fuselage assembly. This paper analyzes the problem and provides a solution from the perspective of path planning. This method contains a new configuration-space and collision detection method adapted to this problem and could be intuitive for the jointing of other weakly rigid parts.

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.

This paper aims to provide an approach to print shell-type objects using a 5-axis printer. The proposed approach takes advantage of the two additional printer degrees of freedom to provide a curved layer path planning strategy.

This paper addresses curved layer path planning on a 5-axis printer. This printer considers movements along the three usual axes together with two additional axes at the printing table (rotation and tilt), allowing to build more complex and reliable objects. Curved layer path planning is considered where polygons obtained from the slicing stage are approximated by linear and cubic splines. The proposed printing strategy consists in building an inner core supporting structure followed by outer curved layers.

The curved layer path planning strategy is validated for shell-type objects by considering a 5-axis printer simulator. An example with an aeronautic object is presented to illustrate the proposed approach.

The paper presents an approach to curved layer path planning on a 5-axis printer, for shell-type objects.

Applications of robotic systems in agriculture, forestry and high-altitude work will enter a new and huge stage in the near future. For these application fields, climbing robots have attracted much attention and have become one central topic in robotic research. The purpose of this paper is to propose an energy-optimal motion planning method for climbing robots that are applied in an outdoor environment.

First, a self-designed climbing robot named Climbot is briefly introduced. Then, an energy-optimal motion planning method is proposed for Climbot with simultaneous consideration of kinematic constraints and dynamic constraints. To decrease computing complexity, an acceleration continuous trajectory planner and a path planner based on spatial continuous curve are designed. Simulation and experimental results indicate that this method can search an energy-optimal path effectively.

Climbot can evidently reduce energy consumption when it moves along the energy-optimal path derived by the method used in this paper.

Only one step climbing motion planning is considered in this method.

With the proposed motion planning method, climbing robots applied in an outdoor environment can commit more missions with limit power supply. In addition, it is also proved that this motion planning method is effective in a complicated obstacle environment with collision-free constraint.

The main contribution of this paper is that it establishes a two-planner system to solve the complex motion planning problem with kinodynamic constraints.

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.

This paper aims to design a multi-layer convolutional neural network (CNN) to solve biomimetic robot path planning problem.

At first, the convolution kernel with different scales can be obtained by using the sparse auto encoder training algorithm; the parameter of the hidden layer is a series of convolutional kernel, and the authors use these kernels to extract first-layer features. Then, the authors get the second-layer features through the max-pooling operators, which improve the invariance of the features. Finally, the authors use fully connected layers of neural networks to accomplish the path planning task.

The NAO biomimetic robot respond quickly and correctly to the dynamic environment. The simulation experiments show that the deep neural network outperforms in dynamic and static environment than the conventional method.

A new method of deep learning based biomimetic robot path planning is proposed. The authors designed a multi-layer CNN which includes max-pooling layer and convolutional kernel. Then, the first and second layers features can be extracted by these kernels. Finally, the authors use the sparse auto encoder training algorithm to train the CNN so as to accomplish the path planning task of NAO robot.

The purpose of this paper is to present a path planning algorithm for a non‐circular shaped mobile robot to autonomously navigate in an unknown area for humanitarian demining. For that purpose the path planning problem comes down to planning a path from some starting location to a final location in an area so that the robot covers all the reachable positions in the area while following the planned path.

The proposed algorithm uses occupancy grid map representation of the area. Every free cell in the grid map represents a node in the graph being searched to find the complete coverage path. The complete coverage path is followed by the dynamic window algorithm, which includes robot's kinematic and dynamic constraints.

The proposed algorithm finds the complete coverage path in the graph accounting for the dimensions of the mobile robot, where non‐circular shaped robots can be easily included. The algorithms are implemented under the ROS (robot operating system) and tested in the stage 3D simulator for mobile robots with a randomly generated simulation map of an unknown area.

Some parts of the area close to obstacles are hard to cover due to complex non‐circular shaped robot and non‐perfect path following. The future work should include better path following algorithm.

The proposed algorithm has shown itself as effective and could meet the working demands of humanitarian demining.

The algorithm proposed in the paper enables complete coverage path planning of non‐circular shaped robots in unknown areas.

For robot motion planning there exists a large number of different algorithms, each appropriate for a certain domain, and the right choice of planner depends on the specific use case. The purpose of this paper is to consider the application of bin picking and benchmark a set of motion planning algorithms to identify which are most suited in the given context.

The paper presents a selection of motion planning algorithms and defines benchmarks based on three different bin-picking scenarios. The evaluation is done based on a fixed set of tasks, which are planned and executed on a real and a simulated robot.

The benchmarking shows a clear difference between the planners and generally indicates that algorithms integrating optimization, despite longer planning time, perform better due to a faster execution.

The originality of this work lies in the selected set of planners and the specific choice of application. Most new planners are only compared to existing methods for specific applications chosen to demonstrate the advantages. However, with the specifics of another application, such as bin picking, it is not obvious which planner to choose.

The purpose of this paper is to give a comprehensive solution method for the manipulation of parts with complex geometries arriving in bulk into a robotic assembly cell. As bin-picking applications are still not reliable in intricate workcells, first, the problem is transformed to a semi-structured pick-and-place application, then by collecting and organizing the required process planning steps, a methodology is formed to achieve reliable factory applications even in crowded assembly cell environments.

The process planning steps are separated into offline precomputation and online planning. The offline phase focuses on preparing the operation and reducing the online computational burdens. During the online phase, the parts laying in a semi-structured arrangement are first recognized and localized based on their stable equilibrium using two-dimensional vision. Then, the picking sequence and corresponding collision-free robot trajectories are planned and optimized.

The proposed method was evaluated in a geometrically complex experimental workcell, where it ensured precise, collision-free operation. Moreover, the applied planning processes could significantly reduce the execution time compared to heuristic approaches.

The methodology can be further generalized by considering multiple part types and grasping modes. Additionally, the automation of grasp planning and the enhancement of part localization, sequence planning and path smoothing with more advanced solutions are further research directions.

The paper proposes a novel methodology that combines geometrical computations, image processing and combinatorial optimization, adapted to the requirements of flexible pick-and-place applications. The methodology covers each required planning step to reach reliable and more efficient operation.