In the context of automated feeding (orienting) of industrial parts, we study the algorithmic design of traps in the bowl feeder track that filter out all but one orientation of a given polyhedral part. We propose a new class of traps that removes a V-shaped portion of the track. The proposed work advances the state-of-the-art in algorithmic trap design by extending earlier work1,6,17—which focuses solely on 2D parts—to 3D parts, and by incorporating a more realistic part motion model in the design algorithm. We exploit the geometric structure of the design problem and build on concepts and techniques from computational geometry to obtain an efficient algorithm that reports the complete set of valid traps.

The issue of motion planning for closed-loop mechanisms, such as parallel manipulators or robots, is still an open question. This paper proposes a novel approach for motion planning of spatial parallel robots. The framework for the geometric modeling is based on the visibility graph methodology. It is opted for a multiple-heuristics approach, where different influences are integrated in a multiplicative way within the heuristic cost function. Since the issue of singularities is a fundamental one for parallel robots, it is emphasized on the avoidance of such configurations. To include singularity-free planning within the heuristic approach, two heuristic functions are proposed, the inverse local dexterity as well as a novel defined “next-singularity” function, in such a way, well conditioned motions can be provided by a single planning procedure. The success of the method is illustrated by some examples.

This is the first publication presenting the minihumanoid robot THBIP-2, the second-generation biped of Tsinghua University. It is 70 cm in height and 18 kg in weight with 24 degrees of freedom. This paper mainly addresses its mechatronics system realization, including the conceptual design, actuation system, sensing system, and control system. In addition, a walking stability controller based on zero moment point criterion and the walking simulation are presented. Finally, experiments validate and confirm the efficiency of the design.

We address the synthesis of controllers for a swarm of robots to generate a desired two-dimensional geometric pattern specified by a simple closed planar curve with local interactions for avoiding collisions or maintaining specified relative distance constraints. The controllers are decentralized in the sense that the robots do not need to exchange or know each other's state information. Instead, we assume that the robots have sensors allowing them to obtain information about relative positions of neighbors within a known range. We establish stability and convergence properties of the controllers for a certain class of simple closed curves. We illustrate our approach through simulations and consider extensions to more general planar curves.

This work examines the Cooperative Hunters problem, where a swarm of unmanned air vehicles (UAVs) is used for searching one or more “evading targets,” which are moving in a predefined area while trying to avoid a detection by the swarm. By arranging themselves into efficient geometric flight configurations, the UAVs optimize their integrated sensing capabilities, enabling the search of a maximal territory.

This paper is to investigate inherent oscillations problems of potential field methods (PFMs) for nonholonomic robots in dynamic environments. In prior work, we proposed a modification of Newton's method to eliminate oscillations for omnidirectional robots in static environment. In this paper, we develop control laws for nonholonomic robots in dynamic environment using modifications of Newton's method. We have validated this technique in a multi-robot search-and-forage task. We found that the use of the modifications of Newton's method, which applies anywhere C2 continuous navigation functions are defined, can greatly reduce oscillations and speed up the robot's movement, when compared to the standard gradient approaches.

This work presents a method to generate optimal trajectories for redundant mobile manipulators based on a weighted function that considers simultaneously joint torques, manipulability and preferred joint angle references. This method is applicable to a group of tasks, commonly known as push–pull tasks, in which a redundant mobile manipulator subject to non-holonomic constraints moves slowly while exerting a set of forces against the environment. In practice, this occurs when the manipulator is pulling against an object such as when opening a door or unearthing a buried object. Torque is computed in a quasi-static manner, mainly taking into consideration the effect of multiple external forces while neglecting dynamic effects. The formulation incorporates a criterion for optimizing a starting configuration, and special considerations are made to account for non-holonomic constraints. The application to an existing mobile manipulator is described.

The aim of this paper is to show how it is possible to obtain for the 5R planar parallel manipulator the complete workspace associated with each solution of the direct kinematic problem or assembly mode. The workspaces associated with the different inverse kinematic problem solutions or working modes are joined and the robot moves from one to another without losing the control. An exhaustive analysis of the complete workspace and singular positions of the 5R planar parallel manipulator with two active joints is presented. Furthermore, application of these principles to path planning will be explained.

In this work, the 3-RPRR, a new kinematically redundant planar parallel manipulator with six-degrees-of-freedom, is presented. First, the manipulator is introduced and its inverse displacement problem discussed. Then, all types of singularities of the 3-RPRR manipulator are analysed and demonstrated. Thereafter, the dexterous workspace is geometrically obtained and compared with the non-redundant 3-PRR planar parallel manipulator. Finally, based on a geometrical measure of proximity to singular configurations and the condition number of the manipulators' Jacobian matrices, actuation schemes for the manipulators are obtained. Different actuation schemes for a given path are obtained and the quality of their actuation schemes are compared. It is shown that the proposed manipulator is capable of following a path while avoiding the singularities.