0 Mėgstami
0Krepšelis

Unobstructed Shortest Paths in Polyhedral Environments

84,68 
84,68 
2025-07-31 84.6800 InStock
Nemokamas pristatymas į paštomatus per 13-17 darbo dienų užsakymams nuo 19,00 

Knygos aprašymas

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.

Informacija

Autorius: Varol Akman
Serija: Lecture Notes in Computer Science
Leidėjas: Springer Berlin Heidelberg
Išleidimo metai: 1987
Knygos puslapių skaičius: 116
ISBN-10: 3540176292
ISBN-13: 9783540176299
Formatas: Knyga minkštu viršeliu
Kalba: Anglų
Žanras: Graphics programming

Pirkėjų atsiliepimai

Parašykite atsiliepimą apie „Unobstructed Shortest Paths in Polyhedral Environments“

Būtina įvertinti prekę

Goodreads reviews for „Unobstructed Shortest Paths in Polyhedral Environments“