Real Time Trajectory Modification Using a Closed Form Solution

Author(s):  
Michael R. Hummels ◽  
Raymond J. Cipra

Abstract An on-line trajectory modification and path planning strategy is developed which will allow a robot to respond in an efficient manner to real time sensory input. The approach developed here eliminates the need for solving many equations by developing a closed form algorithm. It uses two fourth order curves for the transition phases with a constant velocity section in between. Although this is done by providing additional constraints to the curve, it makes the problem of determining the trajectory much easier to solve, while providing continuous higher derivatives. It also provides a safe and efficient way of modifying trajectories based on the robots joint rate limits, joint acceleration limits, jerk limits, and desired time interval between trajectory modifications for a 4-1-4 trajectory. This method involves the solution of one second order equation and is directed toward real time applications.

1986 ◽  
Vol 23 (1) ◽  
pp. 249-255 ◽  
Author(s):  
John R. Hubbard ◽  
Claude Dennis Pegden ◽  
Matthew Rosenshine

The problem of determining the probability of j departures during the time interval (0, t) from an M/M/l queue empty at t = 0 is considered. A closed-form solution is obtained. It is shown that this solution is unique and invariant under interchanging the arrival rate and service rate. Finally, sample computational representations of the solution are developed and results of a simple computation are provided.


1986 ◽  
Vol 23 (01) ◽  
pp. 249-255 ◽  
Author(s):  
John R. Hubbard ◽  
Claude Dennis Pegden ◽  
Matthew Rosenshine

The problem of determining the probability of j departures during the time interval (0, t) from an M/M/l queue empty at t = 0 is considered. A closed-form solution is obtained. It is shown that this solution is unique and invariant under interchanging the arrival rate and service rate. Finally, sample computational representations of the solution are developed and results of a simple computation are provided.


Robotica ◽  
2015 ◽  
Vol 34 (12) ◽  
pp. 2729-2740 ◽  
Author(s):  
S. J. Yan ◽  
S. K. Ong ◽  
A. Y. C. Nee

SUMMARYAlthough the registration of a robot is crucial in order to identify its pose with respect to a tracking system, there is no reported solution to address this issue for a hybrid robot. Different from classical registration, the registration of a hybrid robot requires the need to solve an equation with three unknowns where two of these unknowns are coupled together. This property makes it difficult to obtain a closed-form solution. This paper is a first attempt to solve the registration of a hybrid robot. The Degradation-Kronecker (D-K) method is proposed as an optimal closed-form solution for the registration of a hybrid robot in this paper. Since closed-form methods generally suffer from limited accuracy, a purely nonlinear (PN) method is proposed to complement the D-K method. With simulation and experiment results, it has been found that both methods are robust. The PN method is more accurate but slower as compared to the D-K method. The fast computation property of the D-K method makes it appropriate to be applied in real-time circumstances, while the PN method is suitable to be applied where good accuracy is preferred.


2013 ◽  
Vol 40 (2) ◽  
pp. 106-114
Author(s):  
J. Venetis ◽  
Aimilios (Preferred name Emilios) Sideridis

Sign in / Sign up

Export Citation Format

Share Document