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

$ 33.32

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

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.