ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1912.07024
  4. Cited By
Multi-Object Rearrangement with Monte Carlo Tree Search:A Case Study on
  Planar Nonprehensile Sorting

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

15 December 2019
Haoran Song
Joshua A. Haustein
Weihao Yuan
Kaiyu Hang
M. Y. Wang
Danica Kragic
J. A. Stork
ArXivPDFHTML

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

2 / 2 papers shown
Title
Object-Centric Kinodynamic Planning for Nonprehensile Robot Rearrangement Manipulation
Object-Centric Kinodynamic Planning for Nonprehensile Robot Rearrangement Manipulation
Kejia Ren
Gaotian Wang
A. S. Morgan
Lydia E. Kavraki
Kaiyu Hang
79
1
0
30 Sep 2024
Learning to Singulate Objects using a Push Proposal Network
Learning to Singulate Objects using a Push Proposal Network
Andreas Eitel
Nico Hauff
Wolfram Burgard
83
83
0
25 Jul 2017
1