Michael C. Koval
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Michael C. Koval has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
Siddhartha S. Srinivasa
Carnegie Mellon University
4 shared publicationsNancy S. Pollard
The Robotics Institute Carnegie Mellon University
3 shared publications- Siddhartha S. Srinivasa
Carnegie Mellon University
2 shared publications - Abhijeet Tallavajhula
Indian Institute of Technology Kharagpur, Kharagpur, India
1 shared publication David Hsu
National University of Singapore
1 shared publication- David Hsu
National University of Singapore
1 shared publication
Latest Publications
- 7 May 2020
- Published by Springer Nature in Springer Proceedings in Advanced Robotics
- p. 768-783
Configuration Lattices for Planar Contact Manipulation Under Uncertainty
- 7 May 2020
- Published by Springer Nature in Springer Proceedings in Advanced Robotics
- p. 768-783
Configuration Lattices for Planar Contact Manipulation Under Uncertainty
- Open Access
Configuration Lattices for Planar Contact Manipulation Under Uncertainty
This work addresses the challenge of a robot using real-time feedback from contact sensors to reliably manipulate a movable object on a cluttered tabletop. We formulate contact manipulation as a partially observable Markov decision process (POMDP) in the joint space of robot configurations and object poses. The POMDP formulation enables the robot to actively gather information and reduce the uncertainty on the object pose. Further, it incorporates all major constraints for robot manipulation: kinematic reachability, self-collision, and collision with obstacles. To solve the POMDP, we apply DESPOT, a state-of-the-art online POMDP algorithm. Our approach leverages two key ideas for computational efficiency. First, it performs lazy construction of a configuration-space lattice by interleaving construction of the lattice and online POMDP planning. Second, it combines online and offline POMDP planning by solving relaxed POMDP offline and using the solution to guide the online search algorithm. We evaluated the proposed approach on a seven degree-of-freedom robot arm in simulation environments. It significantly outperforms several existing algorithms, including some commonly used heuristics for contact manipulation under uncertainty.
Open AccessConfiguration Lattices for Planar Contact Manipulation Under Uncertainty
This work addresses the challenge of a robot using real-time feedback from contact sensors to reliably manipulate a movable object on a cluttered tabletop. We formulate contact manipulation as a partially observable Markov decision process (POMDP) in the joint space of robot configurations and object poses. The POMDP formulation enables the robot to actively gather information and reduce the uncertainty on the object pose. Further, it incorporates all major constraints for robot manipulation: kinematic reachability, self-collision, and collision with obstacles. To solve the POMDP, we apply DESPOT, a state-of-the-art online POMDP algorithm. Our approach leverages two key ideas for computational efficiency. First, it performs lazy construction of a configuration-space lattice by interleaving construction of the lattice and online POMDP planning. Second, it combines online and offline POMDP planning by solving relaxed POMDP offline and using the solution to guide the online search algorithm. We evaluated the proposed approach on a seven degree-of-freedom robot arm in simulation environments. It significantly outperforms several existing algorithms, including some commonly used heuristics for contact manipulation under uncertainty.
- Open Access
The Manifold Particle Filter for State Estimation on High-dimensional Implicit Manifolds
We estimate the state a noisy robot arm and underactuated hand using an Implicit Manifold Particle Filter (MPF) informed by touch sensors. As the robot touches the world, its state space collapses to a contact manifold that we represent implicitly using a signed distance field. This allows us to extend the MPF to higher (six or more) dimensional state spaces. Earlier work (which explicitly represents the contact manifold) only shows the MPF in two or three dimensions. Through a series of experiments, we show that the implicit MPF converges faster and is more accurate than a conventional particle filter during periods of persistent contact. We present three methods of sampling the implicit contact manifold, and compare them in experiments.
Open AccessThe Manifold Particle Filter for State Estimation on High-dimensional Implicit Manifolds
We estimate the state a noisy robot arm and underactuated hand using an Implicit Manifold Particle Filter (MPF) informed by touch sensors. As the robot touches the world, its state space collapses to a contact manifold that we represent implicitly using a signed distance field. This allows us to extend the MPF to higher (six or more) dimensional state spaces. Earlier work (which explicitly represents the contact manifold) only shows the MPF in two or three dimensions. Through a series of experiments, we show that the implicit MPF converges faster and is more accurate than a conventional particle filter during periods of persistent contact. We present three methods of sampling the implicit contact manifold, and compare them in experiments.
- 23 April 2016
- Published by Springer Nature
- p. 375-391
Manifold Representations for State Estimation in Contact Manipulation
- 23 April 2016
- Published by Springer Nature
- p. 375-391
Manifold Representations for State Estimation in Contact Manipulation
- 21 August 2015
- Published by SAGE Publications in The International Journal of Robotics Research
- Vol. 35 (1-3) , 244-264
Pre- and post-contact policy decomposition for planar contact manipulation under uncertainty
We consider the problem of using real-time feedback from contact sensors to create closed-loop pushing actions. To do so, we formulate the problem as a partially observable Markov decision process (POMDP) with a transition model based on a physics simulator and a reward function that drives the robot towards a successful grasp. We demonstrate that it is intractable to solve the full POMDP with traditional techniques and introduce a novel decomposition of the policy into pre- and post-contact stages to reduce the computational complexity. Our method uses an offline point-based solver on a variable-resolution discretization of the state space to solve for a post-contact policy as a pre-computation step. Then, at runtime, we use an A* search to compute a pre-contact trajectory. We prove that the value of the resulting policy is within a bound of the value of the optimal policy and give intuition about when it performs well. Additionally, we show the policy produced by our algorithm achieves a successful grasp more quickly and with higher probability than a baseline QMDP policy on two different objects in simulation. Finally, we validate our simulation results on a real robot using commercially available tactile sensors.
- 21 August 2015
- Published by SAGE Publications in The International Journal of Robotics Research
- Vol. 35 (1-3) , 244-264
Pre- and post-contact policy decomposition for planar contact manipulation under uncertainty
We consider the problem of using real-time feedback from contact sensors to create closed-loop pushing actions. To do so, we formulate the problem as a partially observable Markov decision process (POMDP) with a transition model based on a physics simulator and a reward function that drives the robot towards a successful grasp. We demonstrate that it is intractable to solve the full POMDP with traditional techniques and introduce a novel decomposition of the policy into pre- and post-contact stages to reduce the computational complexity. Our method uses an offline point-based solver on a variable-resolution discretization of the state space to solve for a post-contact policy as a pre-computation step. Then, at runtime, we use an A* search to compute a pre-contact trajectory. We prove that the value of the resulting policy is within a bound of the value of the optimal policy and give intuition about when it performs well. Additionally, we show the policy produced by our algorithm achieves a successful grasp more quickly and with higher probability than a baseline QMDP policy on two different objects in simulation. Finally, we validate our simulation results on a real robot using commercially available tactile sensors.
- 26 October 2013
- Published by Springer Nature in Autonomous Robots
- Vol. 36 (1-2) , 153-167
Object search by manipulation
- 26 October 2013
- Published by Springer Nature in Autonomous Robots
- Vol. 36 (1-2) , 153-167
Object search by manipulation