tex-projects/LaTeX-examples
2
0
Fork 0
mirror of https://github.com/MartinThoma/LaTeX-examples.git synced 2025-04-26 06:48:04 +02:00
Code Activity

Remove trailing spaces

Browse source 
The commands

find . -type f -name '*.md' -exec sed --in-place 's/[[:space:]]\+$//' {} \+

and

find . -type f -name '*.tex' -exec sed --in-place 's/[[:space:]]\+$//' {} \+

were used to do so.
This commit is contained in:
Martin Thoma 2015-10-14 14:25:34 +02:00
parent c578b25d2f
commit 7740f0147f
538 changed files with 3496 additions and 3496 deletions
Download patch file Download diff file Expand all files Collapse all files

6
documents/math-minimal-distance-to-cubic-function/introduction.tex
View file

@ -1,10 +1,10 @@
\chapter*{Introduction}
When you want to develop a selfdriving car, you have to plan which path
When you want to develop a selfdriving car, you have to plan which path
it should take. A reasonable choice for the representation of
paths are cubic splines. You also have to be able to calculate
how to steer to get or to remain on a path. A way to do this
is by applying the \href{https://en.wikipedia.org/wiki/PID_algorithm}{PID algorithm}.
This algorithm needs to know the signed current error. So you need to
This algorithm needs to know the signed current error. So you need to
be able to get the minimal distance of a point (the position of the car)
to a cubic spline (the prefered path)
combined with sign (which represents the steering direction).
@ -12,7 +12,7 @@ As one steering direction might be prefered, it is not only necessary to
get the minimal absolute distance, but might also help to get all points
on the spline with minimal distance.
In this paper, I want to discuss how to find all points on a cubic
In this paper, I want to discuss how to find all points on a cubic
function with minimal distance to a given point.
As other representations of paths might be easier to understand and
to implement, I will also cover the problem of finding the minimal