Book Overview
Robot motion planning has become a major focus of robotics. Research findings can be applied not only to robotics but to planning routes on circuit boards, directing digital actors in computer graphics, robot-assisted surgery and medicine, and in novel areas such as drug design and protein folding. This text reflects the great advances that have taken place in the last ten years, including sensor-based planning, probabalistic planning, localization and mapping, and motion planning for dynamic and nonholonomic systems. Its presentation makes the mathematical underpinnings of robot motion accessible to students of computer science and engineering, rleating low-level implementation details to high-level algorithmic concepts.
Table of Contents
1- Introduction
2- Bug Algorithms
3- Configuration Space
4- Potential Functions
5- Roadmaps
6- Cell Decomposition
7- Sampling-Based Algorithms
8- Kalman Filtering
9- Bayesian Methods
10- Robot Dynamics
11- Trajectory Planning
12- Nonholonomic and Underactuated Systems
Download
You can download this book from any of the following links. If any link is dead please feel free to leave a comment.
LINK 1
LINK 2
Copyright Disclaimer
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.
Robot motion planning has become a major focus of robotics. Research findings can be applied not only to robotics but to planning routes on circuit boards, directing digital actors in computer graphics, robot-assisted surgery and medicine, and in novel areas such as drug design and protein folding. This text reflects the great advances that have taken place in the last ten years, including sensor-based planning, probabalistic planning, localization and mapping, and motion planning for dynamic and nonholonomic systems. Its presentation makes the mathematical underpinnings of robot motion accessible to students of computer science and engineering, rleating low-level implementation details to high-level algorithmic concepts.
Table of Contents
1- Introduction
2- Bug Algorithms
3- Configuration Space
4- Potential Functions
5- Roadmaps
6- Cell Decomposition
7- Sampling-Based Algorithms
8- Kalman Filtering
9- Bayesian Methods
10- Robot Dynamics
11- Trajectory Planning
12- Nonholonomic and Underactuated Systems
Download
You can download this book from any of the following links. If any link is dead please feel free to leave a comment.
LINK 1
LINK 2
Copyright Disclaimer
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.
Tidak ada komentar:
Posting Komentar