GithubHelp home page GithubHelp logo

zhaodong1986 / catoct Goto Github PK

View Code? Open in Web Editor NEW

This project forked from imchin/catoct

0.0 0.0 0.0 317 KB

Continuous-Acceleration Time-Optimal Cubic Trajectory

License: GNU Affero General Public License v3.0

Python 100.00%

catoct's Introduction

Alt text

This method is suitable for fully-actuated robotics manipulator.

Objective:

Given a sequence of (multiple-degree-of-freedom) via points in joint space and limits on the magnitude of both velocity and acceleration of each degree of freedom, the goal is to generate a piece-wise cubic trajectory that is time-optimal and satisfies both velocity and acceleration constraints. The trajectory must be continuous in position, velocity, and acceleration.

Why not quintic trajectory ?:

The advantage of using polynomial trajectory is its easily-computed derivatives based on its fixed structure of coefficients and the monomials. A cubic trajectory consists of 4 coefficients. Only 4 boundary conditions and the duration of thetrajectory are required to compute the coefficients. Typically, this is done by assigning the initial position, the final position, the intial velocity, and the final velocity. The resultant cubic trajectory can be appended togeter to form a piece-wise cubic trajectory. Since the velocity can be arbitarily assigned, one can form a piece-wise cubic trajectory that gaurantee to be continuous in its velocity. However, if the duration is arbitary, one cannot gaurantee the continuity in the acceleration.

One simple way to solve this is to use a quintic trajectory, which has 6 coefficients. In addition to the given position and velocity of the boundaries, the accceleration can be assigned as well. The resultant piece-wise quintic trajectory can now be conitnuous in its position, velocity, and accceleration. This implies that, in order to generate a piece-wise quintic trajectory, one needs the followings.

  • durations of each sub-trajectory
  • position at each via points (including the initial one)
  • velocity at each via points (including the initial one)
  • acceleration at each via points (including the initial one) Given the position of the via points, there are several questions about the rest of the parameters.
  • Can the durations be any values? Can they be too small or too large ?
  • Can the velocity be any values? Is there any way we can compute this automatically?
  • Can the acceleration be any values? Can the actuators achieve the given acceleration? What happens to the acceleration between the via points?

The problem is that, for the quintic trajectory, one has to determine many unknowns. A feasible trajectory does exist, but it might require extensive tuning. This is why "CATOCT:Continuous-Acceleration Time-Optimal Cubic Trajectory" is developed.

Ideas behind CATOCT:

In reality, a sequence of via points in joint space are the only things given to the trajectory generator. We must compute durations, via points' velocity, and acceleration automatically. Although we cannot assign any arbitary acceleration at the via points for a cubic trajectory, we can adjust the velocity at the via points so that the acceleration at the via points are continuous given the duration of each trajectory. In other words, we can solve for the velocity at each via points using the given durations. This actually results in a closed form solution.

Solving for the durations is a bit trickier. Theoretically, we can choose any arbitary durations and call it a day. However, if the durations are too large, the planned trajectory will take too long. But if it's too short, the trajectory may not be feasible for the actua physical system. This implies that there must be some physical limitations that we should impose on the durations.

We approach this by using nonlinear parameteric optimization to solve for the shortest durations subject to the limited velocity and acceleration. Note that the limitations are only imposed at the via points. Since the acceleration is piece-wise linear, its extremas are at the via points, which implies that the acceleration will not violate the constraints at any time. However, the velocity is piece-wise parabolic. Therefore, some velocity violations may occur inbetween the via points. This is one of the down side of this approach.

In reality, a robotics manipulator would start with zero acceleration. And it should also stop with zero-acceleration. Since the mentioned approach does not rely on the given acceleration, it cannot gaurantee zero acceleration at the boundaries (initial & terminal). To mitigate this problem, we can add auxilary via points in the middle of the first and the final sub-trajectories. Although the intial and the final acceleration is constrained, the positions are not. Therefore, it is possible to obtain a piece-wise cubic trajectory that have zero acceleration at the boundaries by adding 2 additional via points.

CATOCT does the followings:

  • solves nonlinear parametric optimization for optimal values of durations
  • satisfies continuous-acceleration and zero-acceleration constraints by solving a matrix equation
  • satisfies the velocity and acceleration limits by the use of opitmization.

This results in Continuous-Acceleration Time-Optimal Cubic Trajectory or CATOCT !!

How to use CATOCT ?:

CATOCT is a relatively small library and consists of only 1 Python file. We wrote a script for you to test it out. Simply download both files to your workspace, and run the script test.py to see the result. Alt text

Construct and perform optimization

In case you want to generate your own trajectory, you can try assigning your via points, velocity limits, and acceleration limits. Note that the initial position is defined separately from the via points. This represents the current joint state of the robotics manipulator.

from trajectory import Trajectory
import numpy as np

n = 3
N = 10
q_0 = np.random.rand(n,1)
q = np.random.rand(n,N)
v_max = [1]*n
a_max = [0.1]*n

Construct a "Trajectory" and assign the via_points as well as the velocity and acceleration limits. Once you have done that, you can run optimization by calling "time_optimal" on the initial position.

traj = Trajectory()
traj.set_position(q)
traj.set_bound(v_max,a_max)
traj.time_optimal(q_0)

CATOCT also provides a method called "evaluate" to evaluate the optimized trajectroy based on any time vector. We can generate a time vector using numpy's linspace and visualize the evaluated trajectory using matplotlib.

t = np.linspace(0,np.sum(traj.duration),1000)
q_t,v_t,a_t = traj.evaluate(t)

import matplotlib.pyplot as plt

# visualization
fig,axs = plt.subplots(3)
axs[0].plot(t,q_t)
axs[0].plot(np.cumsum(traj.duration),traj.position,'r*',linewidth=1,markersize=10)
axs[1].plot(t,v_t)
axs[1].plot(np.cumsum(traj.duration),traj.velocity,'r*',linewidth=1,markersize=10)
axs[2].plot(t,a_t)
axs[2].plot(np.cumsum(traj.duration),traj.acceleration,'r*',linewidth=1,markersize=10)
plt.show()

catoct's People

Contributors

tchoopojcharoen avatar

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    ๐Ÿ–– Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. ๐Ÿ“Š๐Ÿ“ˆ๐ŸŽ‰

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google โค๏ธ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.