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.

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.