Planning Algorithms

ISBN-10: 0521862051

ISBN-13: 9780521862059

Edition: 2006

Authors: Steven M. LaValle

List price: $103.00 Buy it from $96.17
eBook available
This item qualifies for FREE shipping

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

30 day, 100% satisfaction guarantee

If an item you ordered from TextbookRush does not meet your expectations due to an error on our part, simply fill out a return request and then return it by mail within 30 days of ordering it for a full refund of item cost.

Learn more about our returns policy

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. This coherent and comprehensive book unifies material from several sources, including robotics, control theory, artificial intelligence, and algorithms. The treatment is centered on robot motion planning but integrates material on planning in discrete spaces. A major part of the book is devoted to planning under uncertainty, including decision theory, Markov decision processes, and information spaces, which are the "configuration spaces" of all sensor-based planning problems. The last part of the book delves into planning under differential constraints that arise when automating the motions of virtually any mechanical system.
New Starting from $99.96
eBooks Starting from $80.00
Buy eBooks
what's this?
Rush Rewards U
Members Receive:
coins
coins
You have reached 400 XP and carrot coins. That is the daily max!
Study Briefs

Limited time offer: Get the first one free! (?)

All the information you need in one place! Each Study Brief is a summary of one specific subject; facts, figures, and explanations to help you learn faster.

Add to cart
Study Briefs
Periodic Table Online content $4.95 $1.99
Add to cart
Study Briefs
Calculus 1 Online content $4.95 $1.99
Add to cart
Study Briefs
SQL Online content $4.95 $1.99
Add to cart
Study Briefs
MS Excel® 2010 Online content $4.95 $1.99
Customers also bought
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading

Book details

List price: $103.00
Copyright year: 2006
Publisher: Cambridge University Press
Publication date: 5/29/2006
Binding: Hardcover
Pages: 844
Size: 7.00" wide x 10.25" long x 1.75" tall
Weight: 3.432
Language: English

Steven M. LaValle is Associate Professor of Computer Science at the University of Illinois at Urbana-Champaign. He has worked in motion planning and robotics for over a decade and is a leading researcher who has published dozens of articles in the field. He is the main developer of the Rapidly-exploring Random Tree (RRT) algorithm, which has been used in numerous research labs and industrial products around the world. He has taught material on which the book is based at Stanford University, Iowa State University, the Tec de Monterrey, and the University of Illinois.

Preface
Introductory Material
Introduction
Planning to plan
Motivational examples and applications
Basic ingredients of planning
Algorithms, planners, and plans
Organization of the book
Discrete Planning
Introduction to discrete feasible planning
Searching for feasible plans
Discrete optimal planning
Using logic to formulate discrete planning
Logic-based planning methods
Motion Planning
Geometric Representations and Transformations
Geometric modeling
Rigid-body transformations
Transforming kinematic chains of bodies
Transforming kinematic trees
Nonrigid transformations
The Configuration Space
Basic topological concepts
Defining the configuration space
Configuration space obstacles
Closed kinematic chains
Sampling-Based Motion Planning
Distance and volume in C-space
Sampling theory
Collision detection
Incremental sampling and searching
Rapidly exploring dense trees
Roadmap methods for multiple queries
Combinatorial Motion Planning
Introduction
Polygonal obstacle regions
Cell decompositions
Computational algebraic geometry
Complexity of motion planning
Extensions of Basic Motion Planning
Time-varying problems
Multiple robots
Mixing discrete and continuous spaces
Planning for closed kinematic chains
Folding problems in robotics and biology
Coverage planning
Optimal motion planning
Feedback Motion Planning
Motivation
Discrete state spaces
Vector fields and integral curves
Complete methods for continuous spaces
Sampling-based methods for continuous spaces
Decision-Theoretic Planning
Basic Decision Theory
Preliminary concepts
A game against nature
Two-player zero-sum games
Nonzero-sum games
Decision theory under scrutiny
Sequential Decision Theory
Introducing sequential games against nature
Algorithms for computing feedback plans
Infinite-horizon problems
Reinforcement learning
Sequential game theory
Continuous state spaces
Sensors and Information Spaces
Discrete state spaces
Derived information spaces
Examples for discrete state spaces
Continuous state spaces
Examples for continuous state spaces
Computing probabilistic information states
Information spaces in game theory
Planning Under Sensing Uncertainty
General methods
Localization
Environment uncertainty and mapping
Visibility-based pursuit-evasion
Manipulation planning with sensing uncertainty
Planning Under Differential Constraints
Differential Models
Velocity constraints on the configuration space
Phase space representation of dynamical systems
Basic Newton-Euler mechanics
Advanced mechanics concepts
Multiple decision makers
Sampling-Based Planning Under Differential Constraints
Introduction
Reachability and completeness
Sampling-based motion planning revisited
Incremental sampling and searching methods
Feedback planning under differential constraints
Decoupled planning approaches
Gradient-based trajectory optimization
System Theory and Analytical Techniques
Basic system properties
Continuous-time dynamic programming
Optimal paths for some wheeled vehicles
Nonholonomic system theory
Steering methods for nonholonomic systems
Bibliography
Index
Free shipping on orders over $35*

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

Learn more about the TextbookRush Marketplace.

×