To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
This paper investigates the kinematics and the optimization of a generic robotic structure composed by N serial rotary joints and actuated with a mono-directional tendon system. In the first part of the paper, the specific case that brought us to develop this study is introduced; the main motivations and the scenario with its specific constraints and design choices have been described.
Since a complete and detailed analysis of an n-R serial structure with this kind of characteristics could not be found in the literature, the study of the kinematics and the parameter optimization of such a structure is treated as generally as possible, in order to make the procedure and the results applicable for any similar structure. Finally, in the last part, through the introduction of specific constraints and the definition of the parameters, the general analysis has been applied to the specific case of study: the preliminary study of a finger exoskeleton for an astronaut suit.
A widely used method for pose estimation in mobile robots is odometry. Odometry allows the robot in real time to reconstruct its position and orientation from the wheels' encoder measurements. Given to its unbounded nature, odometry calculation accumulates errors with quadratic increase of error variance with traversed distance. This paper develops a novel method for odometry calibration and error propagation identification for mobile robots. The proposed method uses a laser-based interferometer to measure distance precisely. Two variants of the proposed calibration method are examined: the two-parameter model and the three-parameter model. Experimental results obtained using a Khepera 3 mobile robot showed that both methods significantly increase accuracy of the pose estimation, validating the effectiveness of the proposed calibration method.
In this paper, we revisit the 3-degrees of freedom (DOF) pure translational mechanism. The mathematical model and the design considerations are discussed. A detailed sensitivity and error analysis is carried out and the results are discussed in a new perspective. The feasibility of the practical 3-DOF pure translational mechanism is established with novel design considerations to take care of theoretical mobility and geometrical constraints. We describe and validate the theoretical observations with stage-wise prototype models and experiments. The experimental results concur that all is well with 3-UPU in contrast to what is presented in refs. [6, 9, 10].
In this paper I tackle the question of what basic form an analytical method for articulating and ultimately assessing visual representations should take. I start from the assumption that scientific images, being less prone to interpretive complication than artworks, are ideal objects from which to engage this question. I then assess a recent application of Nelson Goodman's aesthetics to the project of parsing scientific images, Laura Perini's ‘The truth in pictures’. I argue that, although her project is an important one, her Goodmanian conventionalism produces a method of analysis that is incapable of adequately parsing a certain class of pictures and her focus on truth is unnecessary. This speaks against the promise of Goodman's analytical strategy for elucidating visual content and reasoning in the sciences and elsewhere. As an alternative, I develop John Willats’ analytical method and compare it to Perini's through engaging three of her examples—a chemical diagram, a graph and an electron micrograph. Ultimately, a space remains open for a mixed system where Willats’ account provides pictorial analysis and the Goodman–Perini approach parses visual languages.
These notes are based on a series of lectures given at the Advanced Research Institute of Discrete Applied Mathematics held at Rutgers University. Their aim is to link together algorithmic problems arising in knot theory, statistical physics and classical combinatorics. Apart from the theory of computational complexity concerned with enumeration problems, introductions are given to several of the topics treated, such as combinatorial knot theory, randomised approximation algorithms, percolation and random cluster models. To researchers in discrete mathematics, computer science and statistical physics, this book will be of great interest, but any non-expert should find it an appealing guide to a very active area of research.
This handbook with exercises reveals in formalisms, hitherto mainly used for hardware and software design and verification, unexpected mathematical beauty. The lambda calculus forms a prototype universal programming language, which in its untyped version is related to Lisp, and was treated in the first author's classic The Lambda Calculus (1984). The formalism has since been extended with types and used in functional programming (Haskell, Clean) and proof assistants (Coq, Isabelle, HOL), used in designing and verifying IT products and mathematical proofs. In this book, the authors focus on three classes of typing for lambda terms: simple types, recursive types and intersection types. It is in these three formalisms of terms and types that the unexpected mathematical beauty is revealed. The treatment is authoritative and comprehensive, complemented by an exhaustive bibliography, and numerous exercises are provided to deepen the readers' understanding and increase their confidence using types.
This second edition of Excel Basics to Blackbelt capitalizes on the success of the first edition and leverages some of the advancements in visualization, data analysis, and sharing capabilities that have emerged over the past five years. As with the original text, the second edition is intended to serve as an accelerated guide to decision support designs for consultants and service professionals. This 'fast track' enables a ramping up of skills in Excel for those who may have never used it to reach a level of mastery that will allow them to integrate Excel with widely available associated applications, make use of intelligent data visualization and analysis techniques, automate activity through basic VBA designs, and develop easy-to-use interfaces for customizing use. In other words, this book provides users with lessons and examples on integrative Excel use that are not available from alternative texts.
Artificial intelligence (AI) is a field within computer science that is attempting to build enhanced intelligence into computer systems. This book traces the history of the subject, from the early dreams of eighteenth-century (and earlier) pioneers to the more successful work of today's AI engineers. AI is becoming more and more a part of everyone's life. The technology is already embedded in face-recognizing cameras, speech-recognition software, Internet search engines, and health-care robots, among other applications. The book's many diagrams and easy-to-understand descriptions of AI programs will help the casual reader gain an understanding of how these and other AI systems actually work. Its thorough (but unobtrusive) end-of-chapter notes containing citations to important source materials will be of great use to AI scholars and researchers. This book promises to be the definitive history of a field that has captivated the imaginations of scientists, philosophers, and writers for centuries.
In the past few years elliptic curve cryptography has moved from a fringe activity to a major challenger to the dominant RSA/DSA systems. Elliptic curves offer major advances on older systems such as increased speed, less memory and smaller key sizes. As digital signatures become more and more important in the commercial world the use of elliptic curve-based signatures will become all pervasive. This book summarizes knowledge built up within Hewlett-Packard over a number of years, and explains the mathematics behind practical implementations of elliptic curve systems. Due to the advanced nature of the mathematics there is a high barrier to entry for individuals and companies to this technology. Hence this book will be invaluable not only to mathematicians wanting to see how pure mathematics can be applied but also to engineers and computer scientists wishing (or needing) to actually implement such systems.
We propose a novel control approach for cooperative dual-arm manipulation tasks. Our scheme has three typical features: (1) the task performed by two robots is represented as a motion of a virtual mechanism and the task execution is accomplished by controlling the virtual mechanism; (2) the two arms and the task form a joined kinematic chain; (3) the scheme allows a cooperative dual-arm system to perform the task also when robot base is moving. The calculation of the Jacobian matrix of a chained two-arm mechanisms is based on a methodology which is using the Jacobian matrices of particular robot mechanisms and their end-effector positions and orientations. The proposed algorithm for dual-arm manipulation is verified by simulations of two cooperating planar robots and by experiments on a dual-arm robot consisting of two KUKA LWR arms.
What factors affect users' perceptions of physical human–robot interactions? To answer this question, this study examined whether the skin temperature of a social robot affected users' perceptions of the robot during physical interaction. Results from a between-subjects experiment (warm, intermediate, cool, or no interaction) with a dinosaur robot demonstrated that skin temperature significantly affects users' perceptions and evaluations of a socially interactive robot. Additionally, this study found that social presence had partial mediating effects on several dependent variables. Important implications and limitations for improving human–robot interactions are discussed here.
In this paper, we study the visible trajectories planning for unmanned aerial vehicles (UAVs) modeled with a Dubins airplane in 3D urban environments. Our method is based on a fast and exact spatial visibility analysis of the 3D visibility problem from a viewpoint in 3D built-up environments. We consider the 3D urban environment buildings modeled as cubes (3D boxes) and present an analytic solution to the visibility problem. Based on an analytic solution, the algorithm computes the exact visible and hidden parts from a viewpoint in the urban environment. We present a local trajectory planner generating the most visible trajectory in a known 3D urban environment model, taking into account the dynamic and kinematic UAV constraints. The planner computes, at each time step, the next UAV's attainable velocities and explores the most visible node, while avoiding buildings as static obstacles in the environments, using the velocity obstacle method. The visibility type of the trajectory can be configured beforehand as visible roofs and surfaces in the environments. We demonstrate our visibility and trajectory planning method in simulations in several 3D urban environments, showing visible trajectory planning capabilities.
This paper proposes a localization scheme using ultrasonic beacons in an unstructured multi-block workspace. Indoor localization schemes using ultrasonic sensors have widely been studied due to their low costs and high accuracies. However, ultrasonic sensors are susceptible to environmental noise due to the propagation characteristics of ultrasonic waves. In addition, the decay of ultrasonic signals over long distances implies that ultrasonic sensors are unsuitable for use in large indoor environments. To overcome these shortcomings of ultrasonic sensors, while retaining their advantages, a multi-block approach was devised by dividing an indoor space into several blocks with multiple beacons in each block. However, it is difficult to divide an indoor space into several blocks when beacons cannot be installed in a regular manner or when some new beacons are installed. To resolve this difficulty, a dynamic algorithm is needed to divide an indoor space into multiple blocks and to select suitable beacons. Therefore, this paper proposes a real-time localization scheme to estimate the position of a mobile robot independent of beacon locations and to estimate the position of a new beacon installed at an unknown position. A beacon selection algorithm was developed to select optimal beacons according to robot position and to set up sets of beacons for mobile robot navigation. By using the new beacon searching and calibration algorithm, a mobile robot is able to navigate in an unknown space without requiring the additional setup time needed to install new beacons. The performance of the proposed localization system was verified using real experiments.
Zero moment point (ZMP) is the most popular concept that is applied to stabilize the gait motion of a biped robot. This paper utilizes ZMP with the augmented-reality (AR) method to improve the stability of gait motion of a biped robot. The 3ds Max computer software package is used to build a virtual robot. Under an achieved joint angle data of solid robot to produce an animation of the robot's trajectory, the joint angle data are transmitted to the virtual robot to analyze the offset of the trunk. Furthermore, this investigation adopts AR to allow the user to make direct comparisons between the solid and virtual robot before and after the gait motion is corrected. The animated trajectories of the virtual robot are compared and the relevant data provide feedback to the solid robot to adjust the joint angle and further correct its posture. The experimental results reveal that the proposed scheme can improve gait motion, even when the biped robot is affected by an unexpected loading disturbance. As well as improving the stability of gait motion of a biped robot, the results of this study can also be used to teach the application of the proposed method in a robotics class.
We present an algorithm for computing Borcherds products, which has polynomial runtime. It deals efficiently with the bounds on Fourier expansion indices originating in Weyl chambers. Naive multiplication has exponential runtime due to inefficient handling of these bounds. An implementation of the new algorithm shows that it is also much faster in practice.
In this paper, we present the outcome of vast computer calculations, locating several of the very rare instances of level one cuspidal Bianchi modular forms that are not lifts of elliptic modular forms.
We give an enumeration of all positive definite primitive $ \mathbb{Z} $-lattices in dimension $n\geq 3$ whose genus consists of a single isometry class. This is achieved by using bounds obtained from the Smith–Minkowski–Siegel mass formula to computationally construct the square-free determinant lattices with this property, and then repeatedly calculating pre-images under a mapping first introduced by G. L. Watson.
We hereby complete the classification of single-class genera in dimensions 4 and 5 and correct some mistakes in Watson’s classifications in other dimensions. A list of all single-class primitive $ \mathbb{Z} $-lattices has been compiled and incorporated into the Catalogue of Lattices.