In this paper we consider a motion planning problem that occurs in tasks such as spot welding, car painting, inspection, and measurement, where the end-effector of a robotic arm must reach successive goal placements given as inputs. The problem is to compute a nearoptimal path of the arm so that the end-effector visits each goal once. It combines two notoriously hard subproblems: the collisionfree shortest-path and the traveling-salesman problems. It is further complicated by the fact that each goal placement of the end-effector may be achieved by several configurations of the arm (distinct solutions of the arm's inverse kinematics). This leads to considering a set of goal configurations of the robot that are partitioned into groups. The planner must compute a robot path that visits one configuration in each group and is near optimal over all configurations in every goal group and over all group orderings. The algorithm described in this paper operates under the assumption that finding a good tour in a graph with edges of given costs takes much less time than computing good paths between all pairs of goal configurations from different groups. So, the algorithm balances the time spent in computing paths between goal configurations and the time spent in computing tours. Although the algorithm still computes a quadratic number of such paths in the worst case, experimental results show that it is much faster in practice.
This paper considers the following multi-goal motion planning problem: a robot a m must reach several goal configurations an some sequence, but this sequence is not given. Instead, the robot's planner must compute an optimal o r near-optimal path through the goals. This problem occurs, for instance, in spot-welding, inspection, and measurement tasks. It combines two computationally hard sub-problems: the shortest-path and traveling-salesman problems. This paper describes a greedy algorithm that operates under the adsumption that the number of goals is relatively small (a few dozen at most) and the computational cost of finding a good path between two goals dominates that of finding a good tour in n graph with edges of given costs. Although the algorithm computes a quadratic number of goal-to-goal paths in the worst case, it is much faster in practice.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.