Isbn: 9783540176299 - unobstructed shortest paths in polyhedral environments: 251 (lecture notes in computer science, 251) (15 resultados)

Paperback. Condición: Very Good. Sorry, No international shipping on this item.0387176292 Ex-library paperback in very nice condition with the usual markings and attachments.

paperback. Condición: Used-Very Good. 1987th Edition. Some shelf-wear.

Condición: good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail.…

Condición: New.

Condición: New. In.

PF. Condición: New.

Condición: New. pp. 116.

Taschenbuch. Condición: 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.…

Paperback. Condición: Very Good. Dust Jacket may NOT BE INCLUDED.CDs may be missing. SHIPS FROM MULTIPLE LOCATIONS. book.

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 116 pp. Englisch.…

Condición: New. Print on Demand pp. 116 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.

Condición: New. PRINT ON DEMAND pp. 116.

Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 sever.…

Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 116 pp. Englisch.…

Taschenbuch. Condición: Neu. Unobstructed Shortest Paths in Polyhedral Environments | Varol Akman | Taschenbuch | x | Englisch | 1987 | Springer | EAN 9783540176299 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand. …