Skip to main navigation
Skip to search
Skip to main content
The Hebrew University of Jerusalem Home
Approve / Request updates on publications
Home
Profiles
Research units
Research output
Prizes
Search by expertise, name or affiliation
Efficiently testing for unboundedness and m-handed assembly
Fabian Schwarzer
*
, Florian Bieberbach
, Achim Schweikard
,
Leo Joskowicz
*
Corresponding author for this work
Research output
:
Contribution to conference
›
Paper
›
peer-review
1
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Efficiently testing for unboundedness and m-handed assembly'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Computer Science
Polynomial Time
100%
Experimental Result
100%
Motion Planning
100%
Polynomial Algorithm
100%
Feasibility Test
100%
Initial Placement
100%
Keyphrases
Unboundedness
100%
Assembly Planning
40%
Feasibility Trial
40%
Linear Feasibility Problem
40%
Polynomial Time
20%
Motion Planning
20%
Practical Algorithm
20%
Half-space
20%
SIMPLE Algorithm
20%
Polynomial-time Algorithm
20%
Movement Sequence
20%
Range Computation
20%
Initial Placement
20%
Mathematics
Polynomial
100%
Polynomial Time
100%
Half Space
100%
Motion Planning
100%