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. 1706.09949
  4. Cited By
Efficient, High-Quality Stack Rearrangement

Efficient, High-Quality Stack Rearrangement

29 June 2017
Shuai D. Han
Nicholas M. Stiffler
Kostas E. Bekris
Jingjin Yu
ArXiv (abs)PDFHTML

Papers citing "Efficient, High-Quality Stack Rearrangement"

5 / 5 papers shown
Title
Average Case Constant Factor Time and Distance Optimal Multi-Robot Path
  Planning in Well-Connected Environments
Average Case Constant Factor Time and Distance Optimal Multi-Robot Path Planning in Well-Connected Environments
Jingjin Yu
41
7
0
22 Jun 2017
High-Quality Tabletop Rearrangement with Overhand Grasps: Hardness
  Results and Fast Methods
High-Quality Tabletop Rearrangement with Overhand Grasps: Hardness Results and Fast Methods
Shuai D. Han
Nicholas M. Stiffler
A. Krontiris
Kostas E. Bekris
Jingjin Yu
42
24
0
25 May 2017
Optimal Multi-Robot Path Planning on Graphs: Complete Algorithms and
  Effective Heuristics
Optimal Multi-Robot Path Planning on Graphs: Complete Algorithms and Effective Heuristics
Jingjin Yu
Steven M. Lavalle
57
307
0
12 Jul 2015
Motion Planning for Unlabeled Discs with Optimality Guarantees
Motion Planning for Unlabeled Discs with Optimality Guarantees
Kiril Solovey
Jingjin Yu
Or Zamir
Dan Halperin
33
70
0
20 Apr 2015
Multi-agent Path Planning and Network Flow
Multi-agent Path Planning and Network Flow
Jingjin Yu
Steven M. Lavalle
86
178
0
25 Apr 2012
1