Verwandte Artikel zu Unobstructed Shortest Paths in Polyhedral Environments:...
Unobstructed Shortest Paths in Polyhedral Environments: 251 (Lecture Notes in Computer Science) - Softcover
Inhaltsangabe
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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Reseña del editor
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Neu kaufen
Diesen Artikel anzeigen
EUR 53,49
Gratis für den Versand innerhalb von/der Deutschland
Versandziele, Kosten & Dauer
Suchergebnisse für Unobstructed Shortest Paths in Polyhedral Environments:...
Beispielbild für diese ISBN
Unobstructed Shortest Paths in Polyhedral Environments (Lecture Notes in Computer Science)
Anbieter: Powell's Bookstores Chicago, ABAA, Chicago, IL, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: Used - Very Good. 1987. Paperback. Some shelf-wear. Very Good. Artikel-Nr. SON000000808
Anzahl: 1 verfügbar
Foto des Verkäufers
Unobstructed Shortest Paths in Polyhedral Environments
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Artikel-Nr. 9783540176299
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Unobstructed Shortest Paths in Polyhedral Environments (Lecture Notes in Computer Science, 251)
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. In. Artikel-Nr. ria9783540176299_new
Anzahl: Mehr als 20 verfügbar