Hi,
I'm trying to produce a graph that describes a vehicle braking.
Velocity will be on the y axis, and distance on the x axis.
Essentially it builds back from some point (for instance a sharp corner at distance 500 meters) using a constant braking acceleration value (based on gradient and corner radius) and where the braking curve intercepts with the vehicles "normal" velocity is the point where they have to start braking, and then they follow the braking curve down to the max velocity they're allowed during the corner.
I can do this discretely, for instance for t = 1:20 and get the velocities, and then get the distance travelled.
But I want one equation that describes the braking curve, because I want to build a maximum velocity "ceiling" for an entire route (many corners, stop signs, etc) based on the lowest value of overlapping braking curves. So I want to just create a distance matrix for the entire route, with say 1m intervals, and each 1m find the lowest point of any braking curves to define the velocity ceiling.
The only other thing I can think of is using interpolation, but it seems like there should be an equation for the curve by integrating the velocity vs time graph? I'm not sure how to go about it.
Any suggestions would be greatly appreciated!
I'm trying to produce a graph that describes a vehicle braking.
Velocity will be on the y axis, and distance on the x axis.
Essentially it builds back from some point (for instance a sharp corner at distance 500 meters) using a constant braking acceleration value (based on gradient and corner radius) and where the braking curve intercepts with the vehicles "normal" velocity is the point where they have to start braking, and then they follow the braking curve down to the max velocity they're allowed during the corner.
I can do this discretely, for instance for t = 1:20 and get the velocities, and then get the distance travelled.
But I want one equation that describes the braking curve, because I want to build a maximum velocity "ceiling" for an entire route (many corners, stop signs, etc) based on the lowest value of overlapping braking curves. So I want to just create a distance matrix for the entire route, with say 1m intervals, and each 1m find the lowest point of any braking curves to define the velocity ceiling.
The only other thing I can think of is using interpolation, but it seems like there should be an equation for the curve by integrating the velocity vs time graph? I'm not sure how to go about it.
Any suggestions would be greatly appreciated!
Last edited: