My Marlin configs for Fabrikator Mini and CTC i3 Pro B
Você não pode selecionar mais de 25 tópicos Os tópicos devem começar com uma letra ou um número, podem incluir traços ('-') e podem ter até 35 caracteres.

planner.cpp 31KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753
  1. /*
  2. planner.c - buffers movement commands and manages the acceleration profile plan
  3. Part of Grbl
  4. Copyright (c) 2009-2011 Simen Svale Skogsrud
  5. Grbl is free software: you can redistribute it and/or modify
  6. it under the terms of the GNU General Public License as published by
  7. the Free Software Foundation, either version 3 of the License, or
  8. (at your option) any later version.
  9. Grbl is distributed in the hope that it will be useful,
  10. but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  12. GNU General Public License for more details.
  13. You should have received a copy of the GNU General Public License
  14. along with Grbl. If not, see <http://www.gnu.org/licenses/>.
  15. */
  16. /* The ring buffer implementation gleaned from the wiring_serial library by David A. Mellis. */
  17. /*
  18. Reasoning behind the mathematics in this module (in the key of 'Mathematica'):
  19. s == speed, a == acceleration, t == time, d == distance
  20. Basic definitions:
  21. Speed[s_, a_, t_] := s + (a*t)
  22. Travel[s_, a_, t_] := Integrate[Speed[s, a, t], t]
  23. Distance to reach a specific speed with a constant acceleration:
  24. Solve[{Speed[s, a, t] == m, Travel[s, a, t] == d}, d, t]
  25. d -> (m^2 - s^2)/(2 a) --> estimate_acceleration_distance()
  26. Speed after a given distance of travel with constant acceleration:
  27. Solve[{Speed[s, a, t] == m, Travel[s, a, t] == d}, m, t]
  28. m -> Sqrt[2 a d + s^2]
  29. DestinationSpeed[s_, a_, d_] := Sqrt[2 a d + s^2]
  30. When to start braking (di) to reach a specified destionation speed (s2) after accelerating
  31. from initial speed s1 without ever stopping at a plateau:
  32. Solve[{DestinationSpeed[s1, a, di] == DestinationSpeed[s2, a, d - di]}, di]
  33. di -> (2 a d - s1^2 + s2^2)/(4 a) --> intersection_distance()
  34. IntersectionDistance[s1_, s2_, a_, d_] := (2 a d - s1^2 + s2^2)/(4 a)
  35. */
  36. //#include <inttypes.h>
  37. //#include <math.h>
  38. //#include <stdlib.h>
  39. #include "Marlin.h"
  40. #include "Configuration.h"
  41. #include "pins.h"
  42. #include "fastio.h"
  43. #include "planner.h"
  44. #include "stepper.h"
  45. #include "temperature.h"
  46. #include "ultralcd.h"
  47. //===========================================================================
  48. //=============================public variables ============================
  49. //===========================================================================
  50. unsigned long minsegmenttime;
  51. float max_feedrate[4]; // set the max speeds
  52. float axis_steps_per_unit[4];
  53. unsigned long max_acceleration_units_per_sq_second[4]; // Use M201 to override by software
  54. float minimumfeedrate;
  55. float acceleration; // Normal acceleration mm/s^2 THIS IS THE DEFAULT ACCELERATION for all moves. M204 SXXXX
  56. float retract_acceleration; // mm/s^2 filament pull-pack and push-forward while standing still in the other axis M204 TXXXX
  57. float max_xy_jerk; //speed than can be stopped at once, if i understand correctly.
  58. float max_z_jerk;
  59. float mintravelfeedrate;
  60. unsigned long axis_steps_per_sqr_second[NUM_AXIS];
  61. // The current position of the tool in absolute steps
  62. long position[4]; //rescaled from extern when axis_steps_per_unit are changed by gcode
  63. static float previous_speed[4]; // Speed of previous path line segment
  64. static float previous_nominal_speed; // Nominal speed of previous path line segment
  65. #ifdef AUTOTEMP
  66. float autotemp_max=250;
  67. float autotemp_min=210;
  68. float autotemp_factor=1;
  69. bool autotemp_enabled=false;
  70. #endif
  71. //===========================================================================
  72. //=============================private variables ============================
  73. //===========================================================================
  74. static block_t block_buffer[BLOCK_BUFFER_SIZE]; // A ring buffer for motion instfructions
  75. static volatile unsigned char block_buffer_head; // Index of the next block to be pushed
  76. static volatile unsigned char block_buffer_tail; // Index of the block to process now
  77. // Used for the frequency limit
  78. static unsigned char old_direction_bits = 0; // Old direction bits. Used for speed calculations
  79. static long x_segment_time[3]={0,0,0}; // Segment times (in us). Used for speed calculations
  80. static long y_segment_time[3]={0,0,0};
  81. // Returns the index of the next block in the ring buffer
  82. // NOTE: Removed modulo (%) operator, which uses an expensive divide and multiplication.
  83. static int8_t next_block_index(int8_t block_index) {
  84. block_index++;
  85. if (block_index == BLOCK_BUFFER_SIZE) { block_index = 0; }
  86. return(block_index);
  87. }
  88. // Returns the index of the previous block in the ring buffer
  89. static int8_t prev_block_index(int8_t block_index) {
  90. if (block_index == 0) { block_index = BLOCK_BUFFER_SIZE; }
  91. block_index--;
  92. return(block_index);
  93. }
  94. //===========================================================================
  95. //=============================functions ============================
  96. //===========================================================================
  97. // Calculates the distance (not time) it takes to accelerate from initial_rate to target_rate using the
  98. // given acceleration:
  99. inline float estimate_acceleration_distance(float initial_rate, float target_rate, float acceleration) {
  100. if (acceleration!=0) {
  101. return((target_rate*target_rate-initial_rate*initial_rate)/
  102. (2.0*acceleration));
  103. }
  104. else {
  105. return 0.0; // acceleration was 0, set acceleration distance to 0
  106. }
  107. }
  108. // This function gives you the point at which you must start braking (at the rate of -acceleration) if
  109. // you started at speed initial_rate and accelerated until this point and want to end at the final_rate after
  110. // a total travel of distance. This can be used to compute the intersection point between acceleration and
  111. // deceleration in the cases where the trapezoid has no plateau (i.e. never reaches maximum speed)
  112. inline float intersection_distance(float initial_rate, float final_rate, float acceleration, float distance) {
  113. if (acceleration!=0) {
  114. return((2.0*acceleration*distance-initial_rate*initial_rate+final_rate*final_rate)/
  115. (4.0*acceleration) );
  116. }
  117. else {
  118. return 0.0; // acceleration was 0, set intersection distance to 0
  119. }
  120. }
  121. // Calculates trapezoid parameters so that the entry- and exit-speed is compensated by the provided factors.
  122. void calculate_trapezoid_for_block(block_t *block, float entry_factor, float exit_factor) {
  123. unsigned long initial_rate = ceil(block->nominal_rate*entry_factor); // (step/min)
  124. unsigned long final_rate = ceil(block->nominal_rate*exit_factor); // (step/min)
  125. // Limit minimal step rate (Otherwise the timer will overflow.)
  126. if(initial_rate <120) {initial_rate=120; }
  127. if(final_rate < 120) {final_rate=120; }
  128. long acceleration = block->acceleration_st;
  129. int32_t accelerate_steps =
  130. ceil(estimate_acceleration_distance(block->initial_rate, block->nominal_rate, acceleration));
  131. int32_t decelerate_steps =
  132. floor(estimate_acceleration_distance(block->nominal_rate, block->final_rate, -acceleration));
  133. // Calculate the size of Plateau of Nominal Rate.
  134. int32_t plateau_steps = block->step_event_count-accelerate_steps-decelerate_steps;
  135. // Is the Plateau of Nominal Rate smaller than nothing? That means no cruising, and we will
  136. // have to use intersection_distance() to calculate when to abort acceleration and start braking
  137. // in order to reach the final_rate exactly at the end of this block.
  138. if (plateau_steps < 0) {
  139. accelerate_steps = ceil(
  140. intersection_distance(block->initial_rate, block->final_rate, acceleration, block->step_event_count));
  141. accelerate_steps = max(accelerate_steps,0); // Check limits due to numerical round-off
  142. accelerate_steps = min(accelerate_steps,block->step_event_count);
  143. plateau_steps = 0;
  144. }
  145. #ifdef ADVANCE
  146. long initial_advance = block->advance*entry_factor*entry_factor;
  147. long final_advance = block->advance*exit_factor*exit_factor;
  148. #endif // ADVANCE
  149. // block->accelerate_until = accelerate_steps;
  150. // block->decelerate_after = accelerate_steps+plateau_steps;
  151. CRITICAL_SECTION_START; // Fill variables used by the stepper in a critical section
  152. if(block->busy == false) { // Don't update variables if block is busy.
  153. block->accelerate_until = accelerate_steps;
  154. block->decelerate_after = accelerate_steps+plateau_steps;
  155. block->initial_rate = initial_rate;
  156. block->final_rate = final_rate;
  157. #ifdef ADVANCE
  158. block->initial_advance = initial_advance;
  159. block->final_advance = final_advance;
  160. #endif //ADVANCE
  161. }
  162. CRITICAL_SECTION_END;
  163. }
  164. // Calculates the maximum allowable speed at this point when you must be able to reach target_velocity using the
  165. // acceleration within the allotted distance.
  166. inline float max_allowable_speed(float acceleration, float target_velocity, float distance) {
  167. return sqrt(target_velocity*target_velocity-2*acceleration*distance);
  168. }
  169. // "Junction jerk" in this context is the immediate change in speed at the junction of two blocks.
  170. // This method will calculate the junction jerk as the euclidean distance between the nominal
  171. // velocities of the respective blocks.
  172. //inline float junction_jerk(block_t *before, block_t *after) {
  173. // return sqrt(
  174. // pow((before->speed_x-after->speed_x), 2)+pow((before->speed_y-after->speed_y), 2));
  175. //}
  176. // The kernel called by planner_recalculate() when scanning the plan from last to first entry.
  177. void planner_reverse_pass_kernel(block_t *previous, block_t *current, block_t *next) {
  178. if(!current) { return; }
  179. if (next) {
  180. // If entry speed is already at the maximum entry speed, no need to recheck. Block is cruising.
  181. // If not, block in state of acceleration or deceleration. Reset entry speed to maximum and
  182. // check for maximum allowable speed reductions to ensure maximum possible planned speed.
  183. if (current->entry_speed != current->max_entry_speed) {
  184. // If nominal length true, max junction speed is guaranteed to be reached. Only compute
  185. // for max allowable speed if block is decelerating and nominal length is false.
  186. if ((!current->nominal_length_flag) && (current->max_entry_speed > next->entry_speed)) {
  187. current->entry_speed = min( current->max_entry_speed,
  188. max_allowable_speed(-current->acceleration,next->entry_speed,current->millimeters));
  189. } else {
  190. current->entry_speed = current->max_entry_speed;
  191. }
  192. current->recalculate_flag = true;
  193. }
  194. } // Skip last block. Already initialized and set for recalculation.
  195. }
  196. // planner_recalculate() needs to go over the current plan twice. Once in reverse and once forward. This
  197. // implements the reverse pass.
  198. void planner_reverse_pass() {
  199. char block_index = block_buffer_head;
  200. if(((block_buffer_head-block_buffer_tail + BLOCK_BUFFER_SIZE) & (BLOCK_BUFFER_SIZE - 1)) > 3) {
  201. block_index = (block_buffer_head - 3) & (BLOCK_BUFFER_SIZE - 1);
  202. block_t *block[3] = { NULL, NULL, NULL };
  203. while(block_index != block_buffer_tail) {
  204. block_index = prev_block_index(block_index);
  205. block[2]= block[1];
  206. block[1]= block[0];
  207. block[0] = &block_buffer[block_index];
  208. planner_reverse_pass_kernel(block[0], block[1], block[2]);
  209. }
  210. }
  211. }
  212. // The kernel called by planner_recalculate() when scanning the plan from first to last entry.
  213. void planner_forward_pass_kernel(block_t *previous, block_t *current, block_t *next) {
  214. if(!previous) { return; }
  215. // If the previous block is an acceleration block, but it is not long enough to complete the
  216. // full speed change within the block, we need to adjust the entry speed accordingly. Entry
  217. // speeds have already been reset, maximized, and reverse planned by reverse planner.
  218. // If nominal length is true, max junction speed is guaranteed to be reached. No need to recheck.
  219. if (!previous->nominal_length_flag) {
  220. if (previous->entry_speed < current->entry_speed) {
  221. double entry_speed = min( current->entry_speed,
  222. max_allowable_speed(-previous->acceleration,previous->entry_speed,previous->millimeters) );
  223. // Check for junction speed change
  224. if (current->entry_speed != entry_speed) {
  225. current->entry_speed = entry_speed;
  226. current->recalculate_flag = true;
  227. }
  228. }
  229. }
  230. }
  231. // planner_recalculate() needs to go over the current plan twice. Once in reverse and once forward. This
  232. // implements the forward pass.
  233. void planner_forward_pass() {
  234. char block_index = block_buffer_tail;
  235. block_t *block[3] = { NULL, NULL, NULL };
  236. while(block_index != block_buffer_head) {
  237. block[0] = block[1];
  238. block[1] = block[2];
  239. block[2] = &block_buffer[block_index];
  240. planner_forward_pass_kernel(block[0],block[1],block[2]);
  241. block_index = next_block_index(block_index);
  242. }
  243. planner_forward_pass_kernel(block[1], block[2], NULL);
  244. }
  245. // Recalculates the trapezoid speed profiles for all blocks in the plan according to the
  246. // entry_factor for each junction. Must be called by planner_recalculate() after
  247. // updating the blocks.
  248. void planner_recalculate_trapezoids() {
  249. int8_t block_index = block_buffer_tail;
  250. block_t *current;
  251. block_t *next = NULL;
  252. while(block_index != block_buffer_head) {
  253. current = next;
  254. next = &block_buffer[block_index];
  255. if (current) {
  256. // Recalculate if current block entry or exit junction speed has changed.
  257. if (current->recalculate_flag || next->recalculate_flag) {
  258. // NOTE: Entry and exit factors always > 0 by all previous logic operations.
  259. calculate_trapezoid_for_block(current, current->entry_speed/current->nominal_speed,
  260. next->entry_speed/current->nominal_speed);
  261. current->recalculate_flag = false; // Reset current only to ensure next trapezoid is computed
  262. }
  263. }
  264. block_index = next_block_index( block_index );
  265. }
  266. // Last/newest block in buffer. Exit speed is set with MINIMUM_PLANNER_SPEED. Always recalculated.
  267. if(next != NULL) {
  268. calculate_trapezoid_for_block(next, next->entry_speed/next->nominal_speed,
  269. MINIMUM_PLANNER_SPEED/next->nominal_speed);
  270. next->recalculate_flag = false;
  271. }
  272. }
  273. // Recalculates the motion plan according to the following algorithm:
  274. //
  275. // 1. Go over every block in reverse order and calculate a junction speed reduction (i.e. block_t.entry_factor)
  276. // so that:
  277. // a. The junction jerk is within the set limit
  278. // b. No speed reduction within one block requires faster deceleration than the one, true constant
  279. // acceleration.
  280. // 2. Go over every block in chronological order and dial down junction speed reduction values if
  281. // a. The speed increase within one block would require faster accelleration than the one, true
  282. // constant acceleration.
  283. //
  284. // When these stages are complete all blocks have an entry_factor that will allow all speed changes to
  285. // be performed using only the one, true constant acceleration, and where no junction jerk is jerkier than
  286. // the set limit. Finally it will:
  287. //
  288. // 3. Recalculate trapezoids for all blocks.
  289. void planner_recalculate() {
  290. planner_reverse_pass();
  291. planner_forward_pass();
  292. planner_recalculate_trapezoids();
  293. }
  294. void plan_init() {
  295. block_buffer_head = 0;
  296. block_buffer_tail = 0;
  297. memset(position, 0, sizeof(position)); // clear position
  298. previous_speed[0] = 0.0;
  299. previous_speed[1] = 0.0;
  300. previous_speed[2] = 0.0;
  301. previous_speed[3] = 0.0;
  302. previous_nominal_speed = 0.0;
  303. }
  304. void plan_discard_current_block() {
  305. if (block_buffer_head != block_buffer_tail) {
  306. block_buffer_tail = (block_buffer_tail + 1) & (BLOCK_BUFFER_SIZE - 1);
  307. }
  308. }
  309. block_t *plan_get_current_block() {
  310. if (block_buffer_head == block_buffer_tail) {
  311. return(NULL);
  312. }
  313. block_t *block = &block_buffer[block_buffer_tail];
  314. block->busy = true;
  315. return(block);
  316. }
  317. #ifdef AUTOTEMP
  318. void getHighESpeed()
  319. {
  320. if(!autotemp_enabled)
  321. return;
  322. if(degTargetHotend0()+2<autotemp_min) //probably temperature set to zero.
  323. return; //do nothing
  324. float high=0;
  325. char block_index = block_buffer_tail;
  326. while(block_index != block_buffer_head) {
  327. float se=block_buffer[block_index].steps_e/float(block_buffer[block_index].step_event_count)*block_buffer[block_index].nominal_rate;
  328. //se; units steps/sec;
  329. if(se>high)
  330. {
  331. high=se;
  332. }
  333. block_index = (block_index+1) & (BLOCK_BUFFER_SIZE - 1);
  334. }
  335. float g=autotemp_min+high*autotemp_factor;
  336. float t=constrain(autotemp_min,g,autotemp_max);
  337. setTargetHotend0(t);
  338. SERIAL_ECHO_START;
  339. SERIAL_ECHOPAIR("highe",high);
  340. SERIAL_ECHOPAIR(" t",t);
  341. SERIAL_ECHOLN("");
  342. }
  343. #endif
  344. void check_axes_activity() {
  345. unsigned char x_active = 0;
  346. unsigned char y_active = 0;
  347. unsigned char z_active = 0;
  348. unsigned char e_active = 0;
  349. block_t *block;
  350. if(block_buffer_tail != block_buffer_head) {
  351. char block_index = block_buffer_tail;
  352. while(block_index != block_buffer_head) {
  353. block = &block_buffer[block_index];
  354. if(block->steps_x != 0) x_active++;
  355. if(block->steps_y != 0) y_active++;
  356. if(block->steps_z != 0) z_active++;
  357. if(block->steps_e != 0) e_active++;
  358. block_index = (block_index+1) & (BLOCK_BUFFER_SIZE - 1);
  359. }
  360. }
  361. if((DISABLE_X) && (x_active == 0)) disable_x();
  362. if((DISABLE_Y) && (y_active == 0)) disable_y();
  363. if((DISABLE_Z) && (z_active == 0)) disable_z();
  364. if((DISABLE_E) && (e_active == 0)) disable_e();
  365. }
  366. float junction_deviation = 0.1;
  367. // Add a new linear movement to the buffer. steps_x, _y and _z is the absolute position in
  368. // mm. Microseconds specify how many microseconds the move should take to perform. To aid acceleration
  369. // calculation the caller must also provide the physical length of the line in millimeters.
  370. void plan_buffer_line(const float &x, const float &y, const float &z, const float &e, float feed_rate)
  371. {
  372. // Calculate the buffer head after we push this byte
  373. int next_buffer_head = next_block_index(block_buffer_head);
  374. // If the buffer is full: good! That means we are well ahead of the robot.
  375. // Rest here until there is room in the buffer.
  376. while(block_buffer_tail == next_buffer_head) {
  377. manage_heater();
  378. manage_inactivity(1);
  379. LCD_STATUS;
  380. }
  381. // The target position of the tool in absolute steps
  382. // Calculate target position in absolute steps
  383. //this should be done after the wait, because otherwise a M92 code within the gcode disrupts this calculation somehow
  384. long target[4];
  385. target[X_AXIS] = lround(x*axis_steps_per_unit[X_AXIS]);
  386. target[Y_AXIS] = lround(y*axis_steps_per_unit[Y_AXIS]);
  387. target[Z_AXIS] = lround(z*axis_steps_per_unit[Z_AXIS]);
  388. target[E_AXIS] = lround(e*axis_steps_per_unit[E_AXIS]);
  389. // Prepare to set up new block
  390. block_t *block = &block_buffer[block_buffer_head];
  391. // Mark block as not busy (Not executed by the stepper interrupt)
  392. block->busy = false;
  393. // Number of steps for each axis
  394. block->steps_x = labs(target[X_AXIS]-position[X_AXIS]);
  395. block->steps_y = labs(target[Y_AXIS]-position[Y_AXIS]);
  396. block->steps_z = labs(target[Z_AXIS]-position[Z_AXIS]);
  397. block->steps_e = labs(target[E_AXIS]-position[E_AXIS]);
  398. block->step_event_count = max(block->steps_x, max(block->steps_y, max(block->steps_z, block->steps_e)));
  399. // Bail if this is a zero-length block
  400. if (block->step_event_count <=dropsegments) { return; };
  401. // Compute direction bits for this block
  402. block->direction_bits = 0;
  403. if (target[X_AXIS] < position[X_AXIS]) { block->direction_bits |= (1<<X_AXIS); }
  404. if (target[Y_AXIS] < position[Y_AXIS]) { block->direction_bits |= (1<<Y_AXIS); }
  405. if (target[Z_AXIS] < position[Z_AXIS]) { block->direction_bits |= (1<<Z_AXIS); }
  406. if (target[E_AXIS] < position[E_AXIS]) { block->direction_bits |= (1<<E_AXIS); }
  407. //enable active axes
  408. if(block->steps_x != 0) enable_x();
  409. if(block->steps_y != 0) enable_y();
  410. if(block->steps_z != 0) enable_z();
  411. if(block->steps_e != 0) enable_e();
  412. float delta_mm[4];
  413. delta_mm[X_AXIS] = (target[X_AXIS]-position[X_AXIS])/axis_steps_per_unit[X_AXIS];
  414. delta_mm[Y_AXIS] = (target[Y_AXIS]-position[Y_AXIS])/axis_steps_per_unit[Y_AXIS];
  415. delta_mm[Z_AXIS] = (target[Z_AXIS]-position[Z_AXIS])/axis_steps_per_unit[Z_AXIS];
  416. delta_mm[E_AXIS] = (target[E_AXIS]-position[E_AXIS])/axis_steps_per_unit[E_AXIS];
  417. block->millimeters = sqrt(square(delta_mm[X_AXIS]) + square(delta_mm[Y_AXIS]) +
  418. square(delta_mm[Z_AXIS]) + square(delta_mm[E_AXIS]));
  419. float inverse_millimeters = 1.0/block->millimeters; // Inverse millimeters to remove multiple divides
  420. // Calculate speed in mm/second for each axis. No divide by zero due to previous checks.
  421. float inverse_second = feed_rate * inverse_millimeters;
  422. block->nominal_speed = block->millimeters * inverse_second; // (mm/sec) Always > 0
  423. block->nominal_rate = ceil(block->step_event_count * inverse_second); // (step/sec) Always > 0
  424. // segment time im micro seconds
  425. long segment_time = lround(1000000.0/inverse_second);
  426. if (block->steps_e == 0) {
  427. if(feed_rate<mintravelfeedrate) feed_rate=mintravelfeedrate;
  428. }
  429. else {
  430. if(feed_rate<minimumfeedrate) feed_rate=minimumfeedrate;
  431. }
  432. #ifdef SLOWDOWN
  433. // slow down when de buffer starts to empty, rather than wait at the corner for a buffer refill
  434. int moves_queued=(block_buffer_head-block_buffer_tail + BLOCK_BUFFER_SIZE) & (BLOCK_BUFFER_SIZE - 1);
  435. if(moves_queued < (BLOCK_BUFFER_SIZE * 0.5)) feed_rate = feed_rate / ((BLOCK_BUFFER_SIZE * 0.5)/moves_queued);
  436. #endif
  437. /*
  438. if ((blockcount>0) && (blockcount < (BLOCK_BUFFER_SIZE - 4))) {
  439. if (segment_time<minsegmenttime) { // buffer is draining, add extra time. The amount of time added increases if the buffer is still emptied more.
  440. segment_time=segment_time+lround(2*(minsegmenttime-segment_time)/blockcount);
  441. }
  442. }
  443. else {
  444. if (segment_time<minsegmenttime) segment_time=minsegmenttime;
  445. }
  446. // END OF SLOW DOWN SECTION
  447. */
  448. // Calculate speed in mm/sec for each axis
  449. float current_speed[4];
  450. for(int i=0; i < 4; i++) {
  451. current_speed[i] = delta_mm[i] * inverse_second;
  452. }
  453. // Limit speed per axis
  454. float speed_factor = 1.0; //factor <=1 do decrease speed
  455. for(int i=0; i < 4; i++) {
  456. if(abs(current_speed[i]) > max_feedrate[i])
  457. speed_factor = min(speed_factor, max_feedrate[i] / abs(current_speed[i]));
  458. }
  459. // Max segement time in us.
  460. #ifdef XY_FREQUENCY_LIMIT
  461. #define MAX_FREQ_TIME (1000000.0/XY_FREQUENCY_LIMIT)
  462. // Check and limit the xy direction change frequency
  463. unsigned char direction_change = block->direction_bits ^ old_direction_bits;
  464. old_direction_bits = block->direction_bits;
  465. if((direction_change & (1<<X_AXIS)) == 0) {
  466. x_segment_time[0] += segment_time;
  467. }
  468. else {
  469. x_segment_time[2] = x_segment_time[1];
  470. x_segment_time[1] = x_segment_time[0];
  471. x_segment_time[0] = segment_time;
  472. }
  473. if((direction_change & (1<<Y_AXIS)) == 0) {
  474. y_segment_time[0] += segment_time;
  475. }
  476. else {
  477. y_segment_time[2] = y_segment_time[1];
  478. y_segment_time[1] = y_segment_time[0];
  479. y_segment_time[0] = segment_time;
  480. }
  481. long max_x_segment_time = max(x_segment_time[0], max(x_segment_time[1], x_segment_time[2]));
  482. long max_y_segment_time = max(y_segment_time[0], max(y_segment_time[1], y_segment_time[2]));
  483. long min_xy_segment_time =min(max_x_segment_time, max_y_segment_time);
  484. if(min_xy_segment_time < MAX_FREQ_TIME) speed_factor = min(speed_factor, speed_factor * (float)min_xy_segment_time / (float)MAX_FREQ_TIME);
  485. #endif
  486. // Correct the speed
  487. if( speed_factor < 1.0) {
  488. // Serial.print("speed factor : "); Serial.println(speed_factor);
  489. for(int i=0; i < 4; i++) {
  490. if(abs(current_speed[i]) > max_feedrate[i])
  491. speed_factor = min(speed_factor, max_feedrate[i] / abs(current_speed[i]));
  492. /*
  493. if(speed_factor < 0.1) {
  494. Serial.print("speed factor : "); Serial.println(speed_factor);
  495. Serial.print("current_speed"); Serial.print(i); Serial.print(" : "); Serial.println(current_speed[i]);
  496. }
  497. */
  498. }
  499. for(unsigned char i=0; i < 4; i++) {
  500. current_speed[i] *= speed_factor;
  501. }
  502. block->nominal_speed *= speed_factor;
  503. block->nominal_rate *= speed_factor;
  504. }
  505. // Compute and limit the acceleration rate for the trapezoid generator.
  506. float steps_per_mm = block->step_event_count/block->millimeters;
  507. if(block->steps_x == 0 && block->steps_y == 0 && block->steps_z == 0) {
  508. block->acceleration_st = ceil(retract_acceleration * steps_per_mm); // convert to: acceleration steps/sec^2
  509. }
  510. else {
  511. block->acceleration_st = ceil(acceleration * steps_per_mm); // convert to: acceleration steps/sec^2
  512. // Limit acceleration per axis
  513. if(((float)block->acceleration_st * (float)block->steps_x / (float)block->step_event_count) > axis_steps_per_sqr_second[X_AXIS])
  514. block->acceleration_st = axis_steps_per_sqr_second[X_AXIS];
  515. if(((float)block->acceleration_st * (float)block->steps_y / (float)block->step_event_count) > axis_steps_per_sqr_second[Y_AXIS])
  516. block->acceleration_st = axis_steps_per_sqr_second[Y_AXIS];
  517. if(((float)block->acceleration_st * (float)block->steps_e / (float)block->step_event_count) > axis_steps_per_sqr_second[E_AXIS])
  518. block->acceleration_st = axis_steps_per_sqr_second[E_AXIS];
  519. if(((float)block->acceleration_st * (float)block->steps_z / (float)block->step_event_count ) > axis_steps_per_sqr_second[Z_AXIS])
  520. block->acceleration_st = axis_steps_per_sqr_second[Z_AXIS];
  521. }
  522. block->acceleration = block->acceleration_st / steps_per_mm;
  523. block->acceleration_rate = (long)((float)block->acceleration_st * 8.388608);
  524. #if 0 // Use old jerk for now
  525. // Compute path unit vector
  526. double unit_vec[3];
  527. unit_vec[X_AXIS] = delta_mm[X_AXIS]*inverse_millimeters;
  528. unit_vec[Y_AXIS] = delta_mm[Y_AXIS]*inverse_millimeters;
  529. unit_vec[Z_AXIS] = delta_mm[Z_AXIS]*inverse_millimeters;
  530. // Compute maximum allowable entry speed at junction by centripetal acceleration approximation.
  531. // Let a circle be tangent to both previous and current path line segments, where the junction
  532. // deviation is defined as the distance from the junction to the closest edge of the circle,
  533. // colinear with the circle center. The circular segment joining the two paths represents the
  534. // path of centripetal acceleration. Solve for max velocity based on max acceleration about the
  535. // radius of the circle, defined indirectly by junction deviation. This may be also viewed as
  536. // path width or max_jerk in the previous grbl version. This approach does not actually deviate
  537. // from path, but used as a robust way to compute cornering speeds, as it takes into account the
  538. // nonlinearities of both the junction angle and junction velocity.
  539. double vmax_junction = MINIMUM_PLANNER_SPEED; // Set default max junction speed
  540. // Skip first block or when previous_nominal_speed is used as a flag for homing and offset cycles.
  541. if ((block_buffer_head != block_buffer_tail) && (previous_nominal_speed > 0.0)) {
  542. // Compute cosine of angle between previous and current path. (prev_unit_vec is negative)
  543. // NOTE: Max junction velocity is computed without sin() or acos() by trig half angle identity.
  544. double cos_theta = - previous_unit_vec[X_AXIS] * unit_vec[X_AXIS]
  545. - previous_unit_vec[Y_AXIS] * unit_vec[Y_AXIS]
  546. - previous_unit_vec[Z_AXIS] * unit_vec[Z_AXIS] ;
  547. // Skip and use default max junction speed for 0 degree acute junction.
  548. if (cos_theta < 0.95) {
  549. vmax_junction = min(previous_nominal_speed,block->nominal_speed);
  550. // Skip and avoid divide by zero for straight junctions at 180 degrees. Limit to min() of nominal speeds.
  551. if (cos_theta > -0.95) {
  552. // Compute maximum junction velocity based on maximum acceleration and junction deviation
  553. double sin_theta_d2 = sqrt(0.5*(1.0-cos_theta)); // Trig half angle identity. Always positive.
  554. vmax_junction = min(vmax_junction,
  555. sqrt(block->acceleration * junction_deviation * sin_theta_d2/(1.0-sin_theta_d2)) );
  556. }
  557. }
  558. }
  559. #endif
  560. // Start with a safe speed
  561. float vmax_junction = max_xy_jerk/2;
  562. if(abs(current_speed[Z_AXIS]) > max_z_jerk/2)
  563. vmax_junction = max_z_jerk/2;
  564. vmax_junction = min(vmax_junction, block->nominal_speed);
  565. if ((block_buffer_head != block_buffer_tail) && (previous_nominal_speed > 0.0)) {
  566. float jerk = sqrt(pow((current_speed[X_AXIS]-previous_speed[X_AXIS]), 2)+pow((current_speed[Y_AXIS]-previous_speed[Y_AXIS]), 2));
  567. if((previous_speed[X_AXIS] != 0.0) || (previous_speed[Y_AXIS] != 0.0)) {
  568. vmax_junction = block->nominal_speed;
  569. }
  570. if (jerk > max_xy_jerk) {
  571. vmax_junction *= (max_xy_jerk/jerk);
  572. }
  573. if(abs(current_speed[Z_AXIS] - previous_speed[Z_AXIS]) > max_z_jerk) {
  574. vmax_junction *= (max_z_jerk/abs(current_speed[Z_AXIS] - previous_speed[Z_AXIS]));
  575. }
  576. }
  577. block->max_entry_speed = vmax_junction;
  578. // Initialize block entry speed. Compute based on deceleration to user-defined MINIMUM_PLANNER_SPEED.
  579. double v_allowable = max_allowable_speed(-block->acceleration,MINIMUM_PLANNER_SPEED,block->millimeters);
  580. block->entry_speed = min(vmax_junction, v_allowable);
  581. // Initialize planner efficiency flags
  582. // Set flag if block will always reach maximum junction speed regardless of entry/exit speeds.
  583. // If a block can de/ac-celerate from nominal speed to zero within the length of the block, then
  584. // the current block and next block junction speeds are guaranteed to always be at their maximum
  585. // junction speeds in deceleration and acceleration, respectively. This is due to how the current
  586. // block nominal speed limits both the current and next maximum junction speeds. Hence, in both
  587. // the reverse and forward planners, the corresponding block junction speed will always be at the
  588. // the maximum junction speed and may always be ignored for any speed reduction checks.
  589. if (block->nominal_speed <= v_allowable) { block->nominal_length_flag = true; }
  590. else { block->nominal_length_flag = false; }
  591. block->recalculate_flag = true; // Always calculate trapezoid for new block
  592. // Update previous path unit_vector and nominal speed
  593. memcpy(previous_speed, current_speed, sizeof(previous_speed)); // previous_speed[] = current_speed[]
  594. previous_nominal_speed = block->nominal_speed;
  595. #ifdef ADVANCE
  596. // Calculate advance rate
  597. if((block->steps_e == 0) || (block->steps_x == 0 && block->steps_y == 0 && block->steps_z == 0)) {
  598. block->advance_rate = 0;
  599. block->advance = 0;
  600. }
  601. else {
  602. long acc_dist = estimate_acceleration_distance(0, block->nominal_rate, block->acceleration_st);
  603. float advance = (STEPS_PER_CUBIC_MM_E * EXTRUDER_ADVANCE_K) *
  604. (block->speed_e * block->speed_e * EXTRUTION_AREA * EXTRUTION_AREA / 3600.0)*65536;
  605. block->advance = advance;
  606. if(acc_dist == 0) {
  607. block->advance_rate = 0;
  608. }
  609. else {
  610. block->advance_rate = advance / (float)acc_dist;
  611. }
  612. }
  613. #endif // ADVANCE
  614. calculate_trapezoid_for_block(block, block->entry_speed/block->nominal_speed,
  615. MINIMUM_PLANNER_SPEED/block->nominal_speed);
  616. // Move buffer head
  617. block_buffer_head = next_buffer_head;
  618. // Update position
  619. memcpy(position, target, sizeof(target)); // position[] = target[]
  620. planner_recalculate();
  621. #ifdef AUTOTEMP
  622. getHighESpeed();
  623. #endif
  624. st_wake_up();
  625. }
  626. void plan_set_position(const float &x, const float &y, const float &z, const float &e)
  627. {
  628. position[X_AXIS] = lround(x*axis_steps_per_unit[X_AXIS]);
  629. position[Y_AXIS] = lround(y*axis_steps_per_unit[Y_AXIS]);
  630. position[Z_AXIS] = lround(z*axis_steps_per_unit[Z_AXIS]);
  631. position[E_AXIS] = lround(e*axis_steps_per_unit[E_AXIS]);
  632. previous_nominal_speed = 0.0; // Resets planner junction speeds. Assumes start from rest.
  633. previous_speed[0] = 0.0;
  634. previous_speed[1] = 0.0;
  635. previous_speed[2] = 0.0;
  636. previous_speed[3] = 0.0;
  637. }