<電子ブック>
Unobstructed Shortest Paths in Polyhedral Environments / by Varol Akman
(Lecture Notes in Computer Science. ISSN:16113349 ; 251)
版 | 1st ed. 1987. |
---|---|
出版者 | Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer |
出版年 | 1987 |
本文言語 | 英語 |
大きさ | X, 106 p : online resource |
著者標目 | *Akman, Varol author SpringerLink (Online service) |
件 名 | LCSH:Computer graphics LCSH:Computer simulation LCSH:Artificial intelligence FREE:Computer Graphics FREE:Computer Modelling FREE:Artificial Intelligence |
一般注記 | 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 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 HTTP:URL=https://doi.org/10.1007/3-540-17629-2 |
目次/あらすじ
所蔵情報を非表示
電子ブック | 配架場所 | 資料種別 | 巻 次 | 請求記号 | 状 態 | 予約 | コメント | ISBN | 刷 年 | 利用注記 | 指定図書 | 登録番号 |
---|---|---|---|---|---|---|---|---|---|---|---|---|
電子ブック | オンライン | 電子ブック |
|
|
Springer eBooks | 9783540477310 |
|
電子リソース |
|
EB00225048 |