src/modules/robot/Planner.cpp

   1 /*
   2       This file is part of Smoothie (http://smoothieware.org/). The motion control part is heavily based on Grbl (https://github.com/simen/grbl) with additions from Sungeun K. Jeon (https://github.com/chamnit/grbl)
   3       Smoothie is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.
   4       Smoothie is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
   5       You should have received a copy of the GNU General Public License along with Smoothie. If not, see <http://www.gnu.org/licenses/>.
   6 */
   7
   8 using namespace std;
   9 #include <vector>
  10 #include "libs/nuts_bolts.h"
  11 #include "libs/RingBuffer.h"
  12 #include "../communication/utils/Gcode.h"
  13 #include "libs/Module.h"
  14 #include "libs/Kernel.h"
  15 #include "Block.h"
  16 #include "Planner.h"
  17 #include "Player.h"
  18
  19
  20 Planner::Planner(){
  21     clear_vector(this->position);
  22     clear_vector_double(this->previous_unit_vec);
  23     this->previous_nominal_speed = 0.0;
  24     this->has_deleted_block = false;
  25 }
  26
  27 void Planner::on_module_loaded(){
  28     this->on_config_reload(this);
  29 }
  30
  31 void Planner::on_config_reload(void* argument){
  32     this->acceleration =       this->kernel->config->value(acceleration_checksum       )->by_default(100 )->as_number();
  33     this->max_jerk =           this->kernel->config->value(max_jerk_checksum           )->by_default(100 )->as_number();
  34     this->junction_deviation = this->kernel->config->value(junction_deviation_checksum )->by_default(0.05)->as_number();
  35 }
  36
  37
  38 // Append a block to the queue, compute it's speed factors
  39 void Planner::append_block( int target[], double feed_rate, double distance, double deltas[] ){
  40
  41     //printf("new block\r\n");
  42
  43     // Stall here if the queue is ful
  44     this->kernel->player->wait_for_queue(2);
  45
  46     Block* block = this->kernel->player->new_block();
  47     block->planner = this;
  48
  49     // Direction bits
  50     block->direction_bits = 0;
  51     for( int stepper=ALPHA_STEPPER; stepper<=GAMMA_STEPPER; stepper++){
  52         if( target[stepper] < position[stepper] ){ block->direction_bits |= (1<<stepper); }
  53     }
  54
  55     // Number of steps for each stepper
  56     for( int stepper=ALPHA_STEPPER; stepper<=GAMMA_STEPPER; stepper++){ block->steps[stepper] = labs(target[stepper] - this->position[stepper]); }
  57
  58     // Max number of steps, for all axes
  59     block->steps_event_count = max( block->steps[ALPHA_STEPPER], max( block->steps[BETA_STEPPER], block->steps[GAMMA_STEPPER] ) );
  60     //if( block->steps_event_count == 0 ){ this->computing = false; return; }
  61
  62     block->millimeters = distance;
  63     double inverse_millimeters = 0;
  64     if( distance > 0 ){ inverse_millimeters = 1.0/distance; }
  65
  66     // Calculate speed in mm/minute for each axis. No divide by zero due to previous checks.
  67     // NOTE: Minimum stepper speed is limited by MINIMUM_STEPS_PER_MINUTE in stepper.c
  68     double inverse_minute = feed_rate * inverse_millimeters;
  69     if( distance > 0 ){
  70         block->nominal_speed = block->millimeters * inverse_minute;           // (mm/min) Always > 0
  71         block->nominal_rate = ceil(block->steps_event_count * inverse_minute); // (step/min) Always > 0
  72     }else{
  73         block->nominal_speed = 0;
  74         block->nominal_rate = 0;
  75     }
  76
  77     //this->kernel->streams->printf("nom_speed: %f nom_rate: %u step_event_count: %u block->steps_z: %u \r\n", block->nominal_speed, block->nominal_rate, block->steps_event_count, block->steps[2]  );
  78
  79     // Compute the acceleration rate for the trapezoid generator. Depending on the slope of the line
  80     // average travel per step event changes. For a line along one axis the travel per step event
  81     // is equal to the travel/step in the particular axis. For a 45 degree line the steppers of both
  82     // axes might step for every step event. Travel per step event is then sqrt(travel_x^2+travel_y^2).
  83     // To generate trapezoids with contant acceleration between blocks the rate_delta must be computed
  84     // specifically for each line to compensate for this phenomenon:
  85     // Convert universal acceleration for direction-dependent stepper rate change parameter
  86     block->rate_delta = ceil( block->steps_event_count*inverse_millimeters * this->acceleration*60.0 / this->kernel->stepper->acceleration_ticks_per_second ); // (step/min/acceleration_tick)
  87
  88     // Compute path unit vector
  89     double unit_vec[3];
  90     unit_vec[X_AXIS] = deltas[X_AXIS]*inverse_millimeters;
  91     unit_vec[Y_AXIS] = deltas[Y_AXIS]*inverse_millimeters;
  92     unit_vec[Z_AXIS] = deltas[Z_AXIS]*inverse_millimeters;
  93
  94     // Compute maximum allowable entry speed at junction by centripetal acceleration approximation.
  95     // Let a circle be tangent to both previous and current path line segments, where the junction
  96     // deviation is defined as the distance from the junction to the closest edge of the circle,
  97     // colinear with the circle center. The circular segment joining the two paths represents the
  98     // path of centripetal acceleration. Solve for max velocity based on max acceleration about the
  99     // radius of the circle, defined indirectly by junction deviation. This may be also viewed as
 100     // path width or max_jerk in the previous grbl version. This approach does not actually deviate
 101     // from path, but used as a robust way to compute cornering speeds, as it takes into account the
 102     // nonlinearities of both the junction angle and junction velocity.
 103     double vmax_junction = MINIMUM_PLANNER_SPEED; // Set default max junction speed
 104
 105     if (this->kernel->player->queue.size() > 1 && (this->previous_nominal_speed > 0.0)) {
 106       // Compute cosine of angle between previous and current path. (prev_unit_vec is negative)
 107       // NOTE: Max junction velocity is computed without sin() or acos() by trig half angle identity.
 108       double cos_theta = - this->previous_unit_vec[X_AXIS] * unit_vec[X_AXIS]
 109                          - this->previous_unit_vec[Y_AXIS] * unit_vec[Y_AXIS]
 110                          - this->previous_unit_vec[Z_AXIS] * unit_vec[Z_AXIS] ;
 111
 112       // Skip and use default max junction speed for 0 degree acute junction.
 113       if (cos_theta < 0.95) {
 114         vmax_junction = min(this->previous_nominal_speed,block->nominal_speed);
 115         // Skip and avoid divide by zero for straight junctions at 180 degrees. Limit to min() of nominal speeds.
 116         if (cos_theta > -0.95) {
 117           // Compute maximum junction velocity based on maximum acceleration and junction deviation
 118           double sin_theta_d2 = sqrt(0.5*(1.0-cos_theta)); // Trig half angle identity. Always positive.
 119           vmax_junction = min(vmax_junction,
 120             sqrt(this->acceleration*60*60 * this->junction_deviation * sin_theta_d2/(1.0-sin_theta_d2)) );
 121         }
 122       }
 123     }
 124     block->max_entry_speed = vmax_junction;
 125
 126     // Initialize block entry speed. Compute based on deceleration to user-defined MINIMUM_PLANNER_SPEED.
 127     double v_allowable = this->max_allowable_speed(-this->acceleration,0.0,block->millimeters); //TODO: Get from config
 128     block->entry_speed = min(vmax_junction, v_allowable);
 129
 130     // Initialize planner efficiency flags
 131     // Set flag if block will always reach maximum junction speed regardless of entry/exit speeds.
 132     // If a block can de/ac-celerate from nominal speed to zero within the length of the block, then
 133     // the current block and next block junction speeds are guaranteed to always be at their maximum
 134     // junction speeds in deceleration and acceleration, respectively. This is due to how the current
 135     // block nominal speed limits both the current and next maximum junction speeds. Hence, in both
 136     // the reverse and forward planners, the corresponding block junction speed will always be at the
 137     // the maximum junction speed and may always be ignored for any speed reduction checks.
 138     if (block->nominal_speed <= v_allowable) { block->nominal_length_flag = true; }
 139     else { block->nominal_length_flag = false; }
 140     block->recalculate_flag = true; // Always calculate trapezoid for new block
 141
 142     // Update previous path unit_vector and nominal speed
 143     memcpy(this->previous_unit_vec, unit_vec, sizeof(unit_vec)); // previous_unit_vec[] = unit_vec[]
 144     this->previous_nominal_speed = block->nominal_speed;
 145
 146     // Update current position
 147     memcpy(this->position, target, sizeof(int)*3);
 148
 149     // Math-heavy re-computing of the whole queue to take the new
 150     this->recalculate();
 151
 152     // The block can now be used
 153     block->ready();
 154
 155 }
 156
 157
 158 // Recalculates the motion plan according to the following algorithm:
 159 //
 160 // 1. Go over every block in reverse order and calculate a junction speed reduction (i.e. block_t.entry_factor)
 161 // so that:
 162 //   a. The junction jerk is within the set limit
 163 //   b. No speed reduction within one block requires faster deceleration than the one, true constant
 164 //      acceleration.
 165 // 2. Go over every block in chronological order and dial down junction speed reduction values if
 166 //   a. The speed increase within one block would require faster accelleration than the one, true
 167 //      constant acceleration.
 168 //
 169 // When these stages are complete all blocks have an entry_factor that will allow all speed changes to
 170 // be performed using only the one, true constant acceleration, and where no junction jerk is jerkier than
 171 // the set limit. Finally it will:
 172 //
 173 // 3. Recalculate trapezoids for all blocks.
 174 //
 175 void Planner::recalculate() {
 176    //this->kernel->streams->printf("recalculate last: %p, queue size: %d \r\n", this->kernel->player->queue.get_ref( this->kernel->player->queue.size()-1  ), this->kernel->player->queue.size() );
 177    this->reverse_pass();
 178    this->forward_pass();
 179    this->recalculate_trapezoids();
 180 }
 181
 182 // Planner::recalculate() needs to go over the current plan twice. Once in reverse and once forward. This
 183 // implements the reverse pass.
 184 void Planner::reverse_pass(){
 185     // For each block
 186     int block_index = this->kernel->player->queue.tail;
 187     Block* blocks[3] = {NULL,NULL,NULL};
 188
 189     while(block_index!=this->kernel->player->queue.head){
 190         block_index = this->kernel->player->queue.prev_block_index( block_index );
 191         blocks[2] = blocks[1];
 192         blocks[1] = blocks[0];
 193         blocks[0] = &this->kernel->player->queue.buffer[block_index];
 194         if( blocks[1] == NULL ){ continue; }
 195         blocks[1]->reverse_pass(blocks[2], blocks[0]);
 196     }
 197
 198 }
 199
 200 // Planner::recalculate() needs to go over the current plan twice. Once in reverse and once forward. This
 201 // implements the forward pass.
 202 void Planner::forward_pass() {
 203     // For each block
 204     int block_index = this->kernel->player->queue.head;
 205     Block* blocks[3] = {NULL,NULL,NULL};
 206
 207     while(block_index!=this->kernel->player->queue.tail){
 208         blocks[0] = blocks[1];
 209         blocks[1] = blocks[2];
 210         blocks[2] = &this->kernel->player->queue.buffer[block_index];
 211         if( blocks[0] == NULL ){ continue; }
 212         blocks[1]->forward_pass(blocks[0],blocks[2]);
 213         block_index = this->kernel->player->queue.next_block_index( block_index );
 214     }
 215     blocks[2]->forward_pass(blocks[1],NULL);
 216
 217 }
 218
 219 // Recalculates the trapezoid speed profiles for flagged blocks in the plan according to the
 220 // entry_speed for each junction and the entry_speed of the next junction. Must be called by
 221 // planner_recalculate() after updating the blocks. Any recalulate flagged junction will
 222 // compute the two adjacent trapezoids to the junction, since the junction speed corresponds
 223 // to exit speed and entry speed of one another.
 224 void Planner::recalculate_trapezoids() {
 225     int block_index = this->kernel->player->queue.head;
 226     Block* current;
 227     Block* next = NULL;
 228
 229     while(block_index != this->kernel->player->queue.tail){
 230         current = next;
 231         next = &this->kernel->player->queue.buffer[block_index];
 232         //this->kernel->streams->printf("index:%d current:%p next:%p \r\n", block_index, current, next );
 233         if( current ){
 234             // Recalculate if current block entry or exit junction speed has changed.
 235             if( current->recalculate_flag || next->recalculate_flag ){
 236                 current->calculate_trapezoid( current->entry_speed/current->nominal_speed, next->entry_speed/current->nominal_speed );
 237                 current->recalculate_flag = false;
 238             }
 239         }
 240         block_index = this->kernel->player->queue.next_block_index( block_index );
 241     }
 242
 243     // Last/newest block in buffer. Exit speed is set with MINIMUM_PLANNER_SPEED. Always recalculated.
 244     next->calculate_trapezoid( next->entry_speed/next->nominal_speed, MINIMUM_PLANNER_SPEED/next->nominal_speed); //TODO: Make configuration option
 245     next->recalculate_flag = false;
 246
 247 }
 248
 249 // Debug function
 250 void Planner::dump_queue(){
 251     for( int index = 0; index <= this->kernel->player->queue.size()-1; index++ ){
 252        if( index > 10 && index < this->kernel->player->queue.size()-10 ){ continue; }
 253        this->kernel->streams->printf("block %03d > ", index);
 254        this->kernel->player->queue.get_ref(index)->debug(this->kernel);
 255     }
 256 }
 257
 258 // Calculates the maximum allowable speed at this point when you must be able to reach target_velocity using the
 259 // acceleration within the allotted distance.
 260 double Planner::max_allowable_speed(double acceleration, double target_velocity, double distance) {
 261   return(
 262     sqrt(target_velocity*target_velocity-2L*acceleration*60*60*distance)  //Was acceleration*60*60*distance, in case this breaks, but here we prefer to use seconds instead of minutes
 263   );
 264 }
 265
 266