Stanford CS 326A - Criticality based Planning

Unformatted text preview:

CS 326 A: Motion PlanningTrapezoidal decompositionVoronoi DiagramCriticality-Based PlanningTopics of the ClassCS 326 A: Motion CS 326 A: Motion PlanningPlanninghttp://robotics.stanford.edu/~latombe/cs326/2004Criticality-Based Criticality-Based PlanningPlanningTrapezoidal decompositionTrapezoidal decompositionVoronoi DiagramVoronoi DiagramCriticality-Based PlanningCriticality-Based PlanningDefine a property PDecompose the configuration space into “regular” regions (cells) over which P is constant.Use this decomposition for planningIssues: - What is P? It depends on the problem- How to use the decomposition?Approach is practical only in low-dimensional spaces:- Complexity of the arrangement of cells- Sensitivity to floating point errorsTopics of the ClassTopics of the ClassPaper 1: Assembly PlanningP = blocking relation Non-directional blocking graphPaper 2: Target findingP = visibility property Information-state


View Full Document

Stanford CS 326A - Criticality based Planning

Download Criticality based Planning
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Criticality based Planning and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Criticality based Planning 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?