Multi-Object Rearrangement with Monte Carlo Tree Search: A Case Study on Planar Nonprehensile Sorting-Reference-Cited by-同舟云学术

Multi-Object Rearrangement with Monte Carlo Tree Search: A Case Study on Planar Nonprehensile Sorting

Published:2020-10-24 Issue: Volume: Page:
ISSN:
Container-title:2020 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)
language:
Short-container-title:

Author:

Song Haoran¹,Haustein Joshua A.²,Yuan Weihao¹,Hang Kaiyu³,Wang Michael Yu¹,Kragic Danica²,Stork Johannes A.⁴

Affiliation:

1. Robotics Institute, Hong Kong University of Science and Technology,Hong Kong,China

2. KTH Royal Institute of Technology,Centre for Autonomous Systems, EECS,Stockholm,Sweden

3. Yale University,Department of Mechanical Engineering and Material Science,New Haven,Connecticut,USA

4. Orebro University,Centre for Applied Autonomous Sensor Systems,Orebro,Sweden

Funder

Innovation and Technology Fund

Publisher

IEEE

Link

Cited by 31 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Learning Dual-arm Object Rearrangement for Cartesian Robots;2024 IEEE International Conference on Robotics and Automation (ICRA);2024-05-13

2. Toward Optimal Tabletop Rearrangement with Multiple Manipulation Primitives;2024 IEEE International Conference on Robotics and Automation (ICRA);2024-05-13

5. Efficient Object Manipulation Planning with Monte Carlo Tree Search;2023 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS);2023-10-01