Unobstructed shortest paths in polyhedral environments
著者
書誌事項
Unobstructed shortest paths in polyhedral environments
（Lecture notes in computer science, 251）
Springer-Verlag, c1987
- : gw
- : us
大学図書館所蔵 件 / 全55件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
この図書・雑誌をさがす
注記
Based on the author's thesis (Ph. D.)--Rensselaer Polytechnic Institute, 1985
Bibliography: p. [93]-103
内容説明・目次
内容説明
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.
目次
Solution of the general instance of FINDPATH.- Solutions of two specific instances of FINDPATH.- Two Voronoi-based techniques for FINDPATH.- Desirable functionalities of a geometer's workbench.- Conclusion and future work.
「Nielsen BookData」 より