Grasp Planning for Occluded Objects in a Confined Space with Lateral View Using Monte Carlo Tree Search

被引:1
|
作者
Kang, Minjae [1 ,2 ]
Kee, Hogun [1 ,2 ]
Kim, Junseok [1 ,2 ]
Oh, Songhwai [1 ,2 ]
机构
[1] Seoul Natl Univ, Dept Elect & Comp Engn, Seoul 08826, South Korea
[2] Seoul Natl Univ, ASRI, Seoul 08826, South Korea
关键词
D O I
10.1109/IROS47612.2022.9981069
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In the lateral access environment, the robot behavior should be planned considering surrounding objects and obstacles because object observation directions and approach angles are limited. To safely retrieve a partially occluded target object in these environments, we have to relocate objects using prehensile actions to create a collision-free path for the target. We propose a learning-based method for object rearrangement planning applicable to objects of various types and sizes in the lateral environment. We plan the optimal rearrangement sequence by considering both collisions and approach angles at which objects can be grasped. The proposed method finds the grasping order through Monte Carlo tree search, significantly reducing the tree search cost using point cloud states. In the experiment, the proposed method shows the best and most stable performance in various scenarios compared to the existing TAMP methods. In addition, we confirm that the proposed method trained in simulation can be easily applied to a real robot without additional fine-tuning, showing the robustness of the proposed method.
引用
收藏
页码:10921 / 10926
页数:6
相关论文
共 50 条
  • [31] Pareto Monte Carlo Tree Search for Multi-Objective Informative Planning
    Chen, Weizhe
    Liu, Lantao
    ROBOTICS: SCIENCE AND SYSTEMS XV, 2019,
  • [32] Decentralized Cooperative Planning for Automated Vehicles with Continuous Monte Carlo Tree Search
    Kurzer, Karl
    Engelhorn, Florian
    Zoellner, J. Marius
    2018 21ST INTERNATIONAL CONFERENCE ON INTELLIGENT TRANSPORTATION SYSTEMS (ITSC), 2018, : 452 - 459
  • [33] Nested Monte-Carlo Tree Search for Online Planning in Large MDPs
    Baier, Hendrik
    Winands, Mark H. M.
    20TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE (ECAI 2012), 2012, 242 : 109 - 114
  • [34] Satellite Autonomous Mission Planning Based on Improved Monte Carlo Tree Search
    Li, Zichao
    Li, You
    Luo, Rongzheng
    SYMMETRY-BASEL, 2024, 16 (08):
  • [35] Decentralized Cooperative Planning for Automated Vehicles with Hierarchical Monte Carlo Tree Search
    Kurzer, Karl
    Zhou, Chenyang
    Zoellner, J. Marius
    2018 IEEE INTELLIGENT VEHICLES SYMPOSIUM (IV), 2018, : 529 - 536
  • [36] The hierarchical task network planning method based on Monte Carlo Tree Search
    Shao, Tianhao
    Zhang, Hongjun
    Cheng, Kai
    Zhang, Ke
    Bie, Lin
    KNOWLEDGE-BASED SYSTEMS, 2021, 225
  • [37] Decoupled Monte Carlo Tree Search for Cooperative Multi-Agent Planning
    Asik, Okan
    Aydemir, Fatma Basak
    Akin, Huseyin Levent
    APPLIED SCIENCES-BASEL, 2023, 13 (03):
  • [38] Multi-objective synthesis planning by means of Monte Carlo Tree search
    Lai, Helen
    Kannas, Christos
    Hassen, Alan Kai
    Granqvist, Emma
    Westerlund, Annie M.
    Clevert, Djork-Arne
    Preuss, Mike
    Genheden, Samuel
    ARTIFICIAL INTELLIGENCE IN THE LIFE SCIENCES, 2025, 7
  • [39] SpecMCTS: Accelerating Monte Carlo Tree Search Using Speculative Tree Traversal
    Kim, Juhwan
    Kang, Byeongmin
    Cho, Hyungmin
    IEEE ACCESS, 2021, 9 : 142195 - 142205
  • [40] Multi-Horizon Multi-Agent Planning Using Decentralised Monte Carlo Tree Search
    Seiler, Konstantin M.
    Kong, Felix H.
    Fitch, Robert
    IEEE ROBOTICS AND AUTOMATION LETTERS, 2024, 9 (09): : 7715 - 7722