Kerry He

Kerry He

Ph.D. Candidate in Electrical and Computer Systems Engineering at Monash University

Sitemap

A list of all the posts and pages found on the site. For you robots out there is an XML version available for digesting as well.

Pages

Posts

Future Blog Post

less than 1 minute read

Published:

This post will show up by default. To disable scheduling of future posts, edit config.yml and set future: false.

Blog Post number 4

less than 1 minute read

Published:

This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.

Blog Post number 3

less than 1 minute read

Published:

This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.

Blog Post number 2

less than 1 minute read

Published:

This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.

Blog Post number 1

less than 1 minute read

Published:

This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.

portfolio

publications

talks

Learning to Place Objects onto Flat Surfaces in Upright Orientations

Published:

We study the problem of placing a grasped object on an empty flat surface in an upright orientation, such as placing a cup on its bottom rather than on its side. We aim to find the required object rotation such that when the gripper is opened after the object makes contact with the surface, the object would be stably placed in the upright orientation. We iteratively use two neural networks. At every iteration, we use a convolutional neural network to estimate the required object rotation, which is executed by the robot, and then a separate convolutional neural network to estimate the quality of a placement in its current orientation. Our approach places previously unseen objects in upright orientations with a success rate of 98.1% in free space and 90.3% with a simulated robotic arm, using a dataset of 50 everyday objects in simulation experiments. Real-world experiments were performed, which achieved an 88.0% success rate, which serves as a proof-ofconcept for direct sim-to-real transfer.

Camera view from crane payload: video stabilization

Published:

Tower crane operators often have limited visibility during lifting operations in the construction of high-rise buildings. Providing the operator with visual feedback from the perspective of the payload has potential to reduce collisions. However, a camera feed from this perspective is susceptible to disorienting swinging motions. This paper presents an algorithm to digitally stabilize this low-frequency, high-amplitude swinging motion in 3D. A stabilized virtual camera feed is created to give the operator an intuitive perspective. The Euclidean transform between the actual and virtual cameras is related to an image transform. This is then used to warp the image to achieve the desired stabilization effect. Experimental validation with a robotic arm to simulate the crane dynamics demonstrates the effectiveness of stabilization.

On-The-Go Robot-to-Human Handovers with a Mobile Manipulator

Published:

Existing approaches to direct robot-to-human handovers are typically implemented on fixed-base robot arms, or on mobile manipulators that come to a full stop before performing the handover. We propose “on-the-go” handovers which permit a moving mobile manipulator to hand over an object to a human without stopping. The on-the-go handover motion is generated with a reactive controller that allows simultaneous control of the base and the arm. In a user study, human receivers subjectively assessed on-the-go handovers to be more efficient, predictable, natural, better timed and safer than handovers that implemented a “stop-and-deliver” behavior.

Visibility Maximization Controller for Robotic Manipulation

Published:

Occlusions caused by a robot’s own body is a common problem for closed-loop control methods employed in eye-to-hand camera setups. We propose an optimization-based reactive controller that minimizes self-occlusions while achieving a desired goal pose. The approach allows coordinated control between the robot’s base, arm and head by encoding the line-of-sight visibility to the target as a soft constraint along with other task-related constraints, and solving for feasible joint and base velocities. The generalizability of the approach is demonstrated in simulated and real-world experiments, on robots with fixed or mobile bases, with moving or fixed objects, and multiple objects. The experiments revealed a trade-off between occlusion rates and other task metrics. While a planning-based baseline achieved lower occlusion rates than the proposed controller, it came at the expense of highly inefficient paths and a significant drop in the task success. On the other hand, the proposed controller is shown to improve visibility to the line target object(s) without sacrificing too much from the task success and efficiency. Videos and code can be found at: rhys-newbury.github.io/projects/vmc/.

Mirror Descent and Quantum Blahut-Arimoto Algorithms

Published:

Convex optimization problems arise naturally when studying the fundamental limits of communication systems, such as computing quantities known as channel capacities. The Blahut-Arimoto algorithm is a well known method to solve for classical channel capacities, and recent works have extended this algorithm to compute various quantum channel capacities. We show that the classical and quantum Blahut-Arimoto algorithms can be interpreted as mirror descent, which is a well studied generalisation of projected gradient descent for non-Euclidean geometries. Using this perspective, we show how existing tools in convex optimization can be used to guarantee bounds on convergence rates, and how the algorithm can be modified to solve a wider range of related problems in quantum information theory.

Computation of the Quantum Rate-Distortion Function

Published:

Convex optimization problems arise naturally when studying the fundamental limits of communication systems, such as computing quantities known as channel capacities. The Blahut-Arimoto algorithm is a well known method to solve for classical channel capacities, and recent works have extended this algorithm to compute various quantum channel capacities. We show that the classical and quantum Blahut-Arimoto algorithms can be interpreted as mirror descent, which is a well studied generalisation of projected gradient descent for non-Euclidean geometries. Using this perspective, we show how existing tools in convex optimization can be used to guarantee bounds on convergence rates, and how the algorithm can be modified to solve a wider range of related problems in quantum information theory.

teaching

Teaching experience 1

Undergraduate course, University 1, Department, 2014

This is a description of a teaching experience. You can use markdown like any other post.

Teaching experience 2

Workshop, University 1, Department, 2015

This is a description of a teaching experience. You can use markdown like any other post.