The Complexity of Robot Motion Planning pdf epub mobi txt 電子書 下載 2024


The Complexity of Robot Motion Planning

簡體網頁||繁體網頁
Canny, John F.
1988-6
216
$ 45.20
9780262031363

圖書標籤: 美國  澳大利亞  機器人學  人工智能  John_Canny  CS   


喜歡 The Complexity of Robot Motion Planning 的讀者還喜歡




點擊這裡下載
    


想要找書就要到 小哈圖書下載中心
立刻按 ctrl+D收藏本頁
你會得到大驚喜!!

发表于2024-12-25

The Complexity of Robot Motion Planning epub 下載 mobi 下載 pdf 下載 txt 電子書 下載 2024

The Complexity of Robot Motion Planning epub 下載 mobi 下載 pdf 下載 txt 電子書 下載 2024

The Complexity of Robot Motion Planning pdf epub mobi txt 電子書 下載 2024



圖書描述

The Complexity of Robot Motion Planning makes original contributions both to robotics and to the analysis of algorithms. In this groundbreaking monograph John Canny resolves long-standing problems concerning the complexity of motion planning and, for the central problem of finding a collision free path for a jointed robot in the presence of obstacles, obtains exponential speedups over existing algorithms by applying high-powered new mathematical techniques.Canny's new algorithm for this "generalized movers' problem," the most-studied and basic robot motion planning problem, has a single exponential running time, and is polynomial for any given robot. The algorithm has an optimal running time exponent and is based on the notion of roadmaps - one-dimensional subsets of the robot's configuration space. In deriving the single exponential bound, Canny introduces and reveals the power of two tools that have not been previously used in geometric algorithms: the generalized (multivariable) resultant for a system of polynomials and Whitney's notion of stratified sets. He has also developed a novel representation of object orientation based on unnormalized quaternions which reduces the complexity of the algorithms and enhances their practical applicability.After dealing with the movers' problem, the book next attacks and derives several lower bounds on extensions of the problem: finding the shortest path among polyhedral obstacles, planning with velocity limits, and compliant motion planning with uncertainty. It introduces a clever technique, "path encoding," that allows a proof of NP-hardness for the first two problems and then shows that the general form of compliant motion planning, a problem that is the focus of a great deal of recent work in robotics, is non-deterministic exponential time hard. Canny proves this result using a highly original construction.John Canny received his doctorate from MIT And is an assistant professor in the Computer Science Division at the University of California, Berkeley. The Complexity of Robot Motion Planning is the winner of the 1987 ACM Doctoral Dissertation Award.

The Complexity of Robot Motion Planning 下載 mobi epub pdf txt 電子書

著者簡介


圖書目錄


The Complexity of Robot Motion Planning pdf epub mobi txt 電子書 下載
想要找書就要到 小哈圖書下載中心
立刻按 ctrl+D收藏本頁
你會得到大驚喜!!

用戶評價

評分

評分

評分

評分

評分

讀後感

評分

評分

評分

評分

評分

類似圖書 點擊查看全場最低價

The Complexity of Robot Motion Planning pdf epub mobi txt 電子書 下載 2024


分享鏈接





相關圖書




本站所有內容均為互聯網搜索引擎提供的公開搜索信息,本站不存儲任何數據與內容,任何內容與數據均與本站無關,如有需要請聯繫相關搜索引擎包括但不限於百度google,bing,sogou

友情鏈接

© 2024 qciss.net All Rights Reserved. 小哈圖書下載中心 版权所有