• Title: Planning Algorithms
• Author(s) Steven M. LaValle
• Publisher: Cambridge University Press (May 29, 2006)
• Hardcover: 842 pages
• eBook: HTML and PDF
• Language: English
• ISBN-10: 0521862051
• ISBN-13: 978-0521862059
• Share This:  

Book Description

This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics.

The particular subjects covered include motion planning, discrete planning, planning under uncertainty, sensor-based planning, visibility, decision-theoretic planning, game theory, information spaces, reinforcement learning, nonlinear systems, trajectory planning, nonholonomic planning, and kinodynamic planning.

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.

• Steven M. LaValle is Associate Professor of Computer Science at the University of Illinois at Urbana-Champaign.

• Amazon

• Artificial Intelligence, Machine Learning, and Logic Programming
• Operations Research (OR) and Optimization
• Algorithms and Data Structures
• Control Theory, Robust, and Automation
• Computer and Video Game Development and Programming

• Planning Algorithms (Steven M. LaValle)
• The Mirror Site (1) - PDF
• The Mirror Site (2) - PDF

• Algorithms for Optimization (Mykel J. Kochenderfer, et al.)

  A comprehensive introduction to optimization with a focus on practical algorithms for the design of engineering systems. Readers will learn about computational approaches for a range of challenges.

• Sine Cosine Algorithm for Optimization (Jagdish Bansal, et al.)

  This book serves as a compact source of information on sine cosine algorithm (SCA) and a foundation for developing and advancing SCA and its applications. SCA is an easy, user-friendly, and strong candidate in the field of Metaheuristics algorithms.

• Design of Heuristic Algorithms for Hard Optimization

  This open access book demonstrates all the steps required to design heuristic algorithms for difficult optimization. The classic problem of the travelling salesman is used as a common thread to illustrate all the techniques discussed.

• Algorithms for Decision Making (Mykel Kochenderfer, et al)

  This textbook provides a broad introduction to algorithms for decision making under uncertainty, covering the underlying mathematical problem formulations and the algorithms for solving them.

• Clever Algorithms: Nature-Inspired Programming Recipes

  The book describes 45 algorithms from the field of Artificial Intelligence. All algorithm descriptions are complete and consistent to ensure that they are accessible, usable and understandable by a wide audience.

• The Design of Approximation Algorithms (D. P. Williamson)

  This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions, including greedy and local search algorithms, dynamic programming, linear and semidefinite programming, and randomization, etc.

• Parallel Algorithms (Henri Casanova, et al)

  Focusing on algorithms for distributed-memory parallel architectures, the book extracts fundamental ideas and algorithmic principles from the mass of parallel algorithm expertise and practical implementations developed over the last few decades.

• Numerical Algorithms: Computer Vision, Machine Learning, etc.

  This book presents a new approach to numerical analysis for modern computer scientists, covers a wide range of topics - from numerical linear algebra to optimization and differential equations - focusing on real-world motivation and unifying themes.

• Graph Algorithms: Practical Examples in Apache Spark and Neo4j

  This book is a practical guide to getting started with graph algorithms for developers and data scientists who have experience using Apache Spark or Neo4j. You'll walk through hands-on examples that show you how to use graph algorithms in Apache Spark/Neo4j.

• Notes on Randomized Algorithms (James Aspnes)

  This book introduces the basic concepts in the design and analysis of randomized algorithms. Discusses tools from probability theory, including random variables and expectations, union bound arguments, concentration bounds, martingales, etc.