0
Your cart

Your cart is empty

Books > Professional & Technical > Electronics & communications engineering > Electronics engineering > Automatic control engineering > Robotics

Buy Now

Unobstructed Shortest Paths in Polyhedral Environments (Paperback, 1987 ed.) Loot Price: R1,539
Discovery Miles 15 390
Unobstructed Shortest Paths in Polyhedral Environments (Paperback, 1987 ed.): Varol Akman

Unobstructed Shortest Paths in Polyhedral Environments (Paperback, 1987 ed.)

Varol Akman

Series: Lecture Notes in Computer Science, 251

 (sign in to rate)
Loot Price R1,539 Discovery Miles 15 390 | Repayment Terms: R144 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

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.

General

Imprint: Springer-Verlag
Country of origin: Germany
Series: Lecture Notes in Computer Science, 251
Release date: March 1987
First published: 1987
Authors: Varol Akman
Dimensions: 235 x 155 x 6mm (L x W x T)
Format: Paperback
Pages: 106
Edition: 1987 ed.
ISBN-13: 978-3-540-17629-9
Categories: Books > Professional & Technical > Electronics & communications engineering > Electronics engineering > Automatic control engineering > Robotics
Promotions
LSN: 3-540-17629-2
Barcode: 9783540176299

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners