
handle: 10217/1211
In this work, an algorithm is developed for generating the connectivity graph for a class of articulated manipulators. The algorithm is based upon the ability to determine whether two distinct obstacles in configuration space intersect. The efficiency of the test which is developed lies in the ability to determine the intersection relation by evaluating the curves which describe the configuration space obstacles at only a small number of points.
search problems, computational complexity, topology, manipulators, path planning
search problems, computational complexity, topology, manipulators, path planning
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
