Efficient Planning for Near-Optimal Compliant Manipulation Leveraging Environmental Contact

Path planning classically focuses on avoiding environmental contact. However, some assembly tasks permit contact through compliance, and such contact may allow for more efficient and reliable solutions under action uncertainty. But, optimal manipulation plans that leverage environmental contact are...

Full description

Bibliographic Details
Main Authors: Guan, Charlie (Author), Vega-Brown, William R (Author), Roy, Nicholas (Author)
Other Authors: Massachusetts Institute of Technology. Department of Aeronautics and Astronautics (Contributor), Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor)
Format: Article
Language:English
Published: Institute of Electrical and Electronics Engineers (IEEE), 2020-06-18T18:13:47Z.
Subjects:
Online Access:Get fulltext
LEADER 01864 am a22001933u 4500
001 125865
042 |a dc 
100 1 0 |a Guan, Charlie  |e author 
100 1 0 |a Massachusetts Institute of Technology. Department of Aeronautics and Astronautics  |e contributor 
100 1 0 |a Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory  |e contributor 
700 1 0 |a Vega-Brown, William R  |e author 
700 1 0 |a Roy, Nicholas  |e author 
245 0 0 |a Efficient Planning for Near-Optimal Compliant Manipulation Leveraging Environmental Contact 
260 |b Institute of Electrical and Electronics Engineers (IEEE),   |c 2020-06-18T18:13:47Z. 
856 |z Get fulltext  |u https://hdl.handle.net/1721.1/125865 
520 |a Path planning classically focuses on avoiding environmental contact. However, some assembly tasks permit contact through compliance, and such contact may allow for more efficient and reliable solutions under action uncertainty. But, optimal manipulation plans that leverage environmental contact are difficult to compute. Environmental contact produces complex kinematics that create difficulties for planning. This complexity is usually addressed by discretization over state and action space, but discretization quickly becomes computationally intractable. To overcome the challenge, we use the insight that only actions on configurations near the contact manifold are likely to involve complex kinematics, while segments of the plan through free space do not. Leveraging this structure can greatly reduce the number of states considered and scales much better with problem complexity. We develop an algorithm based on this idea and show that it performs comparably to full MDP solutions at a fraction of the computational cost. 
546 |a en 
655 7 |a Article 
773 |t IEEE International Conference on Robotics and Automation (ICRA)