2012
DOI: 10.1109/tro.2012.2196311
|View full text |Cite
|
Sign up to set email alerts
|

A Complete Method for Workspace Boundary Determination on General Structure Manipulators

Abstract: Abstract-This paper introduces a new method for workspace boundary determination on general structure manipulators. The method uses a branch-and-prune technique to isolate a set of output singularities and then classifies the points on such a set according to whether they correspond to motion impediments in the workspace. A detailed map of the workspace is obtained as a result, where all interior and exterior regions, together with the singularity and barrier sets that separate them, get clearly identified. Th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
28
0

Year Published

2013
2013
2016
2016

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 60 publications
(28 citation statements)
references
References 40 publications
(46 reference statements)
0
28
0
Order By: Relevance
“…The former case is chosen for its simplicity, to illustrate and visualize the method in three dimensions, and the latter shows the method's performance on a real application of considerable complexity. Note that in all cases we make no use of closed-form parameterizations of C. Also, despite the singularity locus and the workspace are shown for reference in the figures (derived using [24,29] and [30] in our case), explicit knowledge of such sets is not used by the planner in its computations. All results reported have been obtained from an implementation in C of the method available in [31], executed on a MacBook Pro equipped with a 2.66 GHz Intel Core i7 processor.…”
Section: Illustrative Examplesmentioning
confidence: 99%
“…The former case is chosen for its simplicity, to illustrate and visualize the method in three dimensions, and the latter shows the method's performance on a real application of considerable complexity. Note that in all cases we make no use of closed-form parameterizations of C. Also, despite the singularity locus and the workspace are shown for reference in the figures (derived using [24,29] and [30] in our case), explicit knowledge of such sets is not used by the planner in its computations. All results reported have been obtained from an implementation in C of the method available in [31], executed on a MacBook Pro equipped with a 2.66 GHz Intel Core i7 processor.…”
Section: Illustrative Examplesmentioning
confidence: 99%
“…These are loci of configurations where problematic losses of control or dexterity arise [6,7]. They also reveal the boundaries of the task and joint workspaces, and all motion barriers that may be encountered in their interior [4]. The ability to compute these loci is thus essential, not only to anticipate possible problems during robot operation, but also to provide valuable information to the robot designer.…”
Section: Branch-and-prune Methodsmentioning
confidence: 99%
“…These are loci of critical configurations where control or dexterity losses arise, leading to malfunction or a breakage of the structure [25]. These loci provide the boundaries of the task and joint workspaces too, and all possible motion barriers within them [3]. By adequately defining the equations passed to the solver, the CUIK suite can isolate any of such loci [3,5,2], becoming the first general tool able to do so, up to the authors' knowledge.…”
Section: Branch-and-prune Methodsmentioning
confidence: 99%