Items related to Unobstructed Shortest Paths in Polyhedral Environments:...
Unobstructed Shortest Paths in Polyhedral Environments: 251 (Lecture Notes in Computer Science, 251) - Softcover
Synopsis
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.
"synopsis" may belong to another edition of this title.
Search results for Unobstructed Shortest Paths in Polyhedral Environments:...
Stock Image
Unobstructed Shortest Paths in Polyhedral Environments (Lecture Notes in Computer Science)
Seller: Powell's Bookstores Chicago, ABAA, Chicago, IL, U.S.A.
Seller rating 5 out of 5 stars
Condition: Used - Very Good. 1987. Paperback. Some shelf-wear. Very Good. Seller Inventory # SON000000808
Quantity: 1 available
Stock Image
Unobstructed Shortest Paths in Polyhedral Environments
Seller: Majestic Books, Hounslow, United Kingdom
Seller rating 5 out of 5 stars
Condition: Used. 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. Seller Inventory # 5837113
Quantity: 1 available
Stock Image
Unobstructed Shortest Paths in Polyhedral Environments
Seller: Books Puddle, New York, NY, U.S.A.
Seller rating 4 out of 5 stars
Condition: Used. pp. 116. Seller Inventory # 263059430
Quantity: 1 available
Stock Image
Unobstructed Shortest Paths in Polyhedral Environments (Lecture Notes in Computer Science, 251)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9783540176299_new
Quantity: Over 20 available
Stock Image
Unobstructed Shortest Paths in Polyhedral Environments
Seller: Chiron Media, Wallingford, United Kingdom
Seller rating 4 out of 5 stars
PF. Condition: New. Seller Inventory # 6666-IUK-9783540176299
Quantity: 10 available
Stock Image
Unobstructed Shortest Paths in Polyhedral Environments
Seller: Biblios, Frankfurt am main, HESSE, Germany
Seller rating 5 out of 5 stars
Condition: Used. pp. 116. Seller Inventory # 183059436
Quantity: 1 available
Stock Image
Unobstructed Shortest Paths in Polyhedral Environments (Lecture Notes in Computer Science)
Seller: GuthrieBooks, Spring Branch, TX, U.S.A.
Seller rating 5 out of 5 stars
Paperback. Condition: Very Good. 0387176292 Ex-library paperback in very nice condition with the usual markings and attachments. Seller Inventory # DA1411404
Quantity: 1 available
Seller Image
Unobstructed Shortest Paths in Polyhedral Environments
Published by
Springer Berlin Heidelberg, 1987
ISBN 10: 3540176292
ISBN 13: 9783540176299
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783540176299
Quantity: 1 available
Seller Image
Unobstructed Shortest Paths in Polyhedral Environments
Published by
Springer Berlin Heidelberg, 1987
ISBN 10: 3540176292
ISBN 13: 9783540176299
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: 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. Seller Inventory # 4883489
Quantity: Over 20 available
Seller Image
Unobstructed Shortest Paths in Polyhedral Environments
Published by
Springer Berlin Heidelberg Mrz 1987, 1987
ISBN 10: 3540176292
ISBN 13: 9783540176299
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783540176299
Quantity: 2 available