2026-09-18T19:48:11Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/328402022-01-13T07:54:41Zcom_1721.1_7582com_1721.1_7581col_1721.1_131024
Mehran Kardar.
Christopher, Jason W
Massachusetts Institute of Technology. Dept. of Physics.
Massachusetts Institute of Technology. Department of Physics
2006-05-15T20:33:52Z
2006-05-15T20:33:52Z
2005
2005
http://hdl.handle.net/1721.1/32840
61357053
Thesis (S.B.)--Massachusetts Institute of Technology, Dept. of Physics, 2005.
Includes bibliographical references (p. 69-70).
The goal of ski racing is to pass through a series of gates as quickly as possible. There are many paths from gate to gate, but there is only one path that is fastest. By knowing what the fastest path is, a racer could shave tenths of seconds off his or her time. That is a tremendous amount of time considering that races are won by hundredths of a second. This thesis attempts to calculate the fastest path through a ski race course using several simplifications such as neglecting friction. The method of attacking this problem is to modify the Brachistochrone problem. It is found that it is best if the skier places the apex of the turn at the gate, and that turning more after the gate is better than turning more above the gate. In the case of a rhythmical course, it is found that turning more below the gate is still true, but not as evident. Instead the optimal path appears more symmetric about the gate.
by Jason W. Christopher.
S.B.
70 p.
2656653 bytes
2659137 bytes
application/pdf
application/pdf
eng
Massachusetts Institute of Technology
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
http://dspace.mit.edu/handle/1721.1/7582
Physics.
Using calculus of variations to optimize paths of descent through ski race courses
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="8a1e3416-6524-47d8-8777-45ffcb9fcb4b">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Using calculus of variations to optimize paths of descent through ski race courses</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2005</PublicationDate>
<Authors>
<Author>
<DisplayName>Christopher, Jason W</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Physics.</Keyword>
<Abstract>The goal of ski racing is to pass through a series of gates as quickly as possible. There are many paths from gate to gate, but there is only one path that is fastest. By knowing what the fastest path is, a racer could shave tenths of seconds off his or her time. That is a tremendous amount of time considering that races are won by hundredths of a second. This thesis attempts to calculate the fastest path through a ski race course using several simplifications such as neglecting friction. The method of attacking this problem is to modify the Brachistochrone problem. It is found that it is best if the skier places the apex of the turn at the gate, and that turning more after the gate is better than turning more above the gate. In the case of a rhythmical course, it is found that turning more below the gate is still true, but not as evident. Instead the optimal path appears more symmetric about the gate.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>