mythesis.out

\BOOKMARK [0][-]{chapter*.1}{ACKNOWLEDGEMENTS}{}% 1
\BOOKMARK [0][-]{chapter*.2}{ABSTRACT}{}% 2
\BOOKMARK [0][-]{chapter*.4}{LIST OF FIGURES}{}% 3
\BOOKMARK [0][-]{chapter.1}{Introduction}{}% 4
\BOOKMARK [0][-]{chapter.2}{Path Planning}{}% 5
\BOOKMARK [1][-]{section.2.1}{Configuration space}{chapter.2}% 6
\BOOKMARK [1][-]{section.2.2}{The Problem}{chapter.2}% 7
\BOOKMARK [1][-]{section.2.3}{Related Work}{chapter.2}% 8
\BOOKMARK [2][-]{subsection.2.3.1}{Search based algorithms}{section.2.3}% 9
\BOOKMARK [2][-]{subsection.2.3.2}{Artificial Potential Fields}{section.2.3}% 10
\BOOKMARK [2][-]{subsection.2.3.3}{Sampling based planners}{section.2.3}% 11
\BOOKMARK [0][-]{chapter.3}{Rapidly Exploring Random Trees}{}% 12
\BOOKMARK [1][-]{section.3.1}{Algorithm}{chapter.3}% 13
\BOOKMARK [1][-]{section.3.2}{Improvements}{chapter.3}% 14
\BOOKMARK [2][-]{subsection.3.2.1}{Optimality}{section.3.2}% 15
\BOOKMARK [2][-]{subsection.3.2.2}{Issues}{section.3.2}% 16
\BOOKMARK [0][-]{chapter.4}{Planning in Dynamic Environment}{}% 17
\BOOKMARK [1][-]{section.4.1}{Predicting obstacles}{chapter.4}% 18
\BOOKMARK [1][-]{section.4.2}{Replanning}{chapter.4}% 19
\BOOKMARK [0][-]{chapter.5}{RRTPI}{}% 20
\BOOKMARK [1][-]{subsection.5.0.1}{Reinforcement Learning}{chapter.5}% 21
\BOOKMARK [2][-]{subsection.5.0.2}{RRTPI Algorithm}{subsection.5.0.1}% 22
\BOOKMARK [1][-]{section.5.1}{DYNA-RRTPI}{chapter.5}% 23
\BOOKMARK [2][-]{subsection.5.1.1}{Algorithm}{section.5.1}% 24
\BOOKMARK [1][-]{section.5.2}{Experiments}{chapter.5}% 25
\BOOKMARK [0][-]{chapter.6}{Conclusion and Future Work}{}% 26