Commit | Line | Data |
---|---|---|
df27a6a3 | 1 | /* |
5886a464 | 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) |
4cff3ded AW |
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. | |
df27a6a3 | 5 | You should have received a copy of the GNU General Public License along with Smoothie. If not, see <http://www.gnu.org/licenses/>. |
4cff3ded AW |
6 | */ |
7 | ||
8 | using namespace std; | |
9 | #include <vector> | |
4cff3ded AW |
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" | |
3fceb8eb | 17 | #include "Conveyor.h" |
b66fb830 | 18 | |
edac9072 AW |
19 | // The Planner does the acceleration math for the queue of Blocks ( movements ). |
20 | // It makes sure the speed stays within the configured constraints ( acceleration, junction_deviation, etc ) | |
21 | // It goes over the list in both direction, every time a block is added, re-doing the math to make sure everything is optimal | |
4cff3ded AW |
22 | |
23 | Planner::Planner(){ | |
aab6cbba AW |
24 | clear_vector(this->position); |
25 | clear_vector_double(this->previous_unit_vec); | |
26 | this->previous_nominal_speed = 0.0; | |
4cff3ded AW |
27 | this->has_deleted_block = false; |
28 | } | |
29 | ||
30 | void Planner::on_module_loaded(){ | |
476dcb96 | 31 | register_for_event(ON_CONFIG_RELOAD); |
da24d6ae AW |
32 | this->on_config_reload(this); |
33 | } | |
34 | ||
edac9072 | 35 | // Configure acceleration |
da24d6ae | 36 | void Planner::on_config_reload(void* argument){ |
4464301d | 37 | this->acceleration = this->kernel->config->value(acceleration_checksum )->by_default(100 )->as_number() * 60 * 60; // Acceleration is in mm/minute^2, see https://github.com/grbl/grbl/commit/9141ad282540eaa50a41283685f901f29c24ddbd#planner.c |
df27a6a3 | 38 | this->junction_deviation = this->kernel->config->value(junction_deviation_checksum )->by_default(0.05)->as_number(); |
4cff3ded AW |
39 | } |
40 | ||
da24d6ae | 41 | |
4cff3ded | 42 | // Append a block to the queue, compute it's speed factors |
aab6cbba | 43 | void Planner::append_block( int target[], double feed_rate, double distance, double deltas[] ){ |
3add9a23 | 44 | |
aab6cbba | 45 | // Stall here if the queue is ful |
3fceb8eb | 46 | this->kernel->conveyor->wait_for_queue(2); |
a2cd92c0 | 47 | |
edac9072 | 48 | // Create ( recycle ) a new block |
3fceb8eb | 49 | Block* block = this->kernel->conveyor->new_block(); |
df27a6a3 | 50 | block->planner = this; |
aab6cbba AW |
51 | |
52 | // Direction bits | |
df27a6a3 MM |
53 | block->direction_bits = 0; |
54 | for( int stepper=ALPHA_STEPPER; stepper<=GAMMA_STEPPER; stepper++){ | |
55 | if( target[stepper] < position[stepper] ){ block->direction_bits |= (1<<stepper); } | |
aab6cbba | 56 | } |
4cff3ded AW |
57 | |
58 | // Number of steps for each stepper | |
df27a6a3 | 59 | for( int stepper=ALPHA_STEPPER; stepper<=GAMMA_STEPPER; stepper++){ block->steps[stepper] = labs(target[stepper] - this->position[stepper]); } |
4cff3ded AW |
60 | |
61 | // Max number of steps, for all axes | |
62 | block->steps_event_count = max( block->steps[ALPHA_STEPPER], max( block->steps[BETA_STEPPER], block->steps[GAMMA_STEPPER] ) ); | |
63 | ||
4cff3ded | 64 | block->millimeters = distance; |
df27a6a3 | 65 | double inverse_millimeters = 0; |
436a2cd1 | 66 | if( distance > 0 ){ inverse_millimeters = 1.0/distance; } |
aab6cbba AW |
67 | |
68 | // Calculate speed in mm/minute for each axis. No divide by zero due to previous checks. | |
69 | // NOTE: Minimum stepper speed is limited by MINIMUM_STEPS_PER_MINUTE in stepper.c | |
70 | double inverse_minute = feed_rate * inverse_millimeters; | |
df27a6a3 | 71 | if( distance > 0 ){ |
436a2cd1 AW |
72 | block->nominal_speed = block->millimeters * inverse_minute; // (mm/min) Always > 0 |
73 | block->nominal_rate = ceil(block->steps_event_count * inverse_minute); // (step/min) Always > 0 | |
74 | }else{ | |
75 | block->nominal_speed = 0; | |
76 | block->nominal_rate = 0; | |
77 | } | |
aab6cbba | 78 | |
4cff3ded AW |
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: | |
aab6cbba | 85 | // Convert universal acceleration for direction-dependent stepper rate change parameter |
4464301d AW |
86 | block->rate_delta = (float)( ( block->steps_event_count*inverse_millimeters * this->acceleration ) / ( this->kernel->stepper->acceleration_ticks_per_second * 60 ) ); // (step/min/acceleration_tick) |
87 | ||
aab6cbba AW |
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 | ||
3fceb8eb | 105 | if (this->kernel->conveyor->queue.size() > 1 && (this->previous_nominal_speed > 0.0)) { |
aab6cbba AW |
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, | |
df27a6a3 | 120 | sqrt(this->acceleration * this->junction_deviation * sin_theta_d2/(1.0-sin_theta_d2)) ); |
aab6cbba AW |
121 | } |
122 | } | |
4cff3ded | 123 | } |
aab6cbba AW |
124 | block->max_entry_speed = vmax_junction; |
125 | ||
126 | // Initialize block entry speed. Compute based on deceleration to user-defined MINIMUM_PLANNER_SPEED. | |
7b49793d | 127 | double v_allowable = this->max_allowable_speed(-this->acceleration,0.0,block->millimeters); //TODO: Get from config |
aab6cbba AW |
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 | ||
aab6cbba AW |
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; | |
3a4fa0c1 | 145 | |
2bb8b390 | 146 | // Update current position |
4cff3ded | 147 | memcpy(this->position, target, sizeof(int)*3); |
2bb8b390 | 148 | |
df27a6a3 | 149 | // Math-heavy re-computing of the whole queue to take the new |
4cff3ded | 150 | this->recalculate(); |
3a4fa0c1 | 151 | |
df27a6a3 | 152 | // The block can now be used |
3a4fa0c1 | 153 | block->ready(); |
aab6cbba | 154 | |
4cff3ded AW |
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->reverse_pass(); | |
177 | this->forward_pass(); | |
178 | this->recalculate_trapezoids(); | |
179 | } | |
180 | ||
181 | // Planner::recalculate() needs to go over the current plan twice. Once in reverse and once forward. This | |
182 | // implements the reverse pass. | |
183 | void Planner::reverse_pass(){ | |
ded56b35 | 184 | // For each block |
3fceb8eb | 185 | int block_index = this->kernel->conveyor->queue.tail; |
ded56b35 AW |
186 | Block* blocks[3] = {NULL,NULL,NULL}; |
187 | ||
3fceb8eb L |
188 | while(block_index!=this->kernel->conveyor->queue.head){ |
189 | block_index = this->kernel->conveyor->queue.prev_block_index( block_index ); | |
ded56b35 AW |
190 | blocks[2] = blocks[1]; |
191 | blocks[1] = blocks[0]; | |
3fceb8eb | 192 | blocks[0] = &this->kernel->conveyor->queue.buffer[block_index]; |
ded56b35 AW |
193 | if( blocks[1] == NULL ){ continue; } |
194 | blocks[1]->reverse_pass(blocks[2], blocks[0]); | |
4cff3ded | 195 | } |
ded56b35 | 196 | |
4cff3ded AW |
197 | } |
198 | ||
199 | // Planner::recalculate() needs to go over the current plan twice. Once in reverse and once forward. This | |
200 | // implements the forward pass. | |
201 | void Planner::forward_pass() { | |
aab6cbba | 202 | // For each block |
3fceb8eb | 203 | int block_index = this->kernel->conveyor->queue.head; |
ded56b35 AW |
204 | Block* blocks[3] = {NULL,NULL,NULL}; |
205 | ||
3fceb8eb | 206 | while(block_index!=this->kernel->conveyor->queue.tail){ |
ded56b35 AW |
207 | blocks[0] = blocks[1]; |
208 | blocks[1] = blocks[2]; | |
3fceb8eb | 209 | blocks[2] = &this->kernel->conveyor->queue.buffer[block_index]; |
ded56b35 AW |
210 | if( blocks[0] == NULL ){ continue; } |
211 | blocks[1]->forward_pass(blocks[0],blocks[2]); | |
3fceb8eb | 212 | block_index = this->kernel->conveyor->queue.next_block_index( block_index ); |
df27a6a3 MM |
213 | } |
214 | blocks[2]->forward_pass(blocks[1],NULL); | |
ded56b35 | 215 | |
4cff3ded AW |
216 | } |
217 | ||
aab6cbba AW |
218 | // Recalculates the trapezoid speed profiles for flagged blocks in the plan according to the |
219 | // entry_speed for each junction and the entry_speed of the next junction. Must be called by | |
220 | // planner_recalculate() after updating the blocks. Any recalulate flagged junction will | |
221 | // compute the two adjacent trapezoids to the junction, since the junction speed corresponds | |
222 | // to exit speed and entry speed of one another. | |
13e4a3f9 | 223 | void Planner::recalculate_trapezoids() { |
3fceb8eb | 224 | int block_index = this->kernel->conveyor->queue.head; |
13e4a3f9 AW |
225 | Block* current; |
226 | Block* next = NULL; | |
4cff3ded | 227 | |
3fceb8eb | 228 | while(block_index != this->kernel->conveyor->queue.tail){ |
13e4a3f9 | 229 | current = next; |
3fceb8eb | 230 | next = &this->kernel->conveyor->queue.buffer[block_index]; |
13e4a3f9 AW |
231 | if( current ){ |
232 | // Recalculate if current block entry or exit junction speed has changed. | |
233 | if( current->recalculate_flag || next->recalculate_flag ){ | |
234 | current->calculate_trapezoid( current->entry_speed/current->nominal_speed, next->entry_speed/current->nominal_speed ); | |
235 | current->recalculate_flag = false; | |
236 | } | |
237 | } | |
3fceb8eb | 238 | block_index = this->kernel->conveyor->queue.next_block_index( block_index ); |
13e4a3f9 AW |
239 | } |
240 | ||
241 | // Last/newest block in buffer. Exit speed is set with MINIMUM_PLANNER_SPEED. Always recalculated. | |
242 | next->calculate_trapezoid( next->entry_speed/next->nominal_speed, MINIMUM_PLANNER_SPEED/next->nominal_speed); //TODO: Make configuration option | |
243 | next->recalculate_flag = false; | |
244 | ||
245 | } | |
4cff3ded AW |
246 | |
247 | // Debug function | |
248 | void Planner::dump_queue(){ | |
3fceb8eb L |
249 | for( int index = 0; index <= this->kernel->conveyor->queue.size()-1; index++ ){ |
250 | if( index > 10 && index < this->kernel->conveyor->queue.size()-10 ){ continue; } | |
38d375e7 | 251 | this->kernel->streams->printf("block %03d > ", index); |
3fceb8eb | 252 | this->kernel->conveyor->queue.get_ref(index)->debug(this->kernel); |
4cff3ded AW |
253 | } |
254 | } | |
aab6cbba | 255 | |
aab6cbba AW |
256 | // Calculates the maximum allowable speed at this point when you must be able to reach target_velocity using the |
257 | // acceleration within the allotted distance. | |
258 | double Planner::max_allowable_speed(double acceleration, double target_velocity, double distance) { | |
259 | return( | |
4464301d | 260 | sqrt(target_velocity*target_velocity-2L*acceleration*distance) //Was acceleration*60*60*distance, in case this breaks, but here we prefer to use seconds instead of minutes |
aab6cbba AW |
261 | ); |
262 | } | |
263 | ||
264 |