Robot Motion Planning: Edition en anglais
Springer Science & Business Media, 1991 - 651 páginas
One of the ultimate goals in Robotics is to create autonomous robots. Such robots will accept high-level descriptions of tasks and will execute them without further human intervention. The input descriptions will specify what the user wants done rather than how to do it. The robots will be any kind of versatile mechanical device equipped with actuators and sensors under the control of a computing system. Making progress toward autonomous robots is of major practical inter est in a wide variety of application domains including manufacturing, construction, waste management, space exploration, undersea work, as sistance for the disabled, and medical surgery. It is also of great technical interest, especially for Computer Science, because it raises challenging and rich computational issues from which new concepts of broad useful ness are likely to emerge. Developing the technologies necessary for autonomous robots is a formidable undertaking with deep interweaved ramifications in auto mated reasoning, perception and control. It raises many important prob lems. One of them - motion planning - is the central theme of this book. It can be loosely stated as follows: How can a robot decide what motions to perform in order to achieve goal arrangements of physical objects? This capability is eminently necessary since, by definition, a robot accomplishes tasks by moving in the real world. The minimum one would expect from an autonomous robot is the ability to plan its x Preface own motions.
Comentarios de usuarios - Escribir una reseña
No hemos encontrado ninguna reseña en los lugares habituales.
Introduction and Overview
Configuration Space of a Rigid Object
Obstacles in Configuration Space
Exact Cell Decomposition
Approximate Cell Decomposition
Potential Field Methods
Multiple Moving Objects
Dealing with Uncertainty
Otras ediciones - Ver todo
adjacent algebraic algorithm angle approach assume axis backprojection boundary bounded C-obstacle region C/ree called car-like robot cell decomposition Chapter Cjree commanded velocity computed cone configuration q configuration space connectivity graph consider consists constraints constructed contained convex polygons coordinates corresponding critical curves Cvaiid decomposed defined denote described dimension endpoints example exists finite number force free path free space freeway goal configuration grasp Hence illustrates intersection interval Latombe line segment local minimum Lozano-Perez M-channel MIXED cell motion command motion planning problem movable object moving nodes nonholonomic obstacles orientation path planning plane planner planning method polygonal region polynomial position potential field potential function preimage projection qfloa qgoai quadtree rectangloid represented repulsive potential resp rotation Section semi-algebraic semi-algebraic sets sequence Sharir shown in Figure strategy subset tangent tangent space techniques termination condition tion topological space topology translate two-dimensional vector vertex visibility graph Voronoi diagram workspace
Página 641 - Force Feedback Control of Manipulator Fine Motions," ASME Journal of Dynamic Systems, Measurement, and Control, June 1977, pp.
Computational Geometry: Algorithms and Applications
Mark de Berg
Vista previa restringida - 2008
Todos los resultados de la Búsqueda de libros »
Directed Sonar Sensing for Mobile Robot Navigation
John J. Leonard,Hugh F. Durrant-Whyte
No hay vista previa disponible - 1992