Unobstructed Shortest Paths in Polyhedral Environments - Lecture Notes in Computer Science - Varol Akman - 图书 - Springer-Verlag Berlin and Heidelberg Gm - 9783540176299 - 1987年3月11日
如封面与标题不符，以标题为准

Varol Akman
Unobstructed Shortest Paths in Polyhedral Environments - Lecture Notes in Computer Science 1987 edition

价格
元 372
不含税

远程仓调货

预计送达时间 年7月21日 - 年7月31日

顾客评价：

根据欧洲消费者保护法享受14天退换货政策
Trustpilot平台高分认证
添加至iMusic心愿单

Not rated yet

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.

106 pages, biography

介质类型 图书     Paperback Book   (平装胶订图书)
已发行 1987年3月11日
ISBN13 9783540176299
出版商 Springer-Verlag Berlin and Heidelberg Gm
页数 106
商品尺寸 156 × 234 × 6 mm   ·   172 g
语言 英语  

Mere med samme udgiver

查看Varol Akman的全部作品 ( 例如 Paperback Book 及 Hardcover Book )