✍️ 🧑‍🦱 💚 Autor:innen verdienen bei uns doppelt. Dank euch haben sie so schon 418.243 € mehr verdient. → Mehr erfahren 💪 📚 🙏

Unobstructed Shortest Paths in Polyhedral Environments

Unobstructed Shortest Paths in Polyhedral Environments

von Varol Akman
Softcover - 9783540176299
53,49 €
  • Versandkostenfrei
Auf meine Merkliste
  • Hinweis: Print on Demand. Lieferbar in 2 Tagen.
  • Lieferzeit nach Versand: ca. 1-2 Tage
  • inkl. MwSt. & Versandkosten (innerhalb Deutschlands)

Autorenfreundlich Bücher kaufen?!

Beschreibung

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.

Details

Verlag Springer Berlin
Ersterscheinung 11. März 1987
Maße 23.5 cm x 15.5 cm
Gewicht 189 Gramm
Format Softcover
ISBN-13 9783540176299
Seiten 106

Herstellerinformationen +