Simox (original) (raw)

Virtual-Robot

img img img img
With the Virtual Robot library robots and environments can be specified and accessed via XML definitions. The structure of a robot is given by its joints (called RobotNodes) which are defined via Denavit-Hartenberg conventions or an easy-to-use "Translation+Rotation" scheme. The robot specification holds further information as name, joint limits, sensors, visualization and collision models. For convenient access kinematic chains and collections of collision models can be additionally defined. An instance of such a robot definition can be visualized by a viewer to show the current state of a robot. Furthermore, environments, obstacles and objects to manipulate can be defined and visualized. Thus it is possible to construct complex scenes used for simulation or planning and to store and load such scene definitions to/from XML files. The main features of the library are:

Saba

img img img
The Sampling Based Motion Planning Library is designed to efficiently compute collision-free motions for redundant robot systems with many degrees of freedom. The algorithms provided are based on Rapidly-exploring Random Trees (RRT), which allow a quick sampling of the collision-free configuration space. Several planners, starting with the basic RRT-Connect planner, are implemented and a lot of tools e.g. for path smoothing or visualizing are provided. The main features are:

Grasp-Studio

img img img img
The Grasp Studio library contains methods and tools used for measuring grasp qualities. Therefore an interface to the qhull library is provided to build convex hulls in 3D or 6D. The methods for measuring grasp qualities implement methods based on force-space related algorithms in 3D and a full implementation of 6D grasp wrench spaces is included. Grasping setups of simple end-effectors, multi-finger hands, multi-hand and multi-robot grasps can be evaluated by the Grasp Studio library. Grasp planners are implemented for building object specific grasp maps for given end-effectors.