Parallel manipulators have a rigid structure and can pick up the heavy objects. Therefore, a parallel manipulator has been developed based on the cooperative of three arms of a robotic system to make the whole system suitable for solving many problems such as materials handling and industrial automation. The three revolute joints are used to achieve the mechanism operation of the parallel planar robot. Those revolute joints are geometrically designed using an open-loop spatial robotic platform. In this paper, the geometric structure with three revolute joints is used to drive and analyze the inverse kinematic model for the 3RRR parallel planar robot. In the proposed design, three main variables are considered: the length of links of the 3RRR parallel planar robot, base positions of the platform, and joint angles’ geometry. Cayley-Menger determinants and bilateration are proposed to calculate these three variables to determine the final position of the platform and to move specific objects according to given desired trajectories. The proposed structure of the 3RRR parallel planar robot is simulated and different desired trajectories are tested to study the performance of the proposed stricter. Furthermore, the hardware implementation of the proposed structure is accomplished to validate the design in practical terms.
Hybrid electric vehicles have received considerable attention because of their ability to improve fuel consumption compared to conventional vehicles. In this paper, a series-parallel hybrid electric vehicle is used because they combine the advantages of the other two configurations. In this paper, the control unit for a series-parallel hybrid electric vehicle is implemented using a Nonlinear Model Predictive Control (NMPC) strategy. The NMPC strategy needs to create a vehicle energy management optimization problem, which consists of the cost function and its constraints. The cost function describes the required control objectives, which are to improve fuel consumption and obtain a good dynamic response to the required speed while maintaining a stable value of the state of charge (SOC) for batteries. While the cost function is subject to the physical constraints and the mathematical prediction model that evaluate vehicle's behavior based on the current vehicle measurements. The optimization problem is solved at each sampling step using the (SQP) algorithm to obtain the optimum operating points of the vehicle's energy converters, which are represented by the torque of the vehicle components.
In maze maneuvering, it is needed for a mobile robot to feasibly plan the shortest path from its initial posture to the desired destination in a given environment. To achieve that, the mobile robot is combined with multiple distance sensors to assist the navigation while avoiding obstructing obstacles and following the shortest path toward the target. Additionally, a vision sensor is used to detect and track colored objects. A new algorithm is proposed based on different type of utilized sensors to aid the maneuvering of differential drive mobile robot in an unknown environment. In the proposed algorithm, the robot has the ability to traverse surrounding hindrances and seek for a particular object based on its color. Six infrared sensors are used to detect any located obstacles and one color detection sensor is used to locate the colored object. The Mobile Robotics Simulation Toolbox in Matlab is used to test the proposed algorithm. Three different scenarios are studied to prove the efficiency of the proposed algorithm. The simulation results demonstrate that the mobile robot has successfully accomplished the tracking and locating of a colored object without collision with hurdles.
This paper presents the design of a path planning system in an environment that contains a set of static and dynamic polygon obstacles localized randomly. In this paper, an algorithm so-called (Polygon shape tangents algorithm) is proposed to move a mobile robot from a source point to a destination point with no collision with surrounding obstacles using the visibility binary tree algorithm. The methodology of this algorithm is based on predicting the steps of a robot trajectory from the source to the destination point. The polygon shapes tangent algorithm is compared with the virtual circles' tangents algorithm for different numbers of static and dynamic polygon obstacles for the time of arrival and the length of the path to the target. The obtained result shows that the used algorithm has better performance than the other algorithms and gets less time of arrival and shortest path with free collision.