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

$ 33.32

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

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.