The Complexity of Robot Motion Planning

The Complexity of Robot Motion Planning
Author :
Publisher : MIT Press
Total Pages : 220
Release :
ISBN-10 : 0262031361
ISBN-13 : 9780262031363
Rating : 4/5 (363 Downloads)

Book Synopsis The Complexity of Robot Motion Planning by : John Canny

Download or read book The Complexity of Robot Motion Planning written by John Canny and published by MIT Press. This book was released on 1988 with total page 220 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.


The Complexity of Robot Motion Planning Related Books

The Complexity of Robot Motion Planning
Language: en
Pages: 220
Authors: John Canny
Categories: Computers
Type: BOOK - Published: 1988 - Publisher: MIT Press

GET EBOOK

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
Language: en
Pages: 545
Authors: Kevin M. Lynch
Categories: Computers
Type: BOOK - Published: 2017-05-25 - Publisher: Cambridge University Press

GET EBOOK

A modern and unified treatment of the mechanics, planning, and control of robots, suitable for a first course in robotics.
Robot Motion Planning and Control
Language: en
Pages: 366
Authors: Jean-Paul Laumond
Categories: Technology & Engineering
Type: BOOK - Published: 1998 - Publisher: Springer

GET EBOOK

Content Description #Includes bibliographical references.
Planning Algorithms
Language: en
Pages: 844
Authors: Steven M. LaValle
Categories: Computers
Type: BOOK - Published: 2006-05-29 - Publisher: Cambridge University Press

GET EBOOK

Planning algorithms are impacting technical disciplines and industries around the world, including robotics, computer-aided design, manufacturing, computer grap
Robot Motion Planning
Language: en
Pages: 668
Authors: Jean-Claude Latombe
Categories: Technology & Engineering
Type: BOOK - Published: 2012-12-06 - Publisher: Springer Science & Business Media

GET EBOOK

One of the ultimate goals in Robotics is to create autonomous robots. Such robots will accept high-level descriptions of tasks and will execute them without fur