ABSTRACT
Algorithms that control the computational processes relating sensors and actuators are indispensable for robot navigation and the perception of the world in which they move. Therefore, a deep understanding of how algorithms work to achieve this control is essential for the development of efficient and usable robots in a broad field of applications.
TABLE OF CONTENTS
chapter |8 pages
Meso-Scale Self-Assembly
part |1 pages
Controlled Module Density Helps Reconfiguration Planning
part |2 pages
References
chapter |14 pages
Positioning Symmetric and Non-Symmetric Parts using Radial and Constant Force Fields
chapter |8 pages
Complete Distributed Coverage of Rectilinear Environments
part |2 pages
Closed-Loop Distributed Manipulation Using Discrete Actuator Arrays
chapter |10 pages
Kinematic Tolerance Analysis with Configuration Spaces
chapter |4 pages
Deformable Free Space Tilings for Kinetic Collision Detection
chapter |3 pages
Real-time Global Deformations
chapter |16 pages
Motion Planning for Kinematic Stratified Systems with Application to Quasi-Static Legged Locomotion and Finger Gaiting
part |2 pages
References
chapter |11 pages
Manipulation of Pose Distributions
chapter |14 pages
Image Guided Surgery
chapter |4 pages
Pulling Motion Based Tactile Sensing
part 6|2 pages
Conclusions
chapter |12 pages
Compensatory Grasping with the Parallel Jaw Gripper
chapter |8 pages
Optimal Planning for Coordinated Vehicles
part |2 pages
Acknowledgments
chapter |14 pages
An Efficient Approximation Algorithm for Weighted Region Shortest Path Problem
chapter |16 pages
Synthesis and Regulation of Cyclic Behaviors
chapter |6 pages
A Framework for Steering Dynamic Robotic Locomotion Systems J. P. Ostrowski and K. A . M clsaac
chapter |9 pages
A Kinematics-Based Probabilistic Roadmap Method for Closed Chain Systems
part |2 pages
Randomized Kinodynamic Motion Planning with Moving Obstacles
chapter |10 pages
to be compu-
chapter |12 pages
On Random Sampling in Contact Configuration Space
part |2 pages
Method CF dof time(s) CF dof time(s) Direct {f-f}, Figure 12(a) 3 0.23 {e-f}, Figure 12(b) 4 0.25 Direct {v-f}, Figure 12(c) 5 0.45 {e-e-c}, Figure 12(d) 5 0.45 Direct {f-f, f-f}, Figure 13(a) 16.7 {e-f, f-f}, Figure 13(b) 13.5 Hybrid {e-f, f-f}, Figure 13(c) 23.3 or 3.4 {e-e-c, f-f}, Figure 13(d) 23.7 or 3.8 Hybrid {e-f, e-f}, Figure 13(e) 2 49.5 or 54.6 {e-f, f-e}, Figure 13(f) 2 61.1 or 56.1 Hybrid {v-f, e-f}, Figure 13(g) 3 50.4 or 50.9 {v-f, v-f}, Figure 13(h) 4 34.7 or 40.4
chapter |3 pages
Randomized Path Planning for a Rigid Body Based on Hardware Accelerated Voronoi Sampling
part 3|2 pages
Path Planning Based on Discretized
chapter |5 pages
Rapidly-Exploring Random Trees: Progress and Prospects
part X|1 pages
is
part |2 pages
Encoders for Spherical Motion Using Discrete Optical Sensors
chapter |12 pages
Notes on Visibility Roadmaps and Path Planning
chapter |12 pages
AutoBalancer: An Online Dynamic Balance Compensation Scheme for Humanoid Robots
chapter |7 pages
Coupled Oscillators for Legged Robots
part |1 pages
References
chapter |3 pages
Reliable Mobile Robot Navigation From Unreliable Visual Cues
part 3|2 pages
2 Exploration and Navigation