Logo

Planning Algorithms by Steven M. LaValle

Large book cover: Planning Algorithms

Planning Algorithms
by

Publisher: Cambridge University Press
ISBN/ASIN: B003UT48GK
Number of pages: 842

Description:
Planning algorithms are impacting technical disciplines and industries around the world, including robotics, computer-aided design, manufacturing, computer graphics, aerospace applications, drug design, and protein folding. Written for computer scientists and engineers with interests in artificial intelligence, robotics, or control theory, this is the only book on this topic that tightly integrates a vast body of literature from several fields into a coherent source for teaching and reference in a wide variety of applications. Difficult mathematical material is explained through hundreds of examples and illustrations.

Home page url

Download or read it online for free here:
Download link
(13.2MB, PDF)

Similar books

Book cover: Average Case Analysis of Algorithms on SequencesAverage Case Analysis of Algorithms on Sequences
by - Wiley-Interscience
A book on a topic that has witnessed a surge of interest over the last decade, owing in part to several novel applications in data compression and computational molecular biology. It describes methods employed in average case analysis of algorithms.
(7260 views)
Book cover: Algorithms for Modular Elliptic CurvesAlgorithms for Modular Elliptic Curves
by - Cambridge University Press
The author describes the construction of modular elliptic curves giving an algorithm for their computation. Then algorithms for the arithmetic of elliptic curves are presented. Finally, the results of the implementations of the algorithms are given.
(10646 views)
Book cover: Knapsack Problems: Algorithms and Computer ImplementationsKnapsack Problems: Algorithms and Computer Implementations
by - John Wiley & Sons
The book on exact and approximate algorithms for a number of important problems in the field of integer linear programming, which the authors refer to as 'knapsack'. Includes knapsack problems such as binary, bounded, unbounded or binary multiple.
(11248 views)
Book cover: Greedy AlgorithmsGreedy Algorithms
by - InTech
Each chapter comprises a separate study on some optimization problem giving both an introductory look into the theory the problem comes from and some new developments invented by authors. Usually some elementary knowledge is assumed.
(9405 views)