2009-01-25 00:48:56 +01:00
|
|
|
/*
|
|
|
|
motion_control.c - cartesian robot controller.
|
|
|
|
Part of Grbl
|
|
|
|
|
|
|
|
Copyright (c) 2009 Simen Svale Skogsrud
|
|
|
|
|
|
|
|
Grbl 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.
|
|
|
|
|
|
|
|
Grbl 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.
|
|
|
|
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
|
|
along with Grbl. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
*/
|
|
|
|
|
2009-01-29 09:58:29 +01:00
|
|
|
/* The structure of this module was inspired by the Arduino GCode_Interpreter by Mike Ellery. The arc
|
|
|
|
interpolator written from the information provided in the Wikipedia article 'Midpoint circle algorithm'
|
|
|
|
and the lecture 'Circle Drawing Algorithms' by Leonard McMillan.
|
|
|
|
|
|
|
|
http://en.wikipedia.org/wiki/Midpoint_circle_algorithm
|
|
|
|
http://www.cs.unc.edu/~mcmillan/comp136/Lecture7/circle.html
|
|
|
|
*/
|
2009-01-25 00:48:56 +01:00
|
|
|
|
|
|
|
#include <avr/io.h>
|
|
|
|
#include "config.h"
|
|
|
|
#include "motion_control.h"
|
|
|
|
#include <util/delay.h>
|
|
|
|
#include <math.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include "nuts_bolts.h"
|
2009-01-28 23:48:21 +01:00
|
|
|
#include "stepper.h"
|
2009-02-09 15:47:51 +01:00
|
|
|
#include "geometry.h"
|
|
|
|
|
|
|
|
#include "wiring_serial.h"
|
2009-02-03 09:56:45 +01:00
|
|
|
|
2009-02-08 12:24:52 +01:00
|
|
|
#define ONE_MINUTE_OF_MICROSECONDS 60000000.0
|
2009-01-25 00:48:56 +01:00
|
|
|
|
2009-02-08 22:08:27 +01:00
|
|
|
volatile int8_t mode; // The current operation mode
|
2009-02-08 21:22:54 +01:00
|
|
|
int32_t position[3]; // The current position of the tool in absolute steps
|
|
|
|
uint8_t direction_bits; // The direction bits to be used with any upcoming step-instruction
|
2009-01-25 00:48:56 +01:00
|
|
|
|
2009-01-29 23:12:06 +01:00
|
|
|
void set_stepper_directions(int8_t *direction);
|
2009-02-08 21:22:54 +01:00
|
|
|
inline void step_steppers(uint8_t bits);
|
2009-01-25 00:48:56 +01:00
|
|
|
inline void step_axis(uint8_t axis);
|
2009-02-01 11:58:21 +01:00
|
|
|
void prepare_linear_motion(uint32_t x, uint32_t y, uint32_t z, float feed_rate, int invert_feed_rate);
|
2009-01-25 00:48:56 +01:00
|
|
|
|
|
|
|
void mc_init()
|
|
|
|
{
|
2009-02-08 22:08:27 +01:00
|
|
|
mode = MC_MODE_AT_REST;
|
2009-02-08 21:22:54 +01:00
|
|
|
clear_vector(position);
|
2009-01-25 00:48:56 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
void mc_dwell(uint32_t milliseconds)
|
|
|
|
{
|
2009-02-08 21:22:54 +01:00
|
|
|
mode = MC_MODE_DWELL;
|
|
|
|
st_synchronize();
|
|
|
|
_delay_ms(milliseconds);
|
|
|
|
mode = MC_MODE_AT_REST;
|
2009-01-25 00:48:56 +01:00
|
|
|
}
|
|
|
|
|
2009-02-11 00:37:33 +01:00
|
|
|
// Calculate the microseconds between steps that we should wait in order to travel the
|
|
|
|
// designated amount of millimeters in the amount of steps we are going to generate
|
2009-02-15 12:56:07 +01:00
|
|
|
void compute_and_set_step_pace(double feed_rate, double millimeters_of_travel, uint32_t steps, int invert) {
|
2009-02-11 00:37:33 +01:00
|
|
|
int32_t pace;
|
|
|
|
if (invert) {
|
|
|
|
pace = round(ONE_MINUTE_OF_MICROSECONDS/feed_rate/steps);
|
|
|
|
} else {
|
2010-01-06 00:23:07 +01:00
|
|
|
pace = round((ONE_MINUTE_OF_MICROSECONDS/X_STEPS_PER_MM)/feed_rate);
|
2009-02-11 00:37:33 +01:00
|
|
|
}
|
|
|
|
st_buffer_pace(pace);
|
|
|
|
}
|
|
|
|
|
2009-02-08 22:08:27 +01:00
|
|
|
// Execute linear motion in absolute millimeter coordinates. Feed rate given in millimeters/second
|
2009-02-11 00:37:33 +01:00
|
|
|
// unless invert_feed_rate is true. Then the feed_rate means that the motion should be completed in
|
|
|
|
// 1/feed_rate minutes.
|
2009-02-08 21:22:54 +01:00
|
|
|
void mc_line(double x, double y, double z, float feed_rate, int invert_feed_rate)
|
2009-02-03 09:56:45 +01:00
|
|
|
{
|
2009-02-08 21:22:54 +01:00
|
|
|
// Flags to keep track of which axes to step
|
2010-03-02 21:46:51 +01:00
|
|
|
int32_t target[3]; // The target position in absolute steps
|
2009-02-08 22:08:27 +01:00
|
|
|
|
2009-02-09 15:47:51 +01:00
|
|
|
// Setup ---------------------------------------------------------------------------------------------------
|
2010-03-02 08:19:21 +01:00
|
|
|
PORTD |= (1<<4);
|
|
|
|
PORTD |= (1<<5);
|
2010-01-07 23:14:29 +01:00
|
|
|
target[X_AXIS] = round(x*X_STEPS_PER_MM);
|
|
|
|
target[Y_AXIS] = round(y*Y_STEPS_PER_MM);
|
2010-02-27 19:55:09 +01:00
|
|
|
target[Z_AXIS] = round(z*Z_STEPS_PER_MM);
|
2010-03-02 08:19:21 +01:00
|
|
|
PORTD ^= (1<<5);
|
2009-01-25 00:48:56 +01:00
|
|
|
// Determine direction and travel magnitude for each axis
|
|
|
|
for(axis = X_AXIS; axis <= Z_AXIS; axis++) {
|
2010-02-27 19:55:09 +01:00
|
|
|
step_count[axis] = labs(target[axis] - position[axis]);
|
2009-02-08 21:22:54 +01:00
|
|
|
direction[axis] = signof(target[axis] - position[axis]);
|
2009-01-25 00:48:56 +01:00
|
|
|
}
|
2010-03-02 08:19:21 +01:00
|
|
|
PORTD ^= (1<<5);
|
2009-01-25 00:48:56 +01:00
|
|
|
// Find the magnitude of the axis with the longest travel
|
2009-02-08 21:22:54 +01:00
|
|
|
maximum_steps = max(step_count[Z_AXIS],
|
|
|
|
max(step_count[X_AXIS], step_count[Y_AXIS]));
|
2010-03-02 08:19:21 +01:00
|
|
|
PORTD ^= (1<<5);
|
2009-02-03 09:56:45 +01:00
|
|
|
// Nothing to do?
|
2010-03-02 08:19:21 +01:00
|
|
|
if (maximum_steps == 0) { PORTD &= ~(1<<4); PORTD |= (1<<5); return; }
|
|
|
|
PORTD ^= (1<<5);
|
2009-01-25 00:48:56 +01:00
|
|
|
// Set up a neat counter for each axis
|
|
|
|
for(axis = X_AXIS; axis <= Z_AXIS; axis++) {
|
2009-02-08 21:22:54 +01:00
|
|
|
counter[axis] = -maximum_steps/2;
|
2009-01-25 00:48:56 +01:00
|
|
|
}
|
2010-03-02 08:19:21 +01:00
|
|
|
PORTD ^= (1<<5);
|
2009-01-25 00:48:56 +01:00
|
|
|
// Set our direction pins
|
2009-02-08 21:22:54 +01:00
|
|
|
set_stepper_directions(direction);
|
2010-03-02 08:19:21 +01:00
|
|
|
PORTD ^= (1<<5);
|
2009-02-11 00:37:33 +01:00
|
|
|
|
|
|
|
// Ask old Phytagoras to estimate how many mm our next move is going to take us
|
|
|
|
double millimeters_of_travel =
|
2009-02-15 12:56:07 +01:00
|
|
|
sqrt(square(X_STEPS_PER_MM*step_count[X_AXIS]) +
|
|
|
|
square(Y_STEPS_PER_MM*step_count[Y_AXIS]) +
|
|
|
|
square(Z_STEPS_PER_MM*step_count[Z_AXIS]));
|
2010-03-02 08:19:21 +01:00
|
|
|
PORTD ^= (1<<5);
|
2009-02-11 00:37:33 +01:00
|
|
|
// And set the step pace
|
2009-02-15 12:56:07 +01:00
|
|
|
compute_and_set_step_pace(feed_rate, millimeters_of_travel, maximum_steps, invert_feed_rate);
|
2010-03-02 08:19:21 +01:00
|
|
|
PORTD &= ~(1<<5);
|
|
|
|
PORTD &= ~(1<<4);
|
2009-01-25 00:48:56 +01:00
|
|
|
|
2009-02-09 15:47:51 +01:00
|
|
|
// Execution -----------------------------------------------------------------------------------------------
|
2009-02-08 21:22:54 +01:00
|
|
|
|
2009-02-08 22:08:27 +01:00
|
|
|
mode = MC_MODE_LINEAR;
|
|
|
|
|
2009-02-11 00:37:33 +01:00
|
|
|
do {
|
2009-02-03 09:56:45 +01:00
|
|
|
// Trace the line
|
2009-02-08 21:22:54 +01:00
|
|
|
step_bits = 0;
|
2009-02-03 09:56:45 +01:00
|
|
|
for(axis = X_AXIS; axis <= Z_AXIS; axis++) {
|
2009-02-08 21:22:54 +01:00
|
|
|
if (target[axis] != position[axis])
|
2009-02-03 09:56:45 +01:00
|
|
|
{
|
2009-02-08 21:22:54 +01:00
|
|
|
counter[axis] += step_count[axis];
|
|
|
|
if (counter[axis] > 0)
|
2009-02-03 09:56:45 +01:00
|
|
|
{
|
2009-02-08 21:22:54 +01:00
|
|
|
step_bits |= st_bit_for_stepper(axis);
|
|
|
|
counter[axis] -= maximum_steps;
|
|
|
|
position[axis] += direction[axis];
|
2009-02-03 09:56:45 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2010-02-27 19:55:09 +01:00
|
|
|
if(step_bits) {
|
|
|
|
step_steppers(step_bits);
|
|
|
|
}
|
2009-02-11 00:37:33 +01:00
|
|
|
} while (step_bits);
|
|
|
|
mode = MC_MODE_AT_REST;
|
2009-01-25 00:48:56 +01:00
|
|
|
}
|
|
|
|
|
2009-02-08 21:22:54 +01:00
|
|
|
|
2009-02-08 22:08:27 +01:00
|
|
|
// Execute an arc. theta == start angle, angular_travel == number of radians to go along the arc,
|
2009-01-29 23:12:06 +01:00
|
|
|
// positive angular_travel means clockwise, negative means counterclockwise. Radius == the radius of the
|
2009-02-11 00:37:33 +01:00
|
|
|
// circle in millimeters. axis_1 and axis_2 selects the circle plane in tool space. Stick the remaining
|
|
|
|
// axis in axis_l which will be the axis for linear travel if you are tracing a helical motion.
|
2009-01-30 11:05:10 +01:00
|
|
|
// ISSUE: The arc interpolator assumes all axes have the same steps/mm as the X axis.
|
2009-02-11 00:37:33 +01:00
|
|
|
void mc_arc(double theta, double angular_travel, double radius, double linear_travel, int axis_1, int axis_2,
|
|
|
|
int axis_linear, double feed_rate, int invert_feed_rate)
|
2009-01-29 23:12:06 +01:00
|
|
|
{
|
2009-01-25 00:48:56 +01:00
|
|
|
}
|
|
|
|
|
2009-01-28 23:48:21 +01:00
|
|
|
void mc_go_home()
|
|
|
|
{
|
2009-02-08 21:22:54 +01:00
|
|
|
mode = MC_MODE_HOME;
|
2009-01-28 23:48:21 +01:00
|
|
|
st_go_home();
|
2009-01-29 23:12:06 +01:00
|
|
|
st_synchronize();
|
2009-02-08 21:22:54 +01:00
|
|
|
clear_vector(position); // By definition this is location [0, 0, 0]
|
|
|
|
mode = MC_MODE_AT_REST;
|
2009-01-25 00:48:56 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
int mc_status()
|
|
|
|
{
|
2009-02-08 21:22:54 +01:00
|
|
|
return(mode);
|
2009-01-25 00:48:56 +01:00
|
|
|
}
|
|
|
|
|
2009-02-08 22:08:27 +01:00
|
|
|
// Set the direction bits for the stepper motors according to the provided vector.
|
2009-01-25 00:48:56 +01:00
|
|
|
// direction is an array of three 8 bit integers representing the direction of
|
2009-02-09 15:47:51 +01:00
|
|
|
// each motor. The values should be negative (reverse), 0 or positive (forward).
|
2009-01-29 23:12:06 +01:00
|
|
|
void set_stepper_directions(int8_t *direction)
|
2009-01-25 00:48:56 +01:00
|
|
|
{
|
|
|
|
/* Sorry about this convoluted code! It uses the fact that bit 7 of each direction
|
|
|
|
int is set when the direction == -1, but is 0 when direction is forward. This
|
|
|
|
way we can generate the whole direction bit-mask without doing any comparisions
|
|
|
|
or branching. Fast and compact, yet practically unreadable. Sorry sorry sorry.
|
|
|
|
*/
|
2009-02-08 21:22:54 +01:00
|
|
|
direction_bits = (
|
2009-01-30 11:26:21 +01:00
|
|
|
((direction[X_AXIS]&0x80)>>(7-X_DIRECTION_BIT)) |
|
|
|
|
((direction[Y_AXIS]&0x80)>>(7-Y_DIRECTION_BIT)) |
|
2009-02-03 09:56:45 +01:00
|
|
|
((direction[Z_AXIS]&0x80)>>(7-Z_DIRECTION_BIT)));
|
2009-01-25 00:48:56 +01:00
|
|
|
}
|
|
|
|
|
2009-02-08 21:22:54 +01:00
|
|
|
inline void step_steppers(uint8_t bits)
|
2009-01-25 00:48:56 +01:00
|
|
|
{
|
2009-02-08 21:22:54 +01:00
|
|
|
st_buffer_step(direction_bits | bits);
|
2009-01-25 00:48:56 +01:00
|
|
|
}
|