An Efficient RRT Algorithm for Motion Planning of Live-Line Maintenance Robots

The application of robots to replace manual work in live-line working scenes can effectively guarantee the safety of personnel. To improve the operation efficiency and reduce the difficulties in operating a live-line working robot, this paper proposes a multi-DOF robot motion planning method based on RRT and extended algorithms. The planning results of traditional RRT and extended algorithms are random, and obtaining sub-optimal results requires a lot of calculations. In this study, a sparse offline tree filling the planning space are generated offline through the growing–withering method. In the process of expanding the tree, by removing small branches, the tree can fully wiring in the planning space with a small number of nodes. Optimize wiring through a large number of offline calculations, which can improve the progressive optimality of the algorithm. Through dynamic sampling and pruning, the growth of trees in undesired areas is reduced and undesired planning results are avoided. Based on the offline tree, this article introduces the method of online motion planning. Experiments show that this method can quickly complete the robot motion planning and obtain efficient and low-uncertainty paths.

A Randomized Greedy Algorithm for Piecewise Linear Motion Planning

We describe and implement a randomized algorithm that inputs a polyhedron, thought of as the space of states of some automated guided vehicle R, and outputs an explicit system of piecewise linear motion planners for R. The algorithm is designed in such a way that the cardinality of the output is probabilistically close (with parameters chosen by the user) to the minimal possible cardinality.This yields the first automated solution for robust-to-noise robot motion planning in terms of simplicial complexity (SC) techniques, a discretization of Farber’s topological complexity TC. Besides its relevance toward technological applications, our work reveals that, unlike other discrete approaches to TC, the SC model can recast Farber’s invariant without having to introduce costly subdivisions. We develop and implement our algorithm by actually discretizing Macías-Virgós and Mosquera-Lois’ notion of homotopic distance, thus encompassing computer estimations of other sectional category invariants as well, such as the Lusternik-Schnirelmann category of polyhedra.

Application of 6-Dof Robot Motion Planning in Fabrication

In practical robotic construction work, such as laying bricks and painting walls, obstructing objects are encountered and motion planning needs to be done to prevent collisions. This paper first introduces the background and results of existing work on motion planning and describes two of the most mainstream methods, the potential field method, and the sampling-based method. How to use the probabilistic route approach for motion planning on a 6-axis robot is presented. An example of a real bricklaying job is presented to show how to obtain point clouds and increase the speed of computation by customizing collision and ignore calculations. Several methods of smoothing paths are presented and the paths are re-detected to ensure the validity of the paths. Finally, the flow of the whole work is presented and some possible directions for future work are suggested. The significance of this paper is to confirm that a relatively fast motion planning can be achieved by an improved algorithmic process in grasshopper.

Visual analytics for nonlinear programming in robot motion planning

Nonlinear programming is a complex methodology where a problem is mathematically expressed in terms of optimality while imposing constraints on feasibility. Such problems are formulated by humans and solved by optimization algorithms. We support domain experts in their challenging tasks of understanding and troubleshooting optimization runs of intricate and high-dimensional nonlinear programs through a visual analytics system. The system was designed for our collaborators’ robot motion planning problems, but is domain agnostic in most parts of the visualizations. It allows for an exploration of the iterative solving process of a nonlinear program through several linked views of the computational process. We give insights into this design study, demonstrate our system for selected real-world cases, and discuss the extension of visualization and visual analytics methods for nonlinear programming. Graphic abstract

Benchmarking and optimization of robot motion planning with motion planning pipeline

Algorithms have been designed for robot motion planning with various adaptability to different problems. However, how to choose the most suitable planner in a scene has always been a problem worthy of research. This paper aims to find the most suitable motion planner for each query under three different scenes and six different queries. The work lies in optimization of sampling-based motion planning algorithms through motion planning pipeline and planning request adapter. The idea is to use the pre-processing of the planning request adapter, to run OMPL as a pre-processer for the optimized CHOMP or STOMP algorithm, and connect through the motion planning pipeline, to realize the optimization of the motion trajectory. The optimized trajectories are compared with original trajectories through benchmarking. The benchmarking determines the most suitable motion planning algorithm for different scenarios and different queries. Experimental results show that after optimization, the planning time of the algorithm is longer, but the efficiency is significantly improved. In the low-complexity scenes, STOMP optimizes the sampling algorithm very well, improves the trajectory quality greatly, and has a higher success rate. CHOMP also has a good optimization of the sampling algorithm, but it reduces the success rate of the original algorithm. However, in more complex scenes, optimization performance of the two optimization methods may not be as good as the original algorithm. In future work, we need to find better algorithms and better optimization algorithms to tackle with complex scenes.