问题陈述：
计算出机器人从初始到目标位置无碰撞的连续序列。
A到B
*过程 *
Topic
• Bug Algorithms
• Curve Following
• Sensors
• Configuration Space for Round Mobile Robot
• Potential Functions
• Graph Search (A* D*)
• P i x e l M a p s
• Configuration Space for non-Round Robots
• Roadmaps
• Coverage
• Sample-based Methods
• Kalman Filtering (for Localization, SLAM)
• Bayesian Techniques (for Localization, SLAM)
• Dynamics and Non-holonomic Constraints
