Ngoc Tam Lam, PhD

Autonomy Engineer

Back

Path planning

Posted on Mar 01, 2019


Path planning from Udacity is in the series of online courses related to self-driving car.

Course 6: Path Planning from Udacity

Path planning routes a vehicle from one point to another, and it handles how to react when emergencies arise. The Mercedes-Benz Vehicle Intelligence team will take you through the three stages of path planning. First, you’ll apply model-driven and data-driven approaches to predict how other vehicles on the road will behave. Then you’ll construct a finite state machine to decide which of several maneuvers your own vehicle should undertake. Finally, you’ll generate a safe and comfortable trajectory to execute that maneuver.

Lesson Title Description
1 Search In this lesson you will learn about discrete path planning and algorithms for solving the path planning problem.
2 Prediction In this lesson you’ll learn how to use data from sensor fusion to generate predictions about the likely behavior of moving objects.
3 Behavior Planning In this lesson you’ll learn how to think about high level behavior planning in a self-driving car.
4 Trajectory Generation In this lesson, you’ll use C++ and the Eigen linear algebra library to build candidate trajectories for the vehicle to follow.

Discrete Path Planning

Object Manipulation

  • Contact Kinematics
  • Kinematic Constraints
    • Reading the Thesis: 2011 PhD Thesis - Planning and Control Methods for Robotics Manipulation Task with Non-Negligible Dynamics This thesis used definition from Montana paper.

Ebooks

D:\2018 BioRobotics Lab\Academic topics\Topic on ROBOTIC Path Planning

Paper

A few of the mentioned works look at **planning paths** for the UAV for infrastructure inspection. Scherer and Yoder [6] plan paths incrementally along arbitrary structures. This however may lead to a non-optimal path of the arbitrary structure. We are able to guarantee an optimal solution for coverage of a 3D surface. Alexis et al. [8] plan by combining Traveling Sales Person (TSP) and Rapidly-exploring Random Tree (RRT*) to obtain a close-to-optimal solution. Our algorithm guarantees optimality as well as conducts path planning for UAVs that are not in contact with the structure of interest. Hollinger et al. [9] implement two planners for non-adaptive and adaptive classification. The authors use object detection to decide on view points that would best help to classify objects or defects on a structure. This planner looks at planning for a singular area to get the best view where as our planner looks at optimal planning for a large 3D structure like a bridge.

Software or Library

This software was used in the paper Tree Search Techniques for Minimizing Detectability and Maximizing Visibility

## References