Before beginning any robot task, users must position the robot's base, a task that now depends entirely on user intuition. While slight perturbation is tolerable for robots with moveable bases, correcting the problem is imperative for fixed-base robots if some essential task sections are out of reach. For mobile manipulation robots, it is necessary to decide on a specific base position before beginning manipulation tasks. This paper presents Reuleaux, an open source library for robot reachability analyses and base placement. It reduces the amount of extra repositioning and removes the manual work of identifying potential base locations. Based on the reachability map, base placement locations of a whole robot or only the arm can be efficiently determined. This can be applied to both statically mounted robots, where position of the robot and work piece ensure the maximum amount of work performed, and to mobile robots, where the maximum amount of workable area can be reached. Solutions are not limited only to vertically constrained placement, since complicated robotics tasks require the base to be placed at unique poses based on task demand. All Reuleaux library methods were tested on different robots of different specifications and evaluated for tasks in simulation and real world environment. Evaluation results indicate that Reuleaux had significantly improved performance than prior existing methods in terms of time-efficiency and range of applicability.
To overcome the single grasp location issue, several papers extended the inverse reachability problem to solve for trajectories. Various methods have been used to search the reachability map in order to find the location where the desired trajectory can be executed with the highest level of dexterity. @cite_0 uses sampling of the trajectory to find and overlay multiple base placements; @cite_2 uses a pattern search to fit the trajectory into the area representing the field of high dexterity; and @cite_3 uses a cross-correlation technique to fit the desired trajectory to the model of the robot reachability map. Further improvements to the reachability map method were developed by @cite_1 to include the ability to add a transform offset from the original end-effector location, which is useful if the robot is grasping a tool with a non-zero length.
@cite_0 @cite_1 @cite_3 @cite_2
2200154514 2129066514 2168583767
Humanoid robots are envisioned in general household tasks. To be able to fulfill a given task the robot needs to be equipped with knowledge concerning the manipulation and interaction in the environment and with knowledge about its own capabilities. When performing actions, e.g. opening doors or imitating human reach to grasp movements special 3-d trajectories are followed with the robot's end-effector. These trajectories can not be executed in every part of the robot's arm workspace. Therefore a task planner has to determine if and how additional degrees of freedom such as the robot's upper body or the robot's base can be moved in order to execute the task-specific trajectory. An approach is presented that computes placements for a mobile manipulator online given a task-related 3-d trajectory. A discrete representation of the robot arm's reachable workspace is used. Task-specific trajectories are interpreted as patterns and searched in the reachability model using multi-dimensional correlation. The relevance of the presented approach is demonstrated in simulated positioning tasks. In grasping tasks carried out with humanoids, knowledge about the robot's reachable workspace is important. Without this knowledge, it might be necessary to repeatedly adapt the stance location and call an inverse kinematics solver before a valid robot configuration to reach a given grasping pose can be found. In this paper, we present an approach to select an optimal stance location in SE(2) for a humanoid robot's feet relative to a desired grasp pose. We use a precomputed representation of the robot's reachable workspace that stores quality information in addition to spatial data. By inverting this representation we obtain a so-called inverse reachability map (IRM) containing a collection of potential stance poses for the robot. The generated IRM can subsequently be used to select a statically stable, collision-free stance configuration to reach a given grasping target. We evaluated our approach with a Nao humanoid in simulation and in experiments with the real robot. As the experiments show, using our approach optimal stance poses can easily be obtained. Furthermore, the IRM leads to a substantially increased success rate of reaching grasping poses compared to other meaningful foot placements within the vicinity of the desired grasp. Mobile humanoid robots have the capability of accomplishing complex tasks in human dominated environments. In order to execute a task with its arm, a robot needs to place its base reasonably first. In previous work, a positionbased reachability map solved this problem by matching a precomputed inverse kinematics database with discretized versions of the task path. However, its capability is restricted to the end effector with which the database was computed. This paper proposes an orientation-based reachability map which supports on-line end effector frame extensions. The added extension capability enables robots to handle partially constrained task paths with different tool frames, which would be non-trivial for previous methods without recomputing a reachability map. We discuss the differences between the new method and its predecessors, and analyze extension transformation matrix to provide mathematical proof for the extension capability of our reachability map. Our experimental results show that the orientation-based reachability map is as fast as the positionbased reachability map while benefiting from the additional extension capability. For mobile manipulators envisioned in home environments a kitchen scenario provides a challenging testbed for numerous skills. Diverse manipulation actions are required, e.g. simple pick and place for moving objects and constrained motions for opening doors and drawers. The robot kinematics and link limits however are restrictive. Therefore especially a constrained trajectory will not be executable from arbitrary placements of the mobile manipulator. A two stage approach is presented to position a mobile manipulator to execute constrained linear trajectories as needed for opening drawers. In a first stage, a representation of a robot armpsilas reachable workspace is computed. Pattern recognition techniques are used to find regions in the workspace representation where these trajectories are possible. A set of trajectories results. In the second stage mobile manipulator placements are computed and the corresponding trajectories are checked for collisions. Compared to a brute force search through the workspace, the success rate of finding a mobile manipulator placement can be increased from 2 to 70 . In recent years scholars have built maps of science by connecting the academic fields that cite each other, are cited together, or that cite a similar literature. But since scholars cannot always publish in the fields they cite, or that cite them, these science maps are only rough proxies for the potential of a scholar, organization, or country, to enter a new academic field. Here we use a large dataset of scholarly publications disambiguated at the individual level to create a map of science-or research space-where links connect pairs of fields based on the probability that an individual has published in both of them. We find that the research space is a significantly more accurate predictor of the fields that individuals and organizations will enter in the future than citation based science maps. At the country level, however, the research space and citations based science maps are equally accurate. These findings show that data on career trajectories-the set of fields that individuals have previously published in-provide more accurate predictors of future research output for more focalized units-such as individuals or organizations-than citation based science maps. Abstract This paper addresses the important issue of automating grasping movement in the animation of virtual actors, and presents a methodology and algorithm to generate realistic looking grasping motion of arbitrary shaped objects. A hybrid approach using both forward and inverse kinematics is proposed. A database of predefined body postures and hand trajectories are generalized to adapt to a specific grasp. The reachable space is divided into small subvolumes, which enables the construction of the database. The paper also addresses some common problems of articulated figure animation. A new approach for body positioning with kinematic constraints on both hands is described. An efficient and accurate manipulation of joint constraints is also presented. Finally, we describe an interpolation algorithm which interpolates between two postures of an articulated figure by moving the end effector along a specific trajectory and maintaining all the joint angles in the feasible range. Results are quite satisfactory, and some are shown in the paper. The utility of a mobile manipulator largely depends on its kinematic structure and mounting point on the robot body. The reachable workspace of the robot can be obtained offline and modeled as a discretized map called Reachability map. A Capability map is obtained by including some quality measure for the local dexterity of the manipulator, which helps to identify good and bad regions for manipulation. Once the maps are obtained based on forward or inverse kinematic methods, they can be used for numerous analysis tasks such as robot kinematics and workspace quality assessment, robot mounting point analysis or redundancy and failure analysis. This paper covers basic aspects of the Reachability and Capability map generation and storage, and shows particular applications of the maps for space robotics. In this paper, we present an approach for robustly grasping objects under positional uncertainty. We maintain a belief state (a probability distribution over world states), model the problem as a partially observable Markov decision process (POMDP), and select actions with a receding horizon using forward search through the belief space. Our actions are world-relative trajectories, or fixed trajectories expressed relative to the most-likely state of the world. We localize the object, ensure its reachability, and robustly grasp it at a goal position by using information-gathering, reorientation, and goal actions. We choose among candidate actions in a tractable way online by computing and storing the observation models needed for belief update offline. This framework is used to successfully grasp objects (including a powerdrill and a Brita pitcher) despite significant uncertainty, both in simulation and with an actual robot arm. Describes a synergistic integration of a grasping simulator and a real-time visual tracking system, that work in concert to (1) find an object's pose, (2) plan grasps and movement trajectories, and (3) visually monitor task execution. Starting with a CAD model of an object to be grasped, the system can find the object's pose through vision which then synchronizes the state of the robot workcell with an online, model-based grasp planning and visualization system we have developed called GraspIt. GraspIt can then plan a stable grasp for the object, and direct the robotic hand system to perform the grasp. It can also generate trajectories for the movement of the grasped object, which are used by the visual control system to monitor the task and compare the actual grasp and trajectory with the planned ones. We present experimental results using typical grasping tasks. In this paper we present a novel approach for representing trajectories using sequenced linear dynamical systems. This method uses a closed-form least-squares procedure to fit a single linear dynamical system (LDS) to a simple trajectory. These LDS estimates form the elemental building blocks used to describe complicated trajectories through an automatic segmentation procedure that can represent complicated trajectories with high accuracy. Each estimated LDS induces a control law, mapping current state to desired state, that encodes the target trajectory in a generative manner. We provide a proof of stability of the control law and show how multiple trajectories can be incorporated to improve the generalization ability of the system. How should a robot direct active vision so as to ensure reliable grasping? We answer this question for the case of dexterous grasping of unfamiliar objects. By dexterous grasping we simply mean grasping by any hand with more than two fingers, such that the robot has some choice about where to place each finger. Such grasps typically fail in one of two ways, either unmodeled objects in the scene cause collisions or object reconstruction is insufficient to ensure that the grasp points provide a stable force closure. These problems can be solved more easily if active sensing is guided by the anticipated actions. Our approach has three stages. First, we take a single view and generate candidate grasps from the resulting partial object reconstruction. Second, we drive the active vision approach to maximise surface reconstruction quality around the planned contact points. During this phase, the anticipated grasp is continually refined. Third, we direct gaze to improve the safety of the planned reach to grasp trajectory. We show, on a dexterous manipulator with a camera on the wrist, that our approach (80.4 success rate) outperforms a randomised algorithm (64.3 success rate). End-to-end control for robot manipulation and grasping is emerging as an attractive alternative to traditional pipelined approaches. However, end-to-end methods tend to either be slow to train, exhibit little or no generalisability, or lack the ability to accomplish long-horizon or multi-stage tasks. In this paper, we show how two simple techniques can lead to end-to-end (image to velocity) execution of a multi-stage task, which is analogous to a simple tidying routine, without having seen a single real image. This involves locating, reaching for, and grasping a cube, then locating a basket and dropping the cube inside. To achieve this, robot trajectories are computed in a simulator, to collect a series of control velocities which accomplish the task. Then, a CNN is trained to map observed images to velocities, using domain randomisation to enable generalisation to real world images. Results show that we are able to successfully accomplish the task in the real world with the ability to generalise to novel environments, including those with dynamic lighting conditions, distractor objects, and moving objects, including the basket itself. We believe our approach to be simple, highly scalable, and capable of learning long-horizon tasks that have until now not been shown with the state-of-the-art in end-to-end robot control. The grasping and stabilization of a spinning, noncooperative target satellite by means of a free-flying robot is addressed. A method for computing feasible robot trajectories for grasping a target with known geometry in a useful time is presented, based on nonlinear optimization and a look-up table. An off-line computation provides a data base for a mapping between a four-dimensional input space, to characterize the target motion, and an N-dimensional output space, representing the family of time-parameterized optimal robot trajectories. Simulation results show the effectiveness of the data base for computing grasping maneuvers in a useful time, for a sample range of spinning motions. The debris object consists of a satellite with solar appendages in Low Earth Orbit, which presents collision avoidance and timing challenges for executing the task. We present a predictive model for the functional area of the thumb on a touchscreen surface: the area of the interface reachable by the thumb of the hand that is holding the device. We derive a quadratic formula by analyzing the kinematics of the gripping hand. Model fit is high for the thumb-motion trajectories of 20 participants. The model predicts the functional area for a given 1) surface size, 2) hand size, and 3) position of the index finger on the back of the device. Designers can use this model to ensure that a user interface is suitable for interaction with the thumb. The model can also be used inversely - that is, to infer the grips assumed by a given user interface layout. This work deals with trajectory optimization for a robotic sensor network sampling a spatio-temporal random field. We examine the optimal sampling problem of minimizing the maximum predictive variance of the estimator over the space of network trajectories. This is a high-dimensional, multi-modal, nonsmooth optimization problem, known to be NP-hard even for static fields and discrete design spaces. Under an asymptotic regime of near-independence between distinct sample locations, we show that the solutions to a novel generalized disk-covering problem are solutions to the optimal sampling problem. This result effectively transforms the search for the optimal trajectories into a geometric optimization problem. Constrained versions of the latter are also of interest as they can accommodate trajectories that satisfy a maximum velocity restriction on the robots. We characterize the solution for the unconstrained and constrained versions of the geometric optimization problem as generalized multicircumcenter trajectories, and provide algorithms which enable the network to find them in a distributed fashion. Several simulations illustrate our results. The manufacturing industry today is still focused on the maximization of production. A possible development able to support the global achievement of this goal is the implementation of a new support system for trajectory-planning, specific for industrial robots. This paper describes the trajectory-planning algorithm, able to generate trajectories manageable by human operators, consisting of linear and circular movement primitives. First, the world model and a topology preserving roadmap are stored in a probabilistic occupancy octree by applying a cell extension based algorithm. Successively, the roadmap is constructed within the free reachable joint space maximizing the clearance to the obstacles. A search algorithm is applied on robot configuration positions within the roadmap to identify a path avoiding static obstacles. Finally, the resulting path is converted through an elastic net algorithm into a robot trajectory, which consists of canonical ordered linear and circular movement primitives. The algorithm is demonstrated in a real industrial manipulator context. This paper explores the problem of autonomous, in-hand regrasping-the problem of moving from an initial grasp on an object to a desired grasp using the dexterity of a robot's fingers. We propose a planner for this problem which alternates between finger gaiting, and in-grasp manipulation. Finger gaiting enables the robot to move a single finger to a new contact location on the object, while the remaining fingers stably hold the object. In-grasp manipulation moves the object to a new pose relative to the robot's palm, while maintaining the contact locations between the hand and object. Given the object's geometry (as a mesh), the hand's kinematic structure, and the initial and desired grasps, we plan a sequence of finger gaits and object reposing actions to reach the desired grasp without dropping the object. We propose an optimization based approach and report in-hand regrasping plans for 5 objects over 5 in-hand regrasp goals each. The plans generated by our planner are collision free and guarantee kinematic feasibility. Abstract We address the problem of finding an optimal solution for a nonlinear system for a set of initial states rather than just for a single initial state. In addition, we consider state and input constraints as well as a set of possible disturbances. While previous optimal control techniques typically ignore the fact that the current state of a system is not exactly known, future safety-critical systems demand that all uncertainties including the initial state are considered; this is required for e.g. automated vehicles, surgical robots, or human-robot interaction. We present a new method that obtains optimal control inputs by finding optimal weights for generators that span the space reachable by the considered system. This solution routine can be used not only for a single initial state but also for a set of initial states - this is not possible using classical optimization techniques. We ensure that all constraints are met by using reachability analysis, which provides formal bounds for all possible system trajectories. We demonstrate the applicability of our approach with an example from automated driving; for this example, the result is obtained within a few seconds and outperforms a classical LQR approach. GPS-equipped taxis can be viewed as pervasive sensors and the large-scale digital traces produced allow us to reveal many hidden "facts" about the city dynamics and human behaviors. In this paper, we aim to discover anomalous driving patterns from taxi's GPS traces, targeting applications like automatically detecting taxi driving frauds or road network change in modern cites. To achieve the objective, firstly we group all the taxi trajectories crossing the same source destination cell-pair and represent each taxi trajectory as a sequence of symbols. Secondly, we propose an Isolation-Based Anomalous Trajectory (iBAT) detection method and verify with large scale taxi data that iBAT achieves remarkable performance (AUC>0.99, over 90 detection rate at false alarm rate of less than 2 ). Finally, we demonstrate the potential of iBAT in enabling innovative applications by using it for taxi driving fraud detection and road network change detection. Using only the existence and uniqueness of trajectories for a generic dynamic system with inputs, we define and examine eight types of forward and backward reachability constructs. If the input is treated in a worst-case fashion, any forward or backward reach set or tube can be used for safety analysis, but if the input is treated in a best-case fashion only the backward reach tube always provides the correct results. Fortunately, forward and backward algorithms can be exchanged if well-posed reverse time trajectories can be defined. Unfortunately, backward reachability constructs are more likely to suffer from numerical stability issues, especially in systems with significant contraction--the very systems where forward simulation and reachability are most effective.