Unobstructed Shortest Paths in Polyhedral Environments, Paperback by Akman, V...

$ 33.32

Publisher: Springer Berlin / Heidelberg ISBN: 9783540176299 width: 6.1 in Author: Varol Akman Type: Textbook Publication Year: 1987 Publication Name: Unobstructed Shortest Paths in Polyhedral Environments Series: Lecture Notes in Computer Science Ser. Number of Pages: X, 106 Pages Language: English Item Weight: 16 Oz Subject Area: Computers Item Width: 6.1 in Book Title: Unobstructed Shortest Paths in Polyhedral Environments Format: Trade Paperback Subject: Computer Graphics, Intelligence (Ai) & Semantics, Computer Simulation Item Length: 9.3 in

Description

Unobstructed Shortest Paths in Polyhedral Environments, Paperback by Akman, V.... Unobstructed Shortest Paths in Polyhedral Environments, Paperback by Akman, Varol, ISBN 3540176292, ISBN-13 9783540176299, Like New Used, Free shipping in the US 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. Unobstructed Shortest Paths in Polyhedral Environments, Paperback by Akman, Varol, ISBN 3540176292, ISBN-13 9783540176299, Like New Used, Free shipping in the US 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.