The Complexity of Robot Motion Planning

preview-18
  • The Complexity of Robot Motion Planning Book Detail

  • Author : John Canny
  • Release Date : 1988
  • Publisher : MIT Press
  • Genre : Computers
  • Pages : 220
  • ISBN 13 : 9780262031363
  • File Size : 24,24 MB

The Complexity of Robot Motion Planning by John Canny PDF Summary

Book Description: The Complexity of Robot Motion Planning makes original contributions both to roboticsand to the analysis of algorithms. In this groundbreaking monograph John Canny resolveslong-standing problems concerning the complexity of motion planning and, for the central problem offinding a collision free path for a jointed robot in the presence of obstacles, obtains exponentialspeedups over existing algorithms by applying high-powered new mathematical techniques.Canny's newalgorithm for this "generalized movers' problem," the most-studied and basic robot motion planningproblem, has a single exponential running time, and is polynomial for any given robot. The algorithmhas an optimal running time exponent and is based on the notion of roadmaps - one-dimensionalsubsets of the robot's configuration space. In deriving the single exponential bound, Cannyintroduces and reveals the power of two tools that have not been previously used in geometricalgorithms: the generalized (multivariable) resultant for a system of polynomials and Whitney'snotion of stratified sets. He has also developed a novel representation of object orientation basedon unnormalized quaternions which reduces the complexity of the algorithms and enhances theirpractical applicability.After dealing with the movers' problem, the book next attacks and derivesseveral lower bounds on extensions of the problem: finding the shortest path among polyhedralobstacles, planning with velocity limits, and compliant motion planning with uncertainty. Itintroduces a clever technique, "path encoding," that allows a proof of NP-hardness for the first twoproblems and then shows that the general form of compliant motion planning, a problem that is thefocus of a great deal of recent work in robotics, is non-deterministic exponential time hard. Cannyproves this result using a highly original construction.John Canny received his doctorate from MITAnd 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 DoctoralDissertation Award.

Disclaimer: www.yourbookbest.com does not own The Complexity of Robot Motion Planning books pdf, neither created or scanned. We just provide the link that is already available on the internet, public domain and in Google Drive. If any way it violates the law or has any issues, then kindly mail us via contact us page to request the removal of the link.

The Complexity of Robot Motion Planning

The Complexity of Robot Motion Planning

File Size : 92,92 MB
Total View : 6772 Views
DOWNLOAD

The Complexity of Robot Motion Planning makes original contributions both to roboticsand to the analysis of algorithms. In this groundbreaking monograph John Ca

Modern Robotics

Modern Robotics

File Size : 48,48 MB
Total View : 9813 Views
DOWNLOAD

A modern and unified treatment of the mechanics, planning, and control of robots, suitable for a first course in robotics.

Planning Algorithms

Planning Algorithms

File Size : 11,11 MB
Total View : 8287 Views
DOWNLOAD

Planning algorithms are impacting technical disciplines and industries around the world, including robotics, computer-aided design, manufacturing, computer grap

Practical Motion Planning in Robotics

Practical Motion Planning in Robotics

File Size : 51,51 MB
Total View : 4821 Views
DOWNLOAD

Practical Motion Planning in Robotics Current Approaches and Future Directions Edited by Kamal Gupta Simon Fraser University, Burnaby, Canada Angel P. del Pobil