logging in or signing up Slides6 Tatlises Download Post to : URL : Related Presentations : Share Add to Flag Embed Email Send to Blogs and Networks Add to Channel Uploaded from authorPOINTLite Insert YouTube videos in PowerPont slides with aS Desktop Copy embed code: (To copy code, click on the text box) Embed: URL: Thumbnail: WordPress Embed Customize Embed The presentation is successfully added In Your Favorites. Views: 301 Category: Education License: All Rights Reserved Like it (1) Dislike it (0) Added: January 07, 2008 This Presentation is Public Favorites: 0 Presentation Description No description available. Comments Posting comment... Premium member Presentation Transcript Planning and NavigationWhere am I going? How do I get there?: Planning and Navigation Where am I going? How do I get there? 6Configuration Space: Configuration Space 6.2.1Path Planning Overview: Path Planning Overview 1. Road Map, Graph construction Identify a set of routes within the free space Where to put the nodes? Topology-based: at distinctive locations Metric-based: where features disappear or get visible 2. Cell decomposition Discriminate between free and occupied cells Where to put the cell boundaries? Topology- and metric-based: where features disappear or get visible 3. Potential Field Imposing a mathematical function over the space 6.2.1Visibility Graph: Visibility Graph 6.2.1Voronoi Diagram: Voronoi Diagram 6.2.1Voronoi, Sysquake Demo: Voronoi, Sysquake Demo 6.2.1Exact Cell Decomposition: Exact Cell Decomposition 6.2.1Approximate Cell Decomposition: Approximate Cell Decomposition 6.2.1Adaptive Cell Decomposition: Adaptive Cell Decomposition 6.2.1Path / Graph Search Strategies: Path / Graph Search Strategies 6.2.1Potential Field: Potential Field 6.2.1Attractive Potential Field: Attractive Potential Field Parabolic function representing the Euclidean distance to the goal Attracting force converges linearly towards 0 6.2.1Repulsing Potential Field: Repulsing Potential Field Barrier around the whole obstacle strong close to the obstacle no influence far from the obstacle : minimum distance to the object Field tends to infinity as q gets closer to the object 6.2.1Sysquake Demo: Sysquake Demo 6.2.1Extended Potential Field Method: Extended Potential Field Method 6.2.1 Khatib and ChatilaHarmonic Potentials: Harmonic Potentials 6.2.1Obstacle Avoidance: Obstacle Avoidance known obstacles (map) Planed path observed obstacle v(t), w(t) 6.2.2Bug Algorithm (Bug1): Bug Algorithm (Bug1) 6.2.2Bug Algorithm (Bug2): Bug Algorithm (Bug2) 6.2.2Vector Field Histogram (VFH): Vector Field Histogram (VFH) 6.2.2 Borenstein et al.Vector Field Histogram + (VFH+): Vector Field Histogram + (VFH+) 6.2.2 Borenstein et al.Video VFH: Video VFH Borenstein et al. 6.2.2Bubble Band Concept: Bubble Band Concept 6.2.2 Khatib and ChatilaBasic Curvature Velocity Methods (CVM): Basic Curvature Velocity Methods (CVM) Simmons et al. 6.2.2Dynamic Window Approach: Dynamic Window Approach 6.2.2 Fox and Burgard, Brock and KhatibGlobal Dynamic Window Approach: Global Dynamic Window Approach 6.2.2Schlegel Approach: Schlegel Approach 6.2.2EPFL-ASL approach: EPFL-ASL approach 6.2.2EPFL-ASL approach: EPFL-ASL approach 6.2.2Comparison of Obstacle Avoidance Algorithms: Acrobat Document Comparison of Obstacle Avoidance Algorithms 6.2.2Comparison of Obstacle Avoidance Algorithms: 6.2.2 Comparison of Obstacle Avoidance AlgorithmsComparison of Obstacle Avoidance Algorithms: 6.2.2 Comparison of Obstacle Avoidance Algorithms You do not have the permission to view this presentation. In order to view it, please contact the author of the presentation.
Slides6 Tatlises Download Post to : URL : Related Presentations : Share Add to Flag Embed Email Send to Blogs and Networks Add to Channel Uploaded from authorPOINTLite Insert YouTube videos in PowerPont slides with aS Desktop Copy embed code: (To copy code, click on the text box) Embed: URL: Thumbnail: WordPress Embed Customize Embed The presentation is successfully added In Your Favorites. Views: 301 Category: Education License: All Rights Reserved Like it (1) Dislike it (0) Added: January 07, 2008 This Presentation is Public Favorites: 0 Presentation Description No description available. Comments Posting comment... Premium member Presentation Transcript Planning and NavigationWhere am I going? How do I get there?: Planning and Navigation Where am I going? How do I get there? 6Configuration Space: Configuration Space 6.2.1Path Planning Overview: Path Planning Overview 1. Road Map, Graph construction Identify a set of routes within the free space Where to put the nodes? Topology-based: at distinctive locations Metric-based: where features disappear or get visible 2. Cell decomposition Discriminate between free and occupied cells Where to put the cell boundaries? Topology- and metric-based: where features disappear or get visible 3. Potential Field Imposing a mathematical function over the space 6.2.1Visibility Graph: Visibility Graph 6.2.1Voronoi Diagram: Voronoi Diagram 6.2.1Voronoi, Sysquake Demo: Voronoi, Sysquake Demo 6.2.1Exact Cell Decomposition: Exact Cell Decomposition 6.2.1Approximate Cell Decomposition: Approximate Cell Decomposition 6.2.1Adaptive Cell Decomposition: Adaptive Cell Decomposition 6.2.1Path / Graph Search Strategies: Path / Graph Search Strategies 6.2.1Potential Field: Potential Field 6.2.1Attractive Potential Field: Attractive Potential Field Parabolic function representing the Euclidean distance to the goal Attracting force converges linearly towards 0 6.2.1Repulsing Potential Field: Repulsing Potential Field Barrier around the whole obstacle strong close to the obstacle no influence far from the obstacle : minimum distance to the object Field tends to infinity as q gets closer to the object 6.2.1Sysquake Demo: Sysquake Demo 6.2.1Extended Potential Field Method: Extended Potential Field Method 6.2.1 Khatib and ChatilaHarmonic Potentials: Harmonic Potentials 6.2.1Obstacle Avoidance: Obstacle Avoidance known obstacles (map) Planed path observed obstacle v(t), w(t) 6.2.2Bug Algorithm (Bug1): Bug Algorithm (Bug1) 6.2.2Bug Algorithm (Bug2): Bug Algorithm (Bug2) 6.2.2Vector Field Histogram (VFH): Vector Field Histogram (VFH) 6.2.2 Borenstein et al.Vector Field Histogram + (VFH+): Vector Field Histogram + (VFH+) 6.2.2 Borenstein et al.Video VFH: Video VFH Borenstein et al. 6.2.2Bubble Band Concept: Bubble Band Concept 6.2.2 Khatib and ChatilaBasic Curvature Velocity Methods (CVM): Basic Curvature Velocity Methods (CVM) Simmons et al. 6.2.2Dynamic Window Approach: Dynamic Window Approach 6.2.2 Fox and Burgard, Brock and KhatibGlobal Dynamic Window Approach: Global Dynamic Window Approach 6.2.2Schlegel Approach: Schlegel Approach 6.2.2EPFL-ASL approach: EPFL-ASL approach 6.2.2EPFL-ASL approach: EPFL-ASL approach 6.2.2Comparison of Obstacle Avoidance Algorithms: Acrobat Document Comparison of Obstacle Avoidance Algorithms 6.2.2Comparison of Obstacle Avoidance Algorithms: 6.2.2 Comparison of Obstacle Avoidance AlgorithmsComparison of Obstacle Avoidance Algorithms: 6.2.2 Comparison of Obstacle Avoidance Algorithms