Robot Path Planning for Dimensional Measurement in Automotive Manufacturing

2005 ◽  
Vol 127 (2) ◽  
pp. 420-428 ◽  
Author(s):  
Weihua Sheng ◽  
Ning Xi ◽  
Mumin Song ◽  
Yifan Chen

This paper addresses the robot path planning problem in our effort to develop a fully automated dimensional measurement system using an eye-in-hand robotic manipulator. First, the CAD-based vision sensor planning system developed in our lab is briefly introduced; it uses both the CAD model and the camera model to plan camera viewpoints. The planning system employs a decomposition-based approach to generate camera viewpoints that satisfy given task constraints. Second, to improve the efficiency of the eye-in-hand robot inspection system, robot path planning is studied, which is the focus of this paper. This problem is rendered as a Traveling Salesman Problem (TSP). A new hierarchical approach is developed to solve the TSP into its suboptimality. Instead of solving a large size TSP, this approach utilizes the clustering nature of the viewpoints and converts the TSP into a clustered Traveling Salesman Problem (CTSP). A new algorithm, which favors the intergroup paths, is proposed to solve the CTSP quickly. Performance of the new algorithm is analyzed. It is shown that instead of a fixed performance ratio as reported in some existing work, a constant bound can be achieved which is related to the diameter of the clusters. Experimental results demonstrate the effectiveness of the robot motion planning system. The proposed path planning approach can obtain sub-optimal solutions quickly for many large scale TSPs, which are common problems in many robotic applications.

Author(s):  
C. Y. Liu ◽  
R. W. Mayne

Abstract This paper considers the problem of robot path planning by optimization methods. It focuses on the use of recursive quadratic programming (RQP) for the optimization process and presents a formulation of the three dimensional path planning problem developed for compatibility with the RQP selling. An approach 10 distance-to-contact and interference calculations appropriate for RQP is described as well as a strategy for gradient computations which are critical to applying any efficient nonlinear programming method. Symbolic computation has been used for general six degree-of-freedom transformations of the robot links and to provide analytical derivative expressions. Example problems in path planning are presented for a simple 3-D robot. One example includes adjustments in geometry and introduces the concept of integrating 3-D path planning with geometric design.


Sensors ◽  
2019 ◽  
Vol 19 (11) ◽  
pp. 2461 ◽  
Author(s):  
Jungyun Bae ◽  
Woojin Chung

A solution to the multiple depot heterogeneous traveling salesman problem with a min-max objective is in great demand with many potential applications of unmanned vehicles, as it is highly related to a reduction in the job completion time. As an initial idea for solving the min-max multiple depot heterogeneous traveling salesman problem, new heuristics for path planning problem of two heterogeneous unmanned vehicles are proposed in this article. Specifically, a task allocation and routing problem of two (structurally) heterogeneous unmanned vehicles that are located in distinctive depots and a set of targets to visit is considered. The unmanned vehicles, being heterogeneous, have different travel costs that are determined by their motion constraints. The objective is to find a tour for each vehicle such that each target location is visited at least once by one of the vehicles while the maximum travel cost is minimized. Two heuristics based on a primal-dual technique are proposed to solve the cases where the travel costs are symmetric and asymmetric. The computational results of the implementation have shown that the proposed algorithms produce feasible solutions of good quality within relatively short computation times.


Author(s):  
Masakazu Kobayashi ◽  
Higashi Masatake

A robot path planning problem is to produce a path that connects a start configuration and a goal configuration while avoiding collision with obstacles. To obtain a path for robots with high degree of freedom of motion such as an articulated robot efficiently, sampling-based algorithms such as probabilistic roadmap (PRM) and rapidly-exploring random tree (RRT) were proposed. In this paper, a new robot path planning method based on Particle Swarm Optimization (PSO), which is one of heuristic optimization methods, is proposed in order to improve efficiency of path planning for a wider range of problems. In the proposed method, a group of particles fly through a configuration space while avoiding collision with obstacles and a collection of their trajectories is regarded as a roadmap. A velocity of each particle is updated for every time step based on the update equation of PSO. After explaining the details of the proposed method, this paper shows the comparisons of efficiency between the proposed method and RRT for 2D maze problems and then shows application of the proposed method to path planning for a 6 degree of freedom articulated robot.


Robotica ◽  
2000 ◽  
Vol 18 (2) ◽  
pp. 123-142 ◽  
Author(s):  
Yongji Wang ◽  
David M. Lane ◽  
Gavin J. Falconer

In this paper, two novel approaches to unmanned underwater vehicle path planning are presented. The main idea of the first approach, referred to as Constrained Optimisation (CO) is to represent the free space of the workspace as a set of inequality constraints using vehicle configuration variables. The second approach converts robot path planning into a Semi-infinite Constrained Optimisation (SCO) problem. The function interpolation technique is adopted to satisfy the start and goal configuration requirements. Mathematical foundations for Constructive Solid Geometry (CSG), Boolean operations and approximation techniques are also presented to reduce the number of constraints, and to avoid local minima. The advantages of these approaches are that the mature techniques developed in optimisation theory which guarantee convergence, efficiency and numerical robustness can be directly applied to the robot path planning problem. Simulation results have been presented.


Sign in / Sign up

Export Citation Format

Share Document