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
  11 #include "mri.h"
  12 #include "nuts_bolts.h"
  13 #include "RingBuffer.h"
  14 #include "Gcode.h"
  15 #include "Module.h"
  16 #include "Kernel.h"
  17 #include "Block.h"
  18 #include "Planner.h"
  19 #include "Conveyor.h"
  20 #include "StepperMotor.h"
  21 #include "Config.h"
  22 #include "checksumm.h"
  23 #include "Robot.h"
  24 #include "Stepper.h"
  25 #include "ConfigValue.h"
  26
  27 #include <math.h>
  28
  29 #define acceleration_checksum          CHECKSUM("acceleration")
  30 #define z_acceleration_checksum        CHECKSUM("z_acceleration")
  31 #define max_jerk_checksum              CHECKSUM("max_jerk")
  32 #define junction_deviation_checksum    CHECKSUM("junction_deviation")
  33 #define minimum_planner_speed_checksum CHECKSUM("minimum_planner_speed")
  34
  35 // The Planner does the acceleration math for the queue of Blocks ( movements ).
  36 // It makes sure the speed stays within the configured constraints ( acceleration, junction_deviation, etc )
  37 // It goes over the list in both direction, every time a block is added, re-doing the math to make sure everything is optimal
  38
  39 Planner::Planner(){
  40     clear_vector_float(this->previous_unit_vec);
  41     config_load();
  42 }
  43
  44 // Configure acceleration
  45 void Planner::config_load(){
  46     this->acceleration = THEKERNEL->config->value(acceleration_checksum)->by_default(100.0F )->as_number(); // Acceleration is in mm/s^2
  47     this->z_acceleration = THEKERNEL->config->value(z_acceleration_checksum)->by_default(0.0F )->as_number(); // disabled by default
  48
  49     this->junction_deviation = THEKERNEL->config->value(junction_deviation_checksum)->by_default(  0.05F)->as_number();
  50     this->minimum_planner_speed = THEKERNEL->config->value(minimum_planner_speed_checksum)->by_default(0.0f)->as_number();
  51 }
  52
  53
  54 // Append a block to the queue, compute it's speed factors
  55 void Planner::append_block( float actuator_pos[], float rate_mm_s, float distance, float unit_vec[] )
  56 {
  57     float acceleration;
  58
  59     // Create ( recycle ) a new block
  60     Block* block = THEKERNEL->conveyor->queue.head_ref();
  61
  62
  63     // Direction bits
  64     for (int i = 0; i < 3; i++)
  65     {
  66         int steps = THEKERNEL->robot->actuators[i]->steps_to_target(actuator_pos[i]);
  67
  68         block->direction_bits[i] = (steps < 0) ? 1 : 0;
  69
  70         // Update current position
  71         THEKERNEL->robot->actuators[i]->last_milestone_steps += steps;
  72         THEKERNEL->robot->actuators[i]->last_milestone_mm = actuator_pos[i];
  73
  74         block->steps[i] = labs(steps);
  75     }
  76
  77     // use either regular acceleration or a z only move accleration
  78     if(this->z_acceleration > 0.0F && block->steps[ALPHA_STEPPER] == 0 && block->steps[BETA_STEPPER] == 0) {
  79         // z only move
  80         acceleration= this->z_acceleration;
  81     } else{
  82         acceleration= this->acceleration;
  83     }
  84
  85     // Max number of steps, for all axes
  86     block->steps_event_count = max( block->steps[ALPHA_STEPPER], max( block->steps[BETA_STEPPER], block->steps[GAMMA_STEPPER] ) );
  87
  88     block->millimeters = distance;
  89
  90     // Calculate speed in mm/sec for each axis. No divide by zero due to previous checks.
  91     // NOTE: Minimum stepper speed is limited by MINIMUM_STEPS_PER_MINUTE in stepper.c
  92     if( distance > 0.0F ){
  93         block->nominal_speed = rate_mm_s;           // (mm/s) Always > 0
  94         block->nominal_rate = ceil(block->steps_event_count * rate_mm_s / distance); // (step/s) Always > 0
  95     }else{
  96         block->nominal_speed = 0.0F;
  97         block->nominal_rate  = 0;
  98     }
  99
 100     // Compute the acceleration rate for the trapezoid generator. Depending on the slope of the line
 101     // average travel per step event changes. For a line along one axis the travel per step event
 102     // is equal to the travel/step in the particular axis. For a 45 degree line the steppers of both
 103     // axes might step for every step event. Travel per step event is then sqrt(travel_x^2+travel_y^2).
 104     // To generate trapezoids with contant acceleration between blocks the rate_delta must be computed
 105     // specifically for each line to compensate for this phenomenon:
 106     // Convert universal acceleration for direction-dependent stepper rate change parameter
 107     block->rate_delta = (block->steps_event_count * acceleration) / (distance * THEKERNEL->stepper->get_acceleration_ticks_per_second()); // (step/min/acceleration_tick)
 108
 109     // Compute maximum allowable entry speed at junction by centripetal acceleration approximation.
 110     // Let a circle be tangent to both previous and current path line segments, where the junction
 111     // deviation is defined as the distance from the junction to the closest edge of the circle,
 112     // colinear with the circle center. The circular segment joining the two paths represents the
 113     // path of centripetal acceleration. Solve for max velocity based on max acceleration about the
 114     // radius of the circle, defined indirectly by junction deviation. This may be also viewed as
 115     // path width or max_jerk in the previous grbl version. This approach does not actually deviate
 116     // from path, but used as a robust way to compute cornering speeds, as it takes into account the
 117     // nonlinearities of both the junction angle and junction velocity.
 118     float vmax_junction = minimum_planner_speed; // Set default max junction speed
 119
 120     if (!THEKERNEL->conveyor->is_queue_empty())
 121     {
 122         float previous_nominal_speed = THEKERNEL->conveyor->queue.item_ref(THEKERNEL->conveyor->queue.prev(THEKERNEL->conveyor->queue.head_i))->nominal_speed;
 123
 124         if (previous_nominal_speed > 0.0F) {
 125             // Compute cosine of angle between previous and current path. (prev_unit_vec is negative)
 126             // NOTE: Max junction velocity is computed without sin() or acos() by trig half angle identity.
 127             float cos_theta = - this->previous_unit_vec[X_AXIS] * unit_vec[X_AXIS]
 128                                 - this->previous_unit_vec[Y_AXIS] * unit_vec[Y_AXIS]
 129                                 - this->previous_unit_vec[Z_AXIS] * unit_vec[Z_AXIS] ;
 130
 131             // Skip and use default max junction speed for 0 degree acute junction.
 132             if (cos_theta < 0.95F) {
 133                 vmax_junction = min(previous_nominal_speed, block->nominal_speed);
 134                 // Skip and avoid divide by zero for straight junctions at 180 degrees. Limit to min() of nominal speeds.
 135                 if (cos_theta > -0.95F) {
 136                     // Compute maximum junction velocity based on maximum acceleration and junction deviation
 137                     float sin_theta_d2 = sqrtf(0.5F * (1.0F - cos_theta)); // Trig half angle identity. Always positive.
 138                     vmax_junction = min(vmax_junction, sqrtf(acceleration * this->junction_deviation * sin_theta_d2 / (1.0F - sin_theta_d2)));
 139                 }
 140             }
 141         }
 142     }
 143     block->max_entry_speed = vmax_junction;
 144
 145     // Initialize block entry speed. Compute based on deceleration to user-defined minimum_planner_speed.
 146     float v_allowable = max_allowable_speed(-acceleration, minimum_planner_speed, block->millimeters); //TODO: Get from config
 147     block->entry_speed = min(vmax_junction, v_allowable);
 148
 149     // Initialize planner efficiency flags
 150     // Set flag if block will always reach maximum junction speed regardless of entry/exit speeds.
 151     // If a block can de/ac-celerate from nominal speed to zero within the length of the block, then
 152     // the current block and next block junction speeds are guaranteed to always be at their maximum
 153     // junction speeds in deceleration and acceleration, respectively. This is due to how the current
 154     // block nominal speed limits both the current and next maximum junction speeds. Hence, in both
 155     // the reverse and forward planners, the corresponding block junction speed will always be at the
 156     // the maximum junction speed and may always be ignored for any speed reduction checks.
 157     if (block->nominal_speed <= v_allowable) { block->nominal_length_flag = true; }
 158     else { block->nominal_length_flag = false; }
 159
 160     // Always calculate trapezoid for new block
 161     block->recalculate_flag = true;
 162
 163     // Update previous path unit_vector and nominal speed
 164     memcpy(this->previous_unit_vec, unit_vec, sizeof(previous_unit_vec)); // previous_unit_vec[] = unit_vec[]
 165
 166     // Math-heavy re-computing of the whole queue to take the new
 167     this->recalculate();
 168
 169     // The block can now be used
 170     block->ready();
 171
 172     THEKERNEL->conveyor->queue_head_block();
 173 }
 174
 175 void Planner::recalculate() {
 176     Conveyor::Queue_t &queue = THEKERNEL->conveyor->queue;
 177
 178     unsigned int block_index;
 179
 180     Block* previous;
 181     Block* current;
 182
 183     /*
 184      * a newly added block is decel limited
 185      *
 186      * we find its max entry speed given its exit speed
 187      *
 188      * for each block, walking backwards in the queue:
 189      *
 190      * if max entry speed == current entry speed
 191      * then we can set recalculate to false, since clearly adding another block didn't allow us to enter faster
 192      * and thus we don't need to check entry speed for this block any more
 193      *
 194      * once we find an accel limited block, we must find the max exit speed and walk the queue forwards
 195      *
 196      * for each block, walking forwards in the queue:
 197      *
 198      * given the exit speed of the previous block and our own max entry speed
 199      * we can tell if we're accel or decel limited (or coasting)
 200      *
 201      * if prev_exit > max_entry
 202      *     then we're still decel limited. update previous trapezoid with our max entry for prev exit
 203      * if max_entry >= prev_exit
 204      *     then we're accel limited. set recalculate to false, work out max exit speed
 205      *
 206      * finally, work out trapezoid for the final (and newest) block.
 207      */
 208
 209     /*
 210      * Step 1:
 211      * For each block, given the exit speed and acceleration, find the maximum entry speed
 212      */
 213
 214     float entry_speed = minimum_planner_speed;
 215
 216     block_index = queue.head_i;
 217     current     = queue.item_ref(block_index);
 218
 219     if (!queue.is_empty())
 220     {
 221         while ((block_index != queue.tail_i) && current->recalculate_flag)
 222         {
 223             entry_speed = current->reverse_pass(entry_speed);
 224
 225             block_index = queue.prev(block_index);
 226             current     = queue.item_ref(block_index);
 227         }
 228
 229         /*
 230          * Step 2:
 231          * now current points to either tail or first non-recalculate block
 232          * and has not had its reverse_pass called
 233          * or its calc trap
 234          * entry_speed is set to the *exit* speed of current.
 235          * each block from current to head has its entry speed set to its max entry speed- limited by decel or nominal_rate
 236          */
 237
 238         float exit_speed = current->max_exit_speed();
 239
 240         while (block_index != queue.head_i)
 241         {
 242             previous    = current;
 243             block_index = queue.next(block_index);
 244             current     = queue.item_ref(block_index);
 245
 246             // we pass the exit speed of the previous block
 247             // so this block can decide if it's accel or decel limited and update its fields as appropriate
 248             exit_speed = current->forward_pass(exit_speed);
 249
 250             previous->calculate_trapezoid(previous->entry_speed, current->entry_speed);
 251         }
 252     }
 253
 254     /*
 255      * Step 3:
 256      * work out trapezoid for final (and newest) block
 257      */
 258
 259     // now current points to the head item
 260     // which has not had calculate_trapezoid run yet
 261     current->calculate_trapezoid(current->entry_speed, minimum_planner_speed);
 262 }
 263
 264
 265 // Calculates the maximum allowable speed at this point when you must be able to reach target_velocity using the
 266 // acceleration within the allotted distance.
 267 float Planner::max_allowable_speed(float acceleration, float target_velocity, float distance) {
 268   return(
 269     sqrtf(target_velocity*target_velocity-2.0F*acceleration*distance)  //Was acceleration*60*60*distance, in case this breaks, but here we prefer to use seconds instead of minutes
 270   );
 271 }
 272
 273