شماره ركورد كنفرانس :
5263
عنوان مقاله :
TARGETED MOVEMENT OF THE ROBOT BY REMOVING OBSTACLES
پديدآورندگان :
MIREBRAHIMI HANIEH h_mirebrahimi@um.ac.ir Department of Pure Mathematics, Ferdowsi University of Mashhad, Mashhad, Iran , Aghili Seyyed Abolfazl s.a.aghili@mail.um.ac.ir Department of Pure Mathematics, Ferdowsi University of Mashhad, Mashhad, Iran
كليدواژه :
topological complexity , motion planning , targeted motion
عنوان كنفرانس :
54 امين كنفرانس رياضي ايران
چكيده فارسي :
We express a new definition of complexity and call it targeted complexity. By removing the obstacles from the configuration space, we define a targeted movement for the robot. With the motivation to reduce the number of motion programs and obtain a more optimal value for complexity. Also we show that relative topological complexity of a pair T C(X, B) is a special case of targeted complexity.
