Solving geometric constraints by iterative projections and backprojections

Most geometric constraint problems can be reduced to give coordinates to a set of points from a subset of their pairwise distances. By exploiting this fact, this paper presents an algorithm that solves geometric constraint systems by iteratively reducing and expanding the dimension of the problem. I...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	2004 IEEE International Conference on Robotics and Automation Ročník 2; s. 1789 - 1794 Vol.2
Hlavný autor:	Thomas, F.
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	Piscataway NJ IEEE 2004
Predmet:	Applied sciences Assembly systems Computer science; control theory; systems Control theory. Systems Couplings Equations Exact sciences and technology Iterative algorithms Joining processes Parallel robots Path planning Robot kinematics Robotic assembly Symmetric matrices Branching Set point Constraint satisfaction Iterative method Search algorithm
ISBN:	9780780382329, 0780382323
ISSN:	1050-4729
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!