Introduction to algorithms
Sparsification—a technique for speeding up dynamic graph algorithms
Journal of the ACM (JACM)
Handbook of discrete and computational geometry
A polylogarithmic approximation algorithm for the group Steiner tree problem
Journal of Algorithms
A randomized art-gallery algorithm for sensor placement
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Beyond Steiner's Problem: A VLSI Oriented Generalization
WG '89 Proceedings of the 15th International Workshop on Graph-Theoretic Concepts in Computer Science
A tight bound on approximating arbitrary metrics by tree metrics
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Polylogarithmic inapproximability
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Randomized single-query motion planning in expansive spaces
Randomized single-query motion planning in expansive spaces
A greedy approximation algorithm for the group Steiner problem
Discrete Applied Mathematics
Hybrid design for multiple-goal task realization of robot arm with rotating table
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
IROS'09 Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems
Information Sciences: an International Journal
Small tree probabilistic roadmap planner for hyper-redundant manipulators
AIS'11 Proceedings of the Second international conference on Autonomous and intelligent systems
Task scheduling and motion planning for an industrial manipulator
Robotics and Computer-Integrated Manufacturing
Visiting convex regions in a polygonal map
Robotics and Autonomous Systems
Three-dimensional coverage planning for an underwater inspection robot
International Journal of Robotics Research
Constraint optimization model of a scheduling problem for a robotic arm in automatic systems
Robotics and Autonomous Systems
| Hi-index | 0.00 |
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.