Unobstructed Shortest Paths in Polyhedral Environments - Lecture Notes in Computer Science - Varol Akman - Bøker - Springer-Verlag Berlin and Heidelberg Gm - 9783540176299 - 11. mars 1987
Ved uoverensstemmelse mellom cover og tittel gjelder tittel

Varol Akman
Unobstructed Shortest Paths in Polyhedral Environments - Lecture Notes in Computer Science 1987 edition

Pris
NOK 619

Bestillingsvarer

Forventes levert 31. aug - 14. sep
Få varsel om nye utgivelser fra Varol Akman

Kundene våre sier:

14 dages returrett
Toppvurdering på Trustpilot
Legg til iMusic ønskeliste
eller

Ikke vurdert ennå

Presents algebraic and geometric algorithms to deal with a specific problem, which frequently occurs in model-based robotics systems and is of utmost importance in calibrating the complexity of robotics tasks in general. The algorithms are based on several ideas from areas such as elimination theory, optimization, polyhedral theory and Voronoi diagrams. The algorithms were also implemented in a Lisp in a workbench to allow experimentation with shortest path problems.

106 pages, biography

Media Bøker     Pocketbok   (Bok med mykt omslag og limt rygg)
Utgitt 11. mars 1987
ISBN13 9783540176299
Utgivere Springer-Verlag Berlin and Heidelberg Gm
Antall sider 106
Mål 156 × 234 × 6 mm   ·   172 g
Språk Engelsk  

Mer fra samme **utgiver**

Se alt med Varol Akman ( f.eks. Pocketbok og Innbunden bok )