In this paper a small time local controllability, naturally defined in a configuration space, is transferred into a task-space. It was given its analytical characterization and practical implications. A special attention was put on singular configurations. Theoretical considerations were illustrated with two calculation examples. An extensive comparison of the proposed construction with the controllability defined in an endogenous configuration space approach was presented pointing out to their advantages and disadvantages.
Main topic of the paper is a problem of designing the input-output decoupling controllers for nonholonomic mobile manipulators. We propose a selection of output functions in much more general form than in [1,2]. Regularity conditions guaranteeing the existence of the input-output decoupling control law are presented. Theoretical considerations are illustrated with simulations for mobile manipulator consisting of RTR robotic arm mounted atop of a unicycle which moves in 3D-space.
In the presented paper, a problem of nonholonomic constrained mechanical systems is treated. New methods in nonholonomic mechanics are applied to a problem of a Forklift-truck robot motion. This method of the geometrical theory of general nonholonomic constrained systems on fibered manifolds and their jet prolongations, based on so-called Chetaev-type constraint forces. The relevance of this theory for general types of nonholonomic constraints, not only linear or affine ones, was then verified on appropriate models. On the other hand, the equations of motion of a Forklift-truck robot are highly nonlinear and rolling without slipping condition can only be expressed by nonholonomic constraint equations. In this paper, the geometrical theory is applied to the above mentioned mechanical problem. The results of numerical solutions of constrained equations of motion, derived within the theory, are presented.
The motion planning problem consists in finding a control function which drives the system to a desired point. The motion planning algorithm derived with an endogenous configuration space approach assumes that the motion takes place in an arbitrary chosen time horizon. This work introduces a modification to the motion planning algorithm which allows to reach the destination point in time, which is shorter than the assumed time horizon. The algorithm derivation relies on the endogenous configuration space approach and the continuation (homotopy) method. To achieve the earlier destination reaching a new formulation of the task map and the task Jacobian are introduced. The efficiency of the new algorithm is depicted with simulation results.