İzmir Institute of Technology Mathematics Department Seminars

An Upper Bound For $m$− Dimensional Topological Complexity of $F(R^n,k)$
Ayşe Borat
Bursa Technical University, Turkey
Özet : Topological robotics investigates the motion planning problem of a robot/robots whose initial and final points are given as an input. One of the basic problems in this field is to compute the topological complexity $(TC)$ of a space. Rudyak considered this motion planning problem in a more general way in [4], and defined $m$− dimensional topological complexity $(TC_m)$ which is related to the motion planning problem whose input is m distinct points. In this talk, we will give a computation for the upper bound of $m$-dimensional topological complexity of the configuration spaces $F(R^n,k)$ .
  Tarih : 09.10.2015
  Saat : 14:00
  Yer : Seminar room: 122
  Dil : English
    Yazdır