This unique book provides an introduction to a subject whose use has steadily increased over the past 40 years. An update of Ramon Moore s previous books on the topic, it provides broad coverage of the subject as well as the historical perspective of one of the originators of modern interval analysis. The authors provide a hands-on introduction to INTLAB, a high-quality, comprehensive MATLAB toolbox for interval computations, making this the first interval analysis book that does with INTLAB what general numerical analysis texts do with MATLAB. Readers will find the following features of interest: elementary motivating examples and notes that help maximize the reader s chance of success in applying the techniques; exercises and hands-on MATLAB-based examples woven into the text; INTLAB-based examples and explanations integrated into the text, along with a comprehensive set of exercises and solutions, and an appendix with INTLAB commands; an extensive bibliography and appendices that will continue to be valuable resources once the reader is familiar with the subject; and a Web page with links to computational tools and other resources of interest. Audience: Introduction to Interval Analysis will be valuable to engineers and scientists interested in scientific computation, especially in reliability, effects of roundoff error, and automatic verification of results. The introductory material is particularly important for experts in global optimization and constraint solution algorithms. This book is suitable for introducing the subject to students in these areas. Contents: Preface; Chapter 1: Introduction; Chapter 2: The Interval Number System; Chapter 3: First Applications of Interval Arithmetic; Chapter 4: Further Properties of Interval Arithmetic; Chapter 5: Introduction to Interval Functions; Chapter 6: Interval Sequences; Chapter 7: Interval Matrices; Chapter 8: Interval Newton Methods; Chapter 9: Integration of Interval Functions; Chapter 10: Integral and Differential Equations; Chapter 11: Applications; Appendix A: Sets and Functions; Appendix B: Formulary; Appendix C: Hints for Selected Exercises; Appendix D: Internet Resources; Appendix E: INTLAB Commands and Functions; References; Index.

Introduction to Interval Analysis

Constraint programming is a powerful paradigm for solving combinatorial search problems that draws on a wide range of techniques from artificial intelligence, computer science, databases, programming languages, and operations research. Constraint programming is currently applied with success to many domains, such as scheduling, planning, vehicle routing, configuration, networks, and bioinformatics.

The aim of this handbook is to capture the full breadth and depth of the constraint programming field and to be encyclopedic in its scope and coverage. While there are several excellent books on constraint programming, such books necessarily focus on the main notions and techniques and cannot cover also extensions, applications, and languages. The handbook gives a reasonably complete coverage of all these lines of work, based on constraint programming, so that a reader can have a rather precise idea of the whole field and its potential. Of course each line of work is dealt with in a survey-like style, where some details may be neglected in favor of coverage. However, the extensive bibliography of each chapter will help the interested readers to find suitable sources for the missing details. Each chapter of the handbook is intended to be a self-contained survey of a topic, and is written by one or more authors who are leading researchers in the area.

The intended audience of the handbook is researchers, graduate students, higher-year undergraduates and practitioners who wish to learn about the state-of-the-art in constraint programming. No prior knowledge about the field is necessary to be able to read the chapters and gather useful knowledge. Researchers from other fields should find in this handbook an effective way to learn about constraint programming and to possibly use some of the constraint programming concepts and techniques in their work, thus providing a means for a fruitful cross-fertilization among different research areas.

The handbook is organized in two parts. The first part covers the basic foundations of constraint programming, including the history, the notion of constraint propagation, basic search methods, global constraints, tractability and computational complexity, and important issues in modeling a problem as a constraint problem. The second part covers constraint languages and solver, several useful extensions to the basic framework (such as interval constraints, structured domains, and distributed CSPs), and successful application areas for constraint programming.

- Covers the whole field of constraint programming
- Survey-style chapters
- Five chapters on applications

Table of Contents

Foreword (Ugo Montanari) 
Part I : Foundations
Chapter 1. Introduction (Francesca Rossi, Peter van Beek, Toby Walsh) 
Chapter 2. Constraint Satisfaction: An Emerging Paradigm (Eugene C. Freuder, Alan K. Mackworth) 
Chapter 3. Constraint Propagation (Christian Bessiere) 
Chapter 4. Backtracking Search Algorithms (Peter van Beek) 
Chapter 5. Local Search Methods (Holger H. Hoos, Edward Tsang) 
Chapter 6. Global Constraints (Willem-Jan van Hoeve, Irit Katriel)
Chapter 7. Tractable Structures for CSPs (Rina Dechter)
Chapter 8. The Complexity of Constraint Languages
(David Cohen, Peter Jeavons) 
Chapter 9. Soft Constraints (Pedro Meseguer, Francesca Rossi, Thomas Schiex) 
Chapter 10. Symmetry in Constraint Programming
(Ian P. Gent, Karen E. Petrie, Jean-Francois Puget)
Chapter 11. Modelling (Barbara M. Smith) 
Part II : Extensions, Languages, and Applications

Chapter 12. Constraint Logic Programming (Kim Marriott, Peter J. Stuckey, Mark Wallace) 
Chapter 13. Constraints in Procedural and Concurrent Languages (Thom Fruehwirth, Laurent Michel, Christian Schulte)
Chapter 14. Finite Domain Constraint Programming Systems (Christian Schulte, Mats Carlsson) 
Chapter 15. Operations Research Methods in Constraint Programming (John Hooker) 
Chapter 16. Continuous and Interval Constraints(Frederic Benhamou, Laurent Granvilliers) 
Chapter 17. Constraints over Structured Domains
(Carmen Gervet) 
Chapter 18. Randomness and Structure (Carla Gomes, Toby Walsh)
Chapter 19. Temporal CSPs (Manolis Koubarakis)
Chapter 20. Distributed Constraint Programming
(Boi Faltings) 
Chapter 21. Uncertainty and Change (Kenneth N. Brown, Ian Miguel)
Chapter 22. Constraint-Based Scheduling and Planning
(Philippe Baptiste, Philippe Laborie, Claude Le Pape, Wim Nuijten)
Chapter 23. Vehicle Routing (Philip Kilby, Paul Shaw) 
Chapter 24. Configuration (Ulrich Junker)
Chapter 25. Constraint Applications in Networks
(Helmut Simonis)
Chapter 26. Bioinformatics and Constraints (Rolf Backofen, David Gilbert)

/pdf/handbook-of-constraint-programming-53srutguo2.pdf

Handbook of Constraint Programming

해외산업간호정보 - 미국 산업안전보건연구원(National Institute for Occupational Safety and Health) 소개

Although the concepts of Jacobian matrix, manipulability, and condition number have existed since the very early beginning of robotics their real significance is not always well understood. In this paper we revisit these concepts for parallel robots as accuracy indices in view of optimal design. We first show that the usual Jacobian matrix derived from the input-output velocities equations may not be sufficient to analyze the positioning errors of the platform. We then examine the concept of manipulability and show that its classical interpretation is erroneous. We then consider various common local dexterity indices, most of which are based on the condition number of the Jacobian matrix. It is emphasized that even for a given robot in a particular pose there are a variety of condition numbers and that their values are not coherent between themselves but also with what we may expect from an accuracy index. Global conditioning indices are then examined. Apart from the problem of being based on the local accuracy indices that are questionable, there is a computational problem in their calculation that is neglected most of the time. Finally, we examine what other indices may be used for optimal design and show that their calculation is most challenging.

/pdf/jacobian-manipulability-condition-number-and-accuracy-of-5ecm213mgd.pdf

Jacobian, Manipulability, Condition Number, and Accuracy of Parallel Robots

Parallel robots are nowadays leaving academic laboratories and are finding their way in an increasingly larger number of application fields such as telescopes, fine positioning devices, fast packaging, machine-tool, medical application. A key issue for such use is optimal design as performances of parallel robots are very sensitive to their dimensioning. Optimal design methodologies have to rely on kinetostatic performance indices and accuracy is clearly a key-issue for many applications. It has also be a key-issue for serial robots and consequently this problem has been extensively studied and various accuracy indices have been defined. The results have been in general directly transposed to parallel robots. We will now review how well these indices are appropriate for parallel robots.

/pdf/jacobian-manipulability-condition-number-and-accuracy-of-3enayjm37o.pdf

Jacobian, manipulability, condition number and accuracy of parallel robots


 Cuspidal robots can move from one inverse or direct kinematic solution to another without ever passing through a singularity. These robots have remained unknown because almost all industrial robots do not have this feature. However, in fact, industrial robots are the exceptions. Some robots appeared recently in the industrial market can be shown to be cuspidal but, surprisingly, almost nobody knows it and robot users meet difficulties in planning trajectories with these robots. This paper proposes a review on the fundamental and application aspects of cuspidal robots. It addresses the important issues raised by these robots for the design and planning of trajectories. The identification of all cuspidal robots is still an open issue. This paper recalls in details the case of serial robots with three joints but it also addresses robots with more complex architectures such as 6-revolute-jointed robot and parallel robots. We hope that this paper will help disseminate more widely knowledge on cuspidal robots.

/pdf/a-review-of-cuspidal-serial-and-parallel-manipulators-3hty9hh5.pdf

A review of cuspidal serial and parallel manipulators

The paper focuses on the mechanics of a compliant serial manipulator composed of new type of dual-triangle elastic segments. Both the analytical and numerical methods were used to find the manipulator stable and unstable equilibrium configurations, as well as to predict corresponding manipulator shapes. The stiffness analysis was carried on for both loaded and unloaded modes, the stiffness matrices were computed using the Virtual Joint Method (VJM). The results demonstrate that either buckling or quasi-buckling phenomenon may occur under the loading, if the manipulator corresponding initial configuration is straight or non-straight one. Relevant simulation results are presented that confirm the theoretical study.

Mechanics of compliant serial manipulator composed of dual-triangle segments

For haptic interaction, a user in a virtual environment needs to interact with proxies attached to a robot. The device must be at the exact location defined in the virtual environment in time. However, due to device limitations, delays are always unavoidable. One of the solutions to improve the device response is to infer human intended motion and move the robot at the earliest time possible to the desired goal. This paper presents an experimental study to improve the prediction time and reduce the robot time taken to reach the desired position. We developed motion strategies based on the hand motion and eye-gaze direction to determine the point of user interaction in a virtual environment. To assess the performance of the strategies, we conducted a subject-based experiment using an exergame for reach and grab tasks designed for upper limb rehabilitation training. The experimental results in this study revealed that eye-gaze-based prediction significantly improved the detection time by 37% and the robot time taken to reach the target by 27%. Further analysis provided more insight on the effect of the eye-gaze window and the hand threshold on the device response for the experimental task.

/pdf/improving-haptic-response-for-contextual-human-robot-177rnuhx.pdf

Improving Haptic Response for Contextual Human Robot Interaction

The paper focuses on the stiffness modeling of parallel manipulators composed of non-perfect serial chains, whose geometrical parameters differ from the nominal ones. In these manipulators, there usually exist essential internal forces/torques that considerably affect the stiffness properties and also change the end-effector location. These internal load-ings are caused by elastic deformations of the manipulator ele-ments during assembling, while the geometrical errors in the chains are compensated for by applying appropriate forces. For this type of manipulators, a non-linear stiffness modeling tech-nique is proposed that allows us to take into account inaccuracy in the chains and to aggregate their stiffness models for the case of both small and large deflections. Advantages of the developed technique and its ability to compute and compensate for the compliance errors caused by different factors are illustrated by an example that deals with parallel manipulators of the Or-thoglide family

Stiffness modeling of non-perfect parallel manipulators

This paper characterizes geometrically the singularities of limited DOF parallel manipulators. The geometric conditions associated with the dependency of six Pl\"ucker vector of lines (finite and infinite) constituting the rows of the inverse Jacobian matrix are formulated using Grassmann-Cayley algebra. Manipulators under consideration do not need to have a passive spherical joint somewhere in each leg. This study is illustrated with three example robots

Damien Chablat

Papers

A review of cuspidal serial and parallel manipulators

Mechanics of compliant serial manipulator composed of dual-triangle segments

Improving Haptic Response for Contextual Human Robot Interaction

Stiffness modeling of non-perfect parallel manipulators

Singularity Analysis of Limited-dof Parallel Manipulators using Grassmann-Cayley Algebra