TOPOLOGICAL COMPLEXITY OF FIBRATIONS AND COVERING MAPS

Slides:



Advertisements
Similar presentations
An Application of Lie theory to Computer Graphics Applied Topology 25 th July Będlewo Shizuo KAJI Yamaguchi University JST/CREST.
Advertisements

Addendum For the simple cases in 2-dimensions we have not distinguished between homotopy and homology. The distinction however does exist even in 2-d.
1 Enviromatics Spatial database systems Spatial database systems Вонр. проф. д-р Александар Маркоски Технички факултет – Битола 2008 год.
1Notes  Assignment 0 marks should be ready by tonight (hand back in class on Monday)
Approximation of Attractors Using the Subdivision Algorithm Dr. Stefan Siegmund Peter Taraba.
Flagged Parallel Manipulators F. Thomas (joint work with M. Alberich and C. Torras) Institut de Robòtica i Informàtica Industrial Institut de Robòtica.
BINARY MORPHOLOGY and APPLICATIONS IN ROBOTICS. Applications of Minkowski Sum 1.Minkowski addition plays a central role in mathematical morphology 2.It.
CPSC 452: Lecture 1 Introduction, Homogeneous transformations and Coordinate frames.
Robotics Industry Posts Second Best Year Ever North American robotics industry posted its second best year ever in 2000 [Robotic Industries Association.
Contributed Talk at the International Workshop on VISUALIZATION and MATHEMATICS 2002 Thomas Lewiner, Hélio Lopes, Geovan Tavares Math&Media Laboratory,
CSE 473 Dr. Charles B. Owen Fundamentals of 3D Game Development1 Skeletons and Skinning Bones and Skeletons Mesh Skinning.
University of Bridgeport Department of Computer Science and Engineering Robotics, Intelligent Sensing and control RISC Laboratory.
INVERSE KINEMATICS IN A ROBOTIC ARM AND METHODS TO AVOID SINGULARITIES Submitted By :-Course Instructor :- Avinash Kumar Prof. Bhaskar Dasgupta Roll No.-
General (point-set) topology Jundong Liu Ohio Univ.
Flagged Parallel Manipulators F. Thomas (joint work with M. Alberich and C. Torras) Institut de Robòtica i Informàtica Industrial Institut de Robòtica.
T. Bajd, M. Mihelj, J. Lenarčič, A. Stanovnik, M. Munih, Robotics, Springer, 2010 ROBOT CONTROL T. Bajd and M. Mihelj.
CS B659: Principles of Intelligent Robot Motion Configuration Space.
HVACR116 – Trade Skills Symbols.
Logical Effort and Transistor Sizing Digital designs are usually expected to operate at high frequencies, thus designers often have to choose the fastest.
Robot Kinematics: Position Analysis 2.1 INTRODUCTION  Forward Kinematics: to determine where the robot ’ s hand is? (If all joint variables are known)
HVACR116 – Trade Skills Symbols. Objectives After completing this unit, you will be able to identify and understand the meaning of the listed symbols:
M. Zareinejad 1. 2 Grounded interfaces Very similar to robots Need Kinematics –––––– Determine endpoint position Calculate velocities Calculate force-torque.
CSCE 452 Intro to Robotics CSCE 452: Lecture 1 Introduction, Homogeneous Transformations, and Coordinate frames.
Inverse Kinematics for Robotics using Neural Networks. Authors: Sreenivas Tejomurtula., Subhash Kak
Introduction to Robotics In the name of Allah. Introduction to Robotics o Leila Sharif o
Algebraic Topology Dr. SOHAIL IQBAL MTH 477 For Master of Mathematics
Dimensions of Neural Networks Ali Akbar Darabi Ghassem Mirroshandel Hootan Nokhost.
I-SNAKE. o WHAT IS I-SNAKE? o COMPONENTS OF I-SNAKE o WHAT IS THE PURPOSE OF NEW CARDIO ARM: o HOW DOES I-SNAKE WORKS? o DEVICE DESIGN o TESTING PROCESS.
3 rd lecture Presented by Dr. Sarah Mustafa Eljack.
Tse Leung So University of Southampton 28th July 2017
FREE TOPOLOGICAL GROUPS AND FUNCTORIAL FIBREWISE CONSTRUCTIONS
Date of download: 10/6/2017 Copyright © ASME. All rights reserved.
Data Mining, Neural Network and Genetic Programming
LOWER ESTIMATES FOR THE TOPOLOGICAL COMPLEXITY
ME886.3 Topic 1: System and System Design (II)
Continuum Mechanics (MTH487)
Computer Output Device: Arm Robot
Input/Output 1 1.
Date of download: 12/25/2017 Copyright © ASME. All rights reserved.
Accurate Robot Positioning using Corrective Learning
Automatically trivial fibrations
Hire Toyota Innova in Delhi for Outstation Tour
BK21 PLUS 타이거 세미나 ( 화 ) 발 표 자 : 박 지 훈
Knowledge Representation
Elements of Combinatorial Topology
Constraints: Connectivity and Mobility, Lecture 2
ON THE LUSTERNIK-SCHNIRELMANN CATEGORY APPROACH
Skeletons and Skinning
CSE4421/5324: Introduction to Robotics
Topological Sort Neil Tang 03/02/2010
2-DOF Manipulator Now, given the joint angles Ө1, Ө2 we can determine the end effecter coordinates x and y.
Topological Ordering Algorithm: Example
רובוטיקה.
in Statistical Physics
KINEMATIC CHAINS.
S p e c i a l E n g l i s h f o r I n d u s t r i a l R o b o t
FREE TOPOLOGICAL GROUPS AND FUNCTORIAL FIBREWISE CONSTRUCTIONS
Numerical Analysis Lecture 19.
CHAPTER 14 ROBOTICS.
How to Get Where you Want to Go
TOPOLOGICAL COMPLEXITY OF KINEMATIC MAPS
General Concept On Operational Excellence Open for discussion.
Topological Ordering Algorithm: Example
Petar Pavešić, University of Ljubljana
Topological Ordering Algorithm: Example
Artificial Intelligence
Ordering Real Numbers 8.NS.2.
Chapter 4 . Trajectory planning and Inverse kinematics
Subprograms General concepts Parameter passing Functions
Topological Ordering Algorithm: Example
Presentation transcript:

TOPOLOGICAL COMPLEXITY OF FIBRATIONS AND COVERING MAPS ABSTRACT TOPOLOGICAL COMPLEXITY OF FIBRATIONS AND COVERING MAPS Petar Pavešić, University of Ljubljana Topological complexity of a map was initially introduced as a measure of the manipulation complexity of a mechanical device with a given forward kinematic map. The resulting concept is not homotopy invariant because kinematic maps that appear in robotics usually have singularities. On the other hand, the topological complexity of a fibration is homotopy invariant, so we may consider the approximation of the topological complexity of an arbitrary map by the topological complexity of the associated fibration. In our talk we will discuss the topological complexity of fibrations and their relation with the complexity of general maps. In particular, we will consider the important special case of covering maps and their complexity. Bedlewo - 2017 1

Review of TC(X) TOPOLOGICAL COMPLEXITY OF FIBRATIONS AND COVERING MAPS 2

TOPOLOGICAL COMPLEXITY OF FIBRATIONS AND COVERING MAPS REVIEW OF TC(X) 3

TC of a map TOPOLOGICAL COMPLEXITY OF FIBRATIONS AND COVERING MAPS 4

TOPOLOGICAL COMPLEXITY OF FIBRATIONS AND COVERING MAPS TC OF A MAP 5

A x TOPOLOGICAL COMPLEXITY OF FIBRATIONS AND COVERING MAPS TC OF A MAP 6

y A TOPOLOGICAL COMPLEXITY OF FIBRATIONS AND COVERING MAPS TC OF A MAP 7

TOPOLOGICAL COMPLEXITY OF FIBRATIONS AND COVERING MAPS INVARIANCE Invariance TC=2 TC=1 8

TOPOLOGICAL COMPLEXITY OF FIBRATIONS AND COVERING MAPS INVARIANCE 9

TOPOLOGICAL COMPLEXITY OF FIBRATIONS AND COVERING MAPS INVARIANCE 10

Cohomological estimate TOPOLOGICAL COMPLEXITY OF FIBRATIONS AND COVERING MAPS COHOMOLOGICAL ESTIMATE Cohomological estimate 11

Fibrations dimension-connectivity estimate TOPOLOGICAL COMPLEXITY OF FIBRATIONS AND COVERING MAPS FIBRATIONS Fibrations dimension-connectivity estimate 12

TOPOLOGICAL COMPLEXITY OF FIBRATIONS AND COVERING MAPS FIBRATIONS 13

TOPOLOGICAL COMPLEXITY OF FIBRATIONS AND COVERING MAPS FIBRATIONS 14

Coverings TOPOLOGICAL COMPLEXITY OF FIBRATIONS AND COVERING MAPS 15

TOPOLOGICAL COMPLEXITY OF FIBRATIONS AND COVERING MAPS COVERINGS 16

TOPOLOGICAL COMPLEXITY OF FIBRATIONS AND COVERING MAPS THE END 17