Jingjin Yu
Rutgers University
収録論文 85本 ・ フィジカルAI/ロボット学習
群制御
※arXiv著者名で収集。同姓同名の別人の論文が含まれる場合があります。
論文
- 最大容量でのマルチロボット順序付き保管・取り出しのための完全かつスケーラブルで堅牢な優先度付き計画群制御2026/8/7
高密度倉庫におけるパズルベース保管システムで、複数ロボットのデッドロックを回避しつつ、順序付きの保管・取り出しを効率的に実行する優先度付き経路計画アルゴリズムを提案した。
- Complete, Scalable, and Robust Prioritized Planning for Multi-Robot Ordered Storage and Retrieval at Maximum Capacity2026/8/1
- Affordance2Action: Task-Conditioned Scene-level Affordance Grounding for Real-Time Manipulation2026/6/1
- Robust Out-of-Order Retrieval for Grid-Based Storage at Maximum Capacity2026/1/1
- High-Performance Dual-Arm Task and Motion Planning for Tabletop Rearrangement2025/12/1
- RGBTrack: Fast, Robust Depth-Free 6D Pose Estimation and Tracking2025/6/1
- KARL: Kalman-Filter Assisted Reinforcement Learner for Dynamic Object Tracking and Grasping2025/6/1
- Monocular One-Shot Metric-Depth Alignment for RGB-Based Robot Grasping2025/6/1
- Fully Packed and Ready to Go: High-Density, Rearrangement-Free, Grid-Based Storage and Retrieval2025/5/1
- PROBE: Proprioceptive Obstacle Detection and Estimation while Navigating in Clutter2025/5/1
- Optimally Solving Colored Generalized Sliding-Tile Puzzles: Complexity and Bounds2024/10/1
- Asymptotically-Optimal Multi-Query Path Planning for a Polygonal Robot2024/9/1
- Expected $1.x$-Makespan-Optimal MAPF on Grids in Low-Poly Time2024/8/1
- Toward Holistic Planning and Control Optimization for Dual-Arm Rearrangement2024/4/1
- Targeted Parallelization of Conflict-Based Search for Multi-Robot Path Planning2024/2/1
- Well-Connected Set and Its Application to Multi-Robot Path Planning2024/2/1
- Decentralized Lifelong Path Planning for Multiple Ackerman Car-Like Robots2024/2/1
- On Computing Makespan-Optimal Solutions for Generalized Sliding-Tile Puzzles2023/12/1
- Bin Assignment and Decentralized Path Planning for Multi-Robot Parcel Sorting2023/10/1
- Toward Optimal Tabletop Rearrangement with Multiple Manipulation Primitives2023/10/1
- EARL: Eye-on-Hand Reinforcement Learner for Dynamic Grasping with Active Pose Estimation2023/10/1
- ORLA*: Mobile Manipulator-Based Object Rearrangement with Lazy A Star2023/9/1
- Optimal and Stable Multi-Layer Object Rearrangement on a Tabletop2023/6/1
- Efficient Heuristics for Multi-Robot Path Planning in Crowded Environments2023/6/1
- Effectively Rearranging Heterogeneous Objects on Cluttered Tabletops2023/6/1
- Minimizing Running Buffers for Tabletop Object Rearrangement: Complexity, Fast Algorithms, and Applications2023/4/1
- Optimal Allocation of Many Robot Guards for Sweep-Line Coverage2023/2/1
- Toward Efficient Physical and Algorithmic Design of Automated Garages2023/2/1
- Efficient Algorithms for Boundary Defense with Heterogeneous Defenders2023/2/1
- Effective and Robust Non-Prehensile Manipulation via Persistent Homology Guided Monte-Carlo Tree Search2022/10/1
- On the Utility of Buffers in Pick-n-Swap Based Lattice Rearrangement2022/9/1
- Robot Motion Planning as Video Prediction: A Spatio-Temporal Neural Network-based Motion Planner2022/8/1
- Parallel Monte Carlo Tree Search with Batched Rigid-body Simulations for Speeding up Long-Horizon Episodic Robot Planning2022/7/1
- Polynomial Time Near-Time-Optimal Multi-Robot Path Planning in Three Dimensions with Applications to Large-Scale UAV Coordination2022/7/1
- Toward Efficient Task Planning for Dual-Arm Tabletop Object Rearrangement2022/7/1
- Lazy Rearrangement Planning in Confined Spaces2022/3/1
- Persistent Homology for Effective Non-Prehensile Manipulation2022/2/1
- Stackelberg Strategic Guidance for Heterogeneous Robots Collaboration2022/2/1
- Interleaving Monte Carlo Tree Search and Self-Supervised Learning for Object Retrieval in Clutter2022/2/1
- Sub-1.5 Time-Optimal Multi-Robot Path Planning on Grids in Polynomial Time2022/1/1
- Barrier Forming: Separating Polygonal Sets with Minimum Number of Lines2021/11/1
- Fast High-Quality Tabletop Rearrangement in Bounded Workspace2021/10/1
- Optimizing Space Utilization for More Effective Multi-Robot Path Planning2021/9/1
- Capacitated Vehicle Routing with Target Geometric Constraints2021/7/1
- Visual Foresight Trees for Object Retrieval from Clutter with Nonprehensile Rearrangement2021/5/1
- On Minimizing the Number of Running Buffers for Tabletop Rearrangement2021/5/1
- Rearrangement on Lattices with Pick-n-Swaps: Optimality Structures and Efficient Algorithms2021/5/1
- Spatial and Temporal Splitting Heuristics for Multi-Robot Motion Planning2021/3/1
- Sensor Placement for Globally Optimal Coverage of 3D-Embedded Surfaces2021/3/1
- Uniform Object Rearrangement: From Complete Monotone Primitives to Efficient Non-Monotone Informed Search2021/1/1
- DIPN: Deep Interaction Prediction Network with Application to Clutter Removal2020/11/1
- Computing High-Quality Clutter Removal Solutions for Multiple Robots2020/7/1
- Rubik Tables and Object Rearrangement2020/2/1
- Optimally Guarding Perimeters and Regions with Mobile Range Sensors2020/2/1
- Optimal Perimeter Guarding with Heterogeneous Robot Teams: Complexity Analysis and Effective Algorithms2019/12/1
- Toward Fast and Optimal Robotic Pick-and-Place on a Moving Conveyor2019/12/1
- Taming Combinatorial Challenges in Optimal Clutter Removal Tasks2019/5/1
- Efficient Algorithms for Optimal Perimeter Guarding2019/5/1
- DDM: Fast Near-Optimal Multi-Robot Path Planning using Diversified-Path and Optimal Sub-Problem Solution Database Heuristics2019/4/1
- Tight Robot Packing in the Real World: A Complete Manipulation Pipeline with Robust Primitives2019/3/1
- Integer Programming as a General Solution Methodology for Path-Based Optimization in Robotics: Principles, Best Practices, and Applications2019/2/1
- Fast, High-Quality Dual-Arm Rearrangement in Synchronous, Monotone Tabletop Setups2018/10/1
- Coordinating the Motion of Labeled Discs with Optimality Guarantees under Extreme Density2018/7/1
- Constant Factor Time Optimal Multi-Robot Routing on High-Dimensional Grids in Mostly Sub-Quadratic Time2018/1/1
- Complexity Results and Fast Methods for Optimal Tabletop Rearrangement with Overhand Grasps2017/11/1
- SEAR: A Polynomial-Time Multi-Robot Path Planning Algorithm with Expected Constant-Factor Optimality Guarantee2017/9/1
- Average Case Constant Factor Time and Distance Optimal Multi-Robot Path Planning in Well-Connected Environments2017/6/1
- Efficient, High-Quality Stack Rearrangement2017/6/1
- High-Quality Tabletop Rearrangement with Overhand Grasps: Hardness Results and Fast Methods2017/5/1
- A Portable, 3D-Printing Enabled Multi-Vehicle Platform for Robotics Research and Education2016/9/1
- Optimal Multi-Robot Path Planning on Graphs: Structure and Computational Complexity2015/7/1
- Optimal Multi-Robot Path Planning on Graphs: Complete Algorithms and Effective Heuristics2015/7/1
- An Effective Algorithmic Framework for Near Optimal Multi-Robot Path Planning2015/5/1
- Intractability of Optimal Multi-Robot Path Planning on Planar Graphs2015/4/1
- Motion Planning for Unlabeled Discs with Optimality Guarantees2015/4/1
- Optimal Tourist Problem and Anytime Planning of Trip Itineraries2014/9/1
- Correlated Orienteering Problem and it Application to Persistent Monitoring Tasks2014/2/1
- Persistent Monitoring of Events with Stochastic Arrivals at Multiple Stations2013/9/1
- Target Assignment in Robotic Networks: Distance Optimality Guarantees and Hierarchical Strategies2013/8/1
- A Linear Time Algorithm for the Feasibility of Pebble Motion on Graphs2013/1/1
- Shortest Path Set Induced Vertex Ordering and its Application to Distributed Distance Optimal Multi-agent Formation Path Planning2012/5/1
- Pebble Motion on Graphs with Rotations: Efficient Feasibility Tests and Planning Algorithms2012/5/1
- Multi-agent Path Planning and Network Flow2012/4/1
- Distance Optimal Formation Control on Graphs with a Tight Convergence Time Guarantee2012/4/1
- Planning Optimal Paths for Multiple Robots on Graphs2012/4/1