书目名称 | Unobstructed Shortest Paths in Polyhedral Environments |
编辑 | Varol Akman |
视频video | |
丛书名称 | Lecture Notes in Computer Science |
图书封面 |  |
描述 | .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.. |
出版日期 | Book 1987 |
关键词 | function; techniques |
版次 | 1 |
doi | https://doi.org/10.1007/3-540-17629-2 |
isbn_softcover | 978-3-540-17629-9 |
isbn_ebook | 978-3-540-47731-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 |
issn_series | 0302-9743 |
copyright | Springer-Verlag Berlin Heidelberg 1987 |