FINDING TOPOLOGY IN A FACTORY: CONFIGURATION SPACES A.ABRAM AND R.GHRIST Also “Robot navigation functions on manifolds with boundary” – Daniel Koditschek.

Slides:



Advertisements
Similar presentations
Reactive and Potential Field Planners
Advertisements

Learning deformable models Yali Amit, University of Chicago Alain Trouvé, CMLA Cachan.
1 Motion and Manipulation Configuration Space. Outline Motion Planning Configuration Space and Free Space Free Space Structure and Complexity.
Section 18.4 Path-Dependent Vector Fields and Green’s Theorem.
Configuration Space. Recap Represent environments as graphs –Paths are connected vertices –Make assumption that robot is a point Need to be able to use.
Fall Path Planning from text. Fall Outline Point Robot Translational Robot Rotational Robot.
Motion Planning for Point Robots CS 659 Kris Hauser.
Visibility Graph Team 10 NakWon Lee, Dongwoo Kim.
Feasible trajectories for mobile robots with kinematic and environment constraints Paper by Jean-Paul Laumond I am Henrik Tidefelt.
The Vector Field Histogram Erick Tryzelaar November 14, 2001 Robotic Motion Planning A Method Developed by J. Borenstein and Y. Koren.
DESIGN OF A GENERIC PATH PATH PLANNING SYSTEM AILAB Path Planning Workgroup.
NUS CS5247 A Visibility-Based Pursuit-Evasion Problem Leonidas J.Guibas, Jean-Claude Latombe, Steven M. LaValle, David Lin, Rajeev Motwani. Computer Science.
Introduction to Robotics Tutorial 7 Technion, cs department, Introduction to Robotics Winter
1 GRASP Nora Ayanian March 20, 2006 Controller Synthesis in Complex Environments.
A New Force-Directed Graph Drawing Method Based on Edge- Edge Repulsion Chun-Cheng Lin and Hsu-Chen Yen Department of Electrical Engineering, National.
Motion Planning. Basic Topology Definitions  Open set / closed set  Boundary point / interior point / closure  Continuous function  Parametric curve.
CS 326A: Motion Planning Configuration Space. Motion Planning Framework Continuous representation (configuration space and related spaces + constraints)
1 D-Space and Deform Closure: A Framework for Holding Deformable Parts K. “Gopal” Gopalakrishnan, Ken Goldberg IEOR and EECS, U.C. Berkeley.
1 Target Finding. 2 Example robot’s visibility region hiding region 1 cleared region robot.
CS 326A: Motion Planning Criticality-Based Motion Planning: Target Finding.
Panos Trahanias: Autonomous Robot Navigation
Motor Schema Based Navigation for a Mobile Robot: An Approach to Programming by Behavior Ronald C. Arkin Reviewed By: Chris Miles.
CS 326 A: Motion Planning robotics.stanford.edu/~latombe/cs326/2003/index.htm Configuration Space – Basic Path-Planning Methods.
ME Robotics DIFFERENTIAL KINEMATICS Purpose: The purpose of this chapter is to introduce you to robot motion. Differential forms of the homogeneous.
UMass Lowell Computer Science Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2004 O’Rourke Chapter 8 Motion Planning.
Extended Potential Field Method Adam A. Gonthier MEAM 620 Final Project 3/19/2006.
CS 326A: Motion Planning Basic Motion Planning for a Point Robot.
Chapter 5: Path Planning Hadi Moradi. Motivation Need to choose a path for the end effector that avoids collisions and singularities Collisions are easy.
TORA : Temporally Ordered Routing Algorithm Invented by Vincent Park and M.Scott Corson from University of Maryland. TORA is an on-demand routing protocol.
CS 326 A: Motion Planning Probabilistic Roadmaps Basic Techniques.
Contributed Talk at the International Workshop on VISUALIZATION and MATHEMATICS 2002 Thomas Lewiner, Hélio Lopes, Geovan Tavares Math&Media Laboratory,
Introduction to Robot Motion Planning. Example A robot arm is to build an assembly from a set of parts. Tasks for the robot: Grasping: position gripper.
1 Single Robot Motion Planning Liang-Jun Zhang COMP Sep 22, 2008.
UMass Lowell Computer Science Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2007 O’Rourke Chapter 8 Motion Planning.
4/21/15CMPS 3130/6130 Computational Geometry1 CMPS 3130/6130 Computational Geometry Spring 2015 Motion Planning Carola Wenk.
© Manfred Huber Autonomous Robots Robot Path Planning.
Robot Crowd Navigation using Predictive Position Fields in the Potential Function Framework Ninad Pradhan, Timothy Burg, and Stan Birchfield Electrical.
Final Project Presentation on autonomous mobile robot
Vector Analysis Copyright © Cengage Learning. All rights reserved.
Chapter 19 Electric Charges, Forces, and Fields. Units of Chapter 19 Electric Charge Insulators and Conductors Coulomb’s Law The Electric Field Electric.
Path Planning for a Point Robot
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces (1996) L. Kavraki, P. Švestka, J.-C. Latombe, M. Overmars.
CS B659: Principles of Intelligent Robot Motion Configuration Space.
1 Navigation Functions for Patterned Formations Daniel E. Koditschek Electrical & Systems Engineering Department School of Engineering and Applied Science,
The Fundamental Theorem for Line Integrals. Questions:  How do you determine if a vector field is conservative?  What special properties do conservative.
Electronic Band Structures electrons in solids: in a periodic potential due to the periodic arrays of atoms electronic band structure: electron states.
UNC Chapel Hill M. C. Lin Introduction to Motion Planning Applications Overview of the Problem Basics – Planning for Point Robot –Visibility Graphs –Roadmap.
A positive point charge is moving directly toward point P. The magnetic field that the point charge produces at point P Q points from the charge.
Introduction to Robotics Tutorial 10 Technion, cs department, Introduction to Robotics Winter
Autonomous Robots Robot Path Planning (3) © Manfred Huber 2008.
Solid Modeling Prof. Lizhuang Ma Shanghai Jiao Tong University.
Planning and Navigation. 6 Competencies for Navigation Navigation is composed of localization, mapping and motion planning – Different forms of motion.
4/9/13CMPS 3120 Computational Geometry1 CMPS 3120: Computational Geometry Spring 2013 Motion Planning Carola Wenk.
Autonomous Robots Robot Path Planning (2) © Manfred Huber 2008.
Vector Analysis 15 Copyright © Cengage Learning. All rights reserved.
Tribal Challenge Review Question!
5. Conductors and dielectrics
1 Divergence Theorem. 2 Understand and use the Divergence Theorem. Use the Divergence Theorem to calculate flux. Objectives Total flux change = (field.
Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103 Chapter 10 Trees Slides are adopted from “Discrete.
T. C. van Dijk1, J.-H. Haunert2, J. Oehrlein2 1University of Würzburg
Copyright © Cengage Learning. All rights reserved.
Trees L Al-zaid Math1101.
Trees 11.1 Introduction to Trees Dr. Halimah Alshehri.
Reflections in Coordinate Plane
Trees 11.1 Introduction to Trees Dr. Halimah Alshehri.
Algorithm Research of Path Planning for Robot Based on Improved Artificial Potential Field(IAPF) Fenggang Liu.
Robotics meet Computer Science
7 The Mathematics of Networks
Planning.
Prof. Lizhuang Ma Shanghai Jiao Tong University
Presentation transcript:

FINDING TOPOLOGY IN A FACTORY: CONFIGURATION SPACES A.ABRAM AND R.GHRIST Also “Robot navigation functions on manifolds with boundary” – Daniel Koditschek and Elon Rimon.

2  Motivation: Consider an automated factory with a cadre of Robots. Figure1: Two Robots finding their way from start points to destination. FINDING TOPOLOGY IN A FACTORY: CONFIGURATION SPACES - Presentation by Gregory Naitzat

3  Configuration Spaces: We define.  What looks like? -. FINDING TOPOLOGY IN A FACTORY: CONFIGURATION SPACES - Presentation by Gregory Naitzat

4  Why homeomorphic to ?  homeomorphic to. Figure2: may be represented as a b FINDING TOPOLOGY IN A FACTORY: CONFIGURATION SPACES - Presentation by Gregory Naitzat

5  How does configuration space helps us with robot motion planning problem?  Safe control scheme using vector field on configuration space. Figure3: A Vector Field in Configuration space translates to robot motion. FINDING TOPOLOGY IN A FACTORY: CONFIGURATION SPACES - Presentation by Gregory Naitzat

6  Navigation function:  It can be shown that all initial conditions away from a set of zero measure are successfully brought to by. FINDING TOPOLOGY IN A FACTORY: CONFIGURATION SPACES - Presentation by Gregory Naitzat

7  Remark: Global attracting equilibrium state is topologically impossible. FINDING TOPOLOGY IN A FACTORY: CONFIGURATION SPACES - Presentation by Gregory Naitzat

8  One particular solution: Koditschek and Rimon.  Composition of repulsive and attractive potentials. Figure4: “Attractive” and “repulsive” potentials produce navigation function. FINDING TOPOLOGY IN A FACTORY: CONFIGURATION SPACES - Presentation by Gregory Naitzat

9  Koditschek and Rimon in more detail[1]:  Sphere World (for ) - Sphere World Boundary - Obstacle Repulsive Attractive Total: … → FINDING TOPOLOGY IN A FACTORY: CONFIGURATION SPACES - Presentation by Gregory Naitzat

10  Koditschek and Rimon in more detail[2]: K=3K=4K=6 Figure5: Koditschek and Rimon Navigation function. FINDING TOPOLOGY IN A FACTORY: CONFIGURATION SPACES - Presentation by Gregory Naitzat

11  Navigation properties are invariant under deformation.  So this solution is valid for any manifold to which Sphere World is deformable. FINDING TOPOLOGY IN A FACTORY: CONFIGURATION SPACES - Presentation by Gregory Naitzat

12  Robots moving about a collection of tracks embedded in the floor. Figure6: “Robots on an graph”. FINDING TOPOLOGY IN A FACTORY: CONFIGURATION SPACES - Presentation by Gregory Naitzat

13  Example: Figure7: Realization of. FINDING TOPOLOGY IN A FACTORY: CONFIGURATION SPACES - Presentation by Gregory Naitzat

14  It is hard to visualize even simple conf. spaces.  Discretized configuration space Figure8: Even Simple graph leads to complicated configuration spaces. FINDING TOPOLOGY IN A FACTORY: CONFIGURATION SPACES - Presentation by Gregory Naitzat

15  Discretized configuration space  We can think of this as imposing the restriction that any path between two robots must be at least one full edge apart. Figure9: Excluded Configurations [left] Closure of edge [center] Remaining Configurations [right]. closure FINDING TOPOLOGY IN A FACTORY: CONFIGURATION SPACES - Presentation by Gregory Naitzat

16  Example: 0-cells 1-cells 2-cells Figure10: Realization of. FINDING TOPOLOGY IN A FACTORY: CONFIGURATION SPACES - Presentation by Gregory Naitzat

17  Using same strategy it is easy to apprehend those spaces. Some interesting results appear.  Those are rather surprising results: Figure11: homeomorphic to closed orientable manifold g = 6. FINDING TOPOLOGY IN A FACTORY: CONFIGURATION SPACES - Presentation by Gregory Naitzat

18  How close are those discretized spaces to original ones? FINDING TOPOLOGY IN A FACTORY: CONFIGURATION SPACES - Presentation by Gregory Naitzat

19  How this works - Figure11: Graph that does not comply [upper] graph that complies [lower] with the theorem. FINDING TOPOLOGY IN A FACTORY: CONFIGURATION SPACES - Presentation by Gregory Naitzat

20  Another powerful result: FINDING TOPOLOGY IN A FACTORY: CONFIGURATION SPACES - Presentation by Gregory Naitzat

21  How this works[1] - FINDING TOPOLOGY IN A FACTORY: CONFIGURATION SPACES - Presentation by Gregory Naitzat

22  How this works[2] - P = 5 Figure12: Topological structure (homology class) of 5-prone tree. FINDING TOPOLOGY IN A FACTORY: CONFIGURATION SPACES - Presentation by Gregory Naitzat

23 Thank You!