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. Developed from courses taught by the author, the book is intended for students, engineers, and researchers in robotics, artificial intelligence, and control theory as well as computer graphics, algorithms, and computational biology.

Planning Algorithms: Introductory Material

Mobile robots range from the Mars Pathfinder mission's teleoperated Sojourner to the cleaning robots in the Paris Metro. This text offers students and other interested readers an introduction to the fundamentals of mobile robotics, spanning the mechanical, motor, sensory, perceptual, and cognitive layers the field comprises. The text focuses on mobility itself, offering an overview of the mechanisms that allow a mobile robot to move through a real world environment to perform its tasks, including locomotion, sensing, localization, and motion planning. It synthesizes material from such fields as kinematics, control theory, signal analysis, computer vision, information theory, artificial intelligence, and probability theory. The book presents the techniques and technology that enable mobility in a series of interacting modules. Each chapter treats a different aspect of mobility, as the book moves from low-level to high-level details. It covers all aspects of mobile robotics, including software and hardware design considerations, related technologies, and algorithmic techniques.] This second edition has been revised and updated throughout, with 130 pages of new material on such topics as locomotion, perception, localization, and planning and navigation. Problem sets have been added at the end of each chapter. Bringing together all aspects of mobile robotics into one volume, Introduction to Autonomous Mobile Robots can serve as a textbook or a working tool for beginning practitioners.

http://www.gbv.de/dms/hebis-darmstadt/toc/120387220.pdf

Introduction to Autonomous Mobile Robots

A real-time obstacle avoidance method for mobile robots which has been developed and implemented is described. This method, named the vector field histogram (VFH), permits the detection of unknown obstacles and avoids collisions while simultaneously steering the mobile robot toward the target. The VFH method uses a two-dimensional Cartesian histogram grid as a world model. This world model is updated continuously with range data sampled by onboard range sensors. The VFH method subsequently uses a two-stage data-reduction process to compute the desired control commands for the vehicle. Experimental results from a mobile robot traversing densely cluttered obstacle courses in smooth and continuous motion and at an average speed of 0.6-0.7 m/s are shown. A comparison of the VFN method to earlier methods is given. >

/pdf/the-vector-field-histogram-fast-obstacle-avoidance-for-43ecwz5uqy.pdf

The vector field histogram-fast obstacle avoidance for mobile robots

This paper is devoted to the permanence of the concept of Zero-Moment Point, widelyknown by the acronym ZMP. Thirty-five years have elapsed since its implicit presentation (actually before being named ZMP) to the scientific community and thirty-three years since it was explicitly introduced and clearly elaborated, initially in the leading journals published in English. Its first practical demonstration took place in Japan in 1984, at Waseda University, Laboratory of Ichiro Kato, in the first dynamically balanced robot WL-10RD of the robotic family WABOT. The paper gives an in-depth discussion of source results concerning ZMP, paying particular attention to some delicate issues that may lead to confusion if this method is applied in a mechanistic manner onto irregular cases of artificial gait, i.e. in the case of loss of dynamic balance of a humanoid robot. After a short survey of the history of the origin of ZMP a very detailed elaboration of ZMP notion is given, with a special review concerning “boundary cases” when the ZMP is close to the edge of the support polygon and “fictious cases” when the ZMP should be outside the support polygon. In addition, the difference between ZMP and the center of pressure is pointed out. Finally, some unresolved or insufficiently treated phenomena that may yield a significant improvement in robot performance are considered.

https://www.techfak.uni-bielefeld.de/~rhaschke/lehre/WS04/humanoids/papers/zmp-review.pdf

Zero-moment point — thirty five years of its life

A text that makes the mathematical underpinnings of robot motion accessible and relates low-level details of implementation to high-level algorithmic concepts. 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.

Principles of Robot Motion: Theory, Algorithms, and Implementations

The problem of path planning for an automaton moving in a two-dimensional scene filled with unknown obstacles is considered. The automaton is presented as a point; obstacles can be of an arbitrary shape, with continuous boundaries and of finite size; no restriction on the size of the scene is imposed. The information available to the automaton is limited to its own current coordinates and those of the target position. Also, when the automaton hits an obstacle, this fact is detected by the automaton's "tactile sensor." This information is shown to be sufficient for reaching the target or concluding in finite time that the target cannot be reached. A worst-case lower bound on the length of paths generated by any algorithm operating within the framework of the accepted model is developed; the bound is expressed in terms of the perimeters of the obstacles met by the automaton in the scene. Algorithms that guarantee reaching the target (if the target is reachable), and tests for target reachability are presented. The efficiency of the algorithms is studied, and worst-case upper bounds on the length of generated paths are produced.

/pdf/path-planning-strategies-for-a-point-mobile-automaton-moving-320gnvt5i4.pdf

Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape

Sensitive skin is a large-area, flexible array of sensors with data processing capabilities, which can be used to cover the entire surface of a machine or even a part of a human body. Depending on the skin electronics, it endows its carrier with an ability to sense its surroundings via the skin’s proximity, touch, pressure, temperature, chemical/biological, or other sensors. Sensitive skin devices will make possible the use of unsupervised machines operating in unstructured, unpredictable surroundings—among people, among many obstacles, outdoors on a crowded street, undersea, or on faraway planets. Sensitive skin will make machines “cautious” and thus friendly to their environment. This will allow us to build machine helpers for the disabled and elderly, bring sensing to human prosthetics, and widen the scale of machines’ use in service industry. With their ability to produce and process massive data flow, sensitive skin devices will make yet another advance in the information revolution. This paper surveys the state of the art and research issues that need to be resolved in order to make sensitive skin a reality. The paper is partially based on the report of the Sensitive Skin Workshop conducted jointly by the National Science Foundation (NSF) and Defense Advanced Research Projects Agency (DARPA) in October 1999 in Arlington, VA, of which the three co-authors were the co-chairs [1].

Sensitive Skin

The problem of path planning is studied for the case of a mobile robot moving in an environment filled with obstacles whose shape and positions are not known. Under the accepted model, the automaton knows its own and the target coordinates, and has a "sensory" feedback which provides it with local information on its immediate surroundings. Ibis information is shown to be sufficient to guarantee reaching a global objective (the target), while generating reasonable (if not optimal) paths. A lower bound on the length of paths generated by any algorithm operating with uncertainty is formulated, and two nonheuristic path planning algorithms are described. In the algorithms, motion planning is done continuously (dynamically), based on the automaton's current position and on its feedback. The effect of additional sources of information (e.g., from a vision sensor) on the outlined approach is discussed.

/pdf/dynamic-path-planning-for-a-mobile-automaton-with-limited-c3niw1zbgv.pdf

Dynamic path planning for a mobile automaton with limited information on the environment

A wide variety of tactile (touch) sensors exist today for robotics and related applications. They make use of various transduction methods, smart materials and engineered structures, complex electronics, and sophisticated data processing. While highly useful in themselves, effective utilization of tactile sensors in robotics applications has been slow to come and largely remains elusive today. This paper surveys the state of the art and the research issues in this area, with the emphasis on effective utilization of tactile sensors in robotic systems. One specific with the use of tactile sensing in robotics is that the sensors have to be spread along the robot body, the way the human skin is-thus dictating varied 3-D spatio-temporal requirements, decentralized and distributed control, and handling of multiple simultaneous tactile contacts. Satisfying these requirements pose challenges to making tactile sensor modality a reality. Overcoming these challenges requires dealing with issues such as sensors placement, electronic/mechanical hardware, methods to access and acquire signals, automatic calibration techniques, and algorithms to process and interpret sensing data in real time. We survey this field from a system perspective, recognizing the fact that the system performance tends to depend on how its various components are put together. It is hoped that the survey will be of use to practitioners designing tactile sensing hardware (whole-body or large-patch sensor coverage), and to researchers working on cognitive robotics involving tactile sensing.

Directions Toward Effective Utilization of Tactile Skin: A Review

A model of mobile robot navigation is considered in which the robot is a point automaton operating in an environment with unknown obstacles of arbitrary shapes. The robot's input information includes its own and the target-points coordinates as well as local sensing information such as that from stereo vision or a range finder. These algorithmic issues are addressed: (1) Is it possible to combine sensing and planning functions to produce 'active sensing' guided by the needs of planning? (The answer is yes). (2) Can richer sensing (e.g., stereo vision versus tactile) guarantee better performance, that is, resulting in shorter paths? (The general answer is no). A paradigm for combining range data with motion planning is presented. It turns out that extensive modifications of simpler tactile algorithms are needed to take full advantage of additional sensing capabilities. Two algorithms that guarantee convergence and exhibit different styles of behavior are described, and their performance is demonstrated in simulated examples. >

Vladimir J. Lumelsky

Papers

Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape

Sensitive Skin

Dynamic path planning for a mobile automaton with limited information on the environment

Directions Toward Effective Utilization of Tactile Skin: A Review

Incorporating range sensing in the robot navigation function