Vladimir Ivan

Vladimir Ivan

Auto-generated profile, based on publicly available information

Vladimir Ivan

Touchlab Limited, Edinburgh, U.K.

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
17 June 2013 in The International Journal of Robotics Research
Verified
Journal Article
Closed access
VIVladimir Ivan
Vladimir Ivan
DZDmitry Zarubin
Dmitry Zarubin
MTMarc Toussaint
Marc Toussaint
TKTaku Komura
Taku Komura
SVSethu Vijayakumar
Sethu Vijayakumar
Motion can be described in several alternative representations, including joint configuration or end-effector spaces, but also more complex topology-based representations that imply a change of Voronoi bias, metric or topology of the motion space. Certain types of robot interaction problems, e.g. wrapping around an object, can suitably be described by so-called writhe and interaction mesh representations. However, considering motion synthesis solely in a topology-based space is insufficient since it does not account for additional tasks and constraints in other representations. In this paper, we propose methods to combine and exploit different representations for synthesis and generalization of motion in dynamic environments. Our motion synthesis approach is formulated in the framework of optimal control as an approximate inference problem. This allows for consistent combination of multiple representations (e.g. across task, end-effector and joint space). Motion generalization to novel situations and kinematics is similarly performed by projecting motion from topology-based to joint configuration space. We demonstrate the benefit of our methods on problems where direct path finding in joint configuration space is extremely hard whereas local optimal control exploiting a representation with different topology can efficiently find optimal trajectories. In real-world demonstrations, we highlight the benefits of using topology-based representations for online motion generalization in dynamic environments.

17 March 2021 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
RLRan Long
Ran Long
CRChristian Rauch
Christian Rauch
TZTianwei Zhang
Tianwei Zhang
VIVladimir Ivan
Vladimir Ivan
SVSethu Vijayakumar
Sethu Vijayakumar
This work presents a novel RGB-D SLAM approach to simultaneously segment, track and reconstruct the static background and large dynamic rigid objects that can occlude major portions of the camera view. Previous approaches treat dynamic parts of a scene as outliers and are thus limited to a small amount of changes in the scene, or rely on prior information for all objects in the scene to enable robust camera tracking. Here, we propose to treat all dynamic parts as one rigid body and simultaneously segment and track both static and dynamic components. We, therefore, enable simultaneous localisation and reconstruction of both the static background and rigid dynamic components in environments where dynamic objects cause large occlusion. We evaluate our approach on multiple challenging scenes with large dynamic occlusion. The evaluation demonstrates that our approach achieves better motion segmentation, localisation and mapping without requiring prior knowledge of the dynamic object's shape and appearance.

15 November 2017 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
YYYiming Yang
Yiming Yang
WMWolfgang Merkt
Wolfgang Merkt
VIVladimir Ivan
Vladimir Ivan
ZLZhibin Li
Zhibin Li
VVVladimir Vijayakumar
Vladimir Vijayakumar
In this letter, we first theoretically prove the conditions and boundaries of resolution completeness for deterministic roadmap methods with a discretized workspace. A novel variant of such methods, the hierarchical dynamic roadmap (HDRM), is then proposed for solving complex planning problems. A unique hierarchical structure to efficiently encode the configuration-to-workspace occupation information is introduced and allows the robot to check the collision state of tens of millions of samples on-the-fly—the number of which was previously strictly limited by available memory. The hierarchical structure also significantly reduces the time for path searching, hence, the robot is able to find feasible motion plans in real-time in extremely constrained environments. A rigorous benchmarking shows that HDRM is robust and computationally fast compared with classical dynamic roadmap methods and other state-of-the-art planning algorithms. Experiments on the seven degree-of-freedom KUKA LWR robotic arm integrated with live perception further validate the effectiveness of HDRM in complex environments.

23 October 2022
Verified
Conference Paper
Open access
TDTraiko Dinev
Traiko Dinev
CMCarlos Mastalli
Carlos Mastalli
VIVladimir Ivan
Vladimir Ivan
STSteve Tonneau
Steve Tonneau
SVSethu Vijayakumar
Sethu Vijayakumar
We present a versatile framework for the computational co-design of legged robots and dynamic maneuvers. Current state-of-the-art approaches are typically based on random sampling or concurrent optimization. We propose a novel bilevel optimization approach that exploits the derivatives of the motion planning sub-problem (i.e., the lower level). These motion-planning derivatives allow us to incorporate arbitrary design constraints and costs in an general-purpose nonlinear program (i.e., the upper level). Our approach allows for the use of any differentiable motion planner in the lower level and also allows for an upper level that captures arbitrary design constraints and costs. It efficiently optimizes the robot's morphology, payload distribution and actuator parameters while considering its full dynamics, joint limits and physical constraints such as friction cones. We demonstrate these capabilities by designing quadruped robots that jump and trot. We show that our method is able to design a more energy-efficient Solo robot for these tasks.

24 June 2022 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
RLRan Long
Ran Long
CRChristian Rauch
Christian Rauch
TZTianwei Zhang
Tianwei Zhang
VIVladimir Ivan
Vladimir Ivan
TLTin Lun Lam
Tin Lun Lam
SVSethu Vijayakumar
Sethu Vijayakumar
This work presents a novel dense RGB-D SLAM approach for dynamic planar environments that enables simultaneous multi-object tracking, camera localisation and background reconstruction. Previous dynamic SLAM methods either rely on semantic segmentation to directly detect dynamic objects; or assume that dynamic objects occupy a smaller proportion of the camera view than the static background and can, therefore, be removed as outliers. With the aid of camera motion prior, our approach enables dense SLAM when the camera view is largely occluded by multiple dynamic objects. The dynamic planar objects are separated by their different rigid motions and tracked independently. The remaining dynamic non-planar areas are removed as outliers and not mapped into the background. The evaluation demonstrates that our approach outperforms the state-of-the-art methods in terms of localisation, mapping, dynamic segmentation and object tracking. We also demonstrate its robustness to large drift in the camera motion prior.

1 March 2013 in Sensors
Verified
Journal Article
Open access
PDF file
ÁLÁngel Llamazares
Ángel Llamazares
VIVladimir Ivan
Vladimir Ivan
EVEduardo José Molinos Vicente
Eduardo José Molinos Vicente
Manuel OcañaManuel Ocaña
Manuel Ocaña
SVSethu Vijayakumar
Sethu Vijayakumar
The goal of this paper is to solve the problem of dynamic obstacle avoidance for a mobile platform using the stochastic optimal control framework to compute paths that are optimal in terms of safety and energy efficiency under constraints. We propose a threedimensional extension of the Bayesian Occupancy Filter (BOF) (Cou´e et al. Int. J. Rob. Res. 2006, 25, 19–30) to deal with the noise in the sensor data, improving the perception stage. We reduce the computational cost of the perception stage by estimating the velocity of each obstacle using optical flow tracking and blob filtering. While several obstacle avoidance systems have been presented in the literature addressing safety and optimality of the robot motion separately, we have applied the approximate inference framework to this problem to combine multiple goals, constraints and priors in a structured way. It is important to remark that the problem involves obstacles that can be moving, therefore classical techniques based on reactive control are not optimal from the point of view of energy consumption. Some experimental results, including comparisons against classical algorithms that highlight the advantages, are presented.