\documentclass{beamer}
\usepackage[UTF8,noindent]{ctexcap}
\begin{document}
\title{On Sweep Coverage with Minimum Mobile Sensors}
%\subtitle{数学史讲座之一}
\institute{MIT}
\author{张三}
\date{\today}
%\subject{勾股定理}
%\keywords{勾股定理，历史}
\begin{frame}[plain]
\titlepage
\end{frame}
\begin{frame}[plain]
%\frametitle{THE MAIN CONTENTS}
\tableofcontents
\begin{center}
THE MAIN CONTENTS\\
1:Introduction \\
2:Algorithm \\
3:Evaluation \\
4:Conclusion \\
\end{center}
\end{frame}
%\section{李白的诗}
%\subsection{早发白帝城}
\begin{frame}
\frametitle{Introduction}
\begin{flushleft}%左对齐
When the mobile sensor is restricted to follow the same trajectory in
different sweep periods, we design a centralized algorithm, MinExpand. \\
\end{flushleft}
\begin{flushleft}
When the mobile sensors are not restricted to follow the same trajectory in
different sweep periods, we design OSweep algorithm. \\
\end{flushleft}
\begin{flushleft}
We conduct comprehensive simulations to study the performance of the
proposed algorithms. \\
\end{flushleft}
\end{frame}
\begin{frame}
\frametitle{Algorithms}
\begin{flushleft}
Theorem of Ring Path Scan
\end{flushleft}
\end{frame}
\end{document}