Anastasiia Varava

Anastasiia Varava

Auto-generated profile, based on publicly available information

Anastasiia Varava

CAS/RPL, KTH, Stocholm, Sweden

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
13 January 2020 in IEEE Robotics and Automation Letters
Verified
Journal Article
Open access
IGIrene Garcia-Camacho
Irene Garcia-Camacho
MLMartina Lippi
Martina Lippi
MWMichael C. Welle
Michael C. Welle
HYHang Yin
Hang Yin
RARika Antonova
Rika Antonova
DKDanica Kragic
Danica Kragic

10 March 2021 in Autonomous Robots
Verified
Journal Article
Closed access
PDF file
HSHaoran Song
Haoran Song
AVAnastasiia Varava
Anastasiia Varava
OKOleksandr Kravchenko
Oleksandr Kravchenko
DKDanica Kragic
Danica Kragic
MWMichael Yu Wang
Michael Yu Wang
KHKaiyu Hang
Kaiyu Hang

22 September 2016 in IEEE Transactions on Robotics
Verified
Journal Article
Closed access
AVAnastasiia Varava
Anastasiia Varava
DKDanica Kragic
Danica Kragic
FPFlorian T. Pokorny
Florian T. Pokorny
Caging provides an alternative to point-contact-based rigid grasping, relying on reasoning about the global free configuration space of an object under consideration. While substantial progress has been made toward the analysis, verification, and synthesis of cages of polygonal objects in the plane, the use of caging as a tool for manipulating general complex objects in 3-D remains challenging. In this work, we introduce the problem of caging rigid and partially deformable 3-D objects, which exhibit geometric features we call double forks and necks. Our approach is based on the linking number-a classical topological invariant, allowing us to determine sufficient conditions for caging objects with these features even in the case when the object under consideration is partially deformable under a set of neck or double fork preserving deformations. We present synthesis and verification algorithms and demonstrations of applying these algorithms to cage 3-D meshes.

20 July 2022 in IEEE Transactions on Robotics
Verified
Journal Article
Closed access
MLMartina Lippi
Martina Lippi
PPPetra Poklukar
Petra Poklukar
MWMichael C. Welle
Michael C. Welle
AVAnastasia Varava
Anastasia Varava
HYHang Yin
Hang Yin
DKDanica Kragic
Danica Kragic
In this article, we present a framework for visual action planning of complex manipulation tasks with high-dimensional state spaces, focusing on manipulation of deformable objects. We propose a latent space roadmap (LSR) for task planning, which is a graph-based structure globally capturing the system dynamics in a low-dimensional latent space. Our framework consists of the following three parts. First, a mapping module (MM) that maps observations is given in the form of images into a structured latent space extracting the respective states as well as generates observations from the latent states. Second, the LSR, which builds and connects clusters containing similar states in order to find the latent plans between start and goal states, extracted by MM. Third, the action proposal module that complements the latent plan found by the LSR with the corresponding actions. We present a thorough investigation of our framework on simulated box stacking and rope/box manipulation tasks, and a folding task executed on a real robot.

7 July 2020 in The International Journal of Robotics Research
Verified
Journal Article
Open access
PDF file
AVAnastasiia Varava
Anastasiia Varava
JCJ. Frederico Carvalho
J. Frederico Carvalho
DKDanica Kragic
Danica Kragic
FPFlorian T. Pokorny
Florian T. Pokorny
In this work, we propose algorithms to explicitly construct a conservative estimate of the configuration spaces of rigid objects in two and three dimensions. Our approach is able to detect compact path components and narrow passages in configuration space which are important for applications in robotic manipulation and path planning. Moreover, as we demonstrate, they are also applicable to identification of molecular cages in chemistry. Our algorithms are based on a decomposition of the resulting three- and six-dimensional configuration spaces into slices corresponding to a finite sample of fixed orientations in configuration space. We utilize dual diagrams of unions of balls and uniform grids of orientations to approximate the configuration space. Furthermore, we carry out experiments to evaluate the computational efficiency on a set of objects with different geometric features thus demonstrating that our approach is applicable to different object shapes. We investigate the performance of our algorithm by computing increasingly fine-grained approximations of the object’s configuration space. A multithreaded implementation of our approach is shown to result in significant speed improvements.

28 November 2019
Verified
Book Chapter
Closed access
PDF file
AVAnastasiia Varava
Anastasiia Varava
JCJ. Frederico Carvalho
J. Frederico Carvalho
FPFlorian T. Pokorny
Florian T. Pokorny
DKDanica Kragic
Danica Kragic