default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJingjin Yu
Person information
Other persons with a similar name
SPARQL queries 
🛈 Please note that only 67% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j24]Xin Liu
, Xuebo Zhang, Shiyong Zhang, Mingxing Yuan, Jingjin Yu:
Manipulability-Augmented Next-Best-Configuration Exploration Planner for High-DoF Manipulators. IEEE Robotics Autom. Lett. 9(5): 4265-4272 (2024)- [c72]Marcus Gozon, Jingjin Yu:
On Computing Makespan-Optimal Solutions for Generalized Sliding-Tile Puzzles. AAAI 2024: 10288-10296 - [c71]Teng Guo, Jingjin Yu:
Decentralized Lifelong Path Planning for Multiple Ackerman Car-Like Robots. ICRA 2024: 7041-7047 - [c70]Baichuan Huang, Xujia Zhang, Jingjin Yu:
Toward Optimal Tabletop Rearrangement with Multiple Manipulation Primitives. ICRA 2024: 10860-10866 - [c69]Teng Guo, Jingjin Yu:
Well-Connected Set and Its Application to Multi-Robot Path Planning. ICRA 2024: 16560-16566 - [i77]Teng Guo, Jingjin Yu:
Well-Connected Set and Its Application to Multi-Robot Path Planning. CoRR abs/2402.11766 (2024) - [i76]Teng Guo, Jingjin Yu:
Decentralized Lifelong Path Planning for Multiple Ackerman Car-Like Robots. CoRR abs/2402.11767 (2024) - [i75]Teng Guo, Jingjin Yu:
Targeted Parallelization of Conflict-Based Search for Multi-Robot Path Planning. CoRR abs/2402.11768 (2024) - [i74]Kai Gao, Zihe Ye, Duo Zhang, Baichuan Huang, Jingjin Yu:
Toward Holistic Planning and Control Optimization for Dual-Arm Rearrangement. CoRR abs/2404.06758 (2024) - [i73]Teng Guo, Jingjin Yu:
Expected 1.x-Makespan-Optimal MAPF on Grids in Low-Poly Time. CoRR abs/2408.05385 (2024) - [i72]Duo Zhang, Zihe Ye, Jingjin Yu:
Asymptotically-Optimal Multi-Query Path Planning for a Polygonal Robot. CoRR abs/2409.03920 (2024) - [i71]Marcus Gozon, Jingjin Yu:
Optimally Solving Colored Generalized Sliding-Tile Puzzles: Complexity and Bounds. CoRR abs/2410.14947 (2024) - 2023
- [j23]Mario Szegedy, Jingjin Yu:
An Initial Study of Budgeted Steiner Networks. Comput. Geom. Topol. 2(2): 4:1-4:13 (2023) - [j22]Jingjin Yu, Ming C. Lin:
Selected papers from WAFR2020. Int. J. Robotics Res. 42(6): 315-316 (2023) - [j21]Mario Szegedy, Jingjin Yu:
Rubik Tables and object rearrangement. Int. J. Robotics Res. 42(6): 459-472 (2023) - [j20]Kai Gao, Si Wei Feng, Baichuan Huang, Jingjin Yu:
Minimizing running buffers for tabletop object rearrangement: Complexity, fast algorithms, and applications. Int. J. Robotics Res. 42(10): 755-776 (2023) - [j19]Jingjin Yu:
Rearrangement on lattices with pick-n-swaps: Optimality structures and efficient algorithms. Int. J. Robotics Res. 42(10): 957-973 (2023) - [j18]Zherong Pan, Andy Zeng, Yunzhu Li, Jingjin Yu, Kris Hauser:
Algorithms and Systems for Manipulating Multiple Objects. IEEE Trans. Robotics 39(1): 2-20 (2023) - [c68]Teng Guo, Jingjin Yu:
Toward Efficient Physical and Algorithmic Design of Automated Garages. ICRA 2023: 1364-1370 - [c67]Si Wei Feng, Teng Guo, Jingjin Yu:
Optimal Allocation of Many Robot Guards for Sweep-Line Coverage. ICRA 2023: 3614-3620 - [c66]Kai Gao, Jingjin Yu:
On the Utility of Buffers in Pick-n-Swap Based Lattice Rearrangement. ICRA 2023: 5786-5792 - [c65]Wenjin Zhang, Xiao Zang, Lingyi Huang, Yang Sui, Jingjin Yu, Yingying Chen, Bo Yuan:
DynGMP: Graph Neural Network-Based Motion Planning in Unpredictable Dynamic Environments. IROS 2023: 858-865 - [c64]Kai Gao, Justin Yu, Tanay Sandeep Punjabi, Jingjin Yu:
Effectively Rearranging Heterogeneous Objects on Cluttered Tabletops. IROS 2023: 2057-2064 - [c63]Andy Xu, Kai Gao, Si Wei Feng, Jingjin Yu:
Optimal and Stable Multi-Layer Object Rearrangement on a Tabletop. IROS 2023: 2078-2085 - [c62]Baichuan Huang, Jingjin Yu, Siddarth Jain:
EARL: Eye-on-Hand Reinforcement Learner for Dynamic Grasping with Active Pose Estimation. IROS 2023: 2963-2970 - [c61]Teng Guo, Jingjin Yu:
Efficient Heuristics for Multi-Robot Path Planning in Crowded Environments. IROS 2023: 6749-6756 - [e2]Kostas E. Bekris, Kris Hauser, Sylvia L. Herbert, Jingjin Yu:
Robotics: Science and Systems XIX, Daegu, Republic of Korea, July 10-14, 2023. 2023, ISBN 978-0-9923747-9-2 [contents] - [i70]Teng Guo, Jingjin Yu:
Toward Efficient Physical and Algorithmic Design of Automated Garages. CoRR abs/2302.01305 (2023) - [i69]Si Wei Feng, Teng Guo, Jingjin Yu:
Optimal Allocation of Many Robot Guards for Sweep-Line Coverage. CoRR abs/2302.04319 (2023) - [i68]Si Wei Feng, Jingjin Yu:
Efficient Algorithms for Boundary Defense with Heterogeneous Defenders. CoRR abs/2302.09706 (2023) - [i67]Kai Gao, Si Wei Feng, Baichuan Huang, Jingjin Yu:
Minimizing Running Buffers for Tabletop Object Rearrangement: Complexity, Fast Algorithms, and Applications. CoRR abs/2304.01764 (2023) - [i66]Kai Gao, Justin Yu, Tanay Sandeep Punjabi, Jingjin Yu:
Effectively Rearranging Heterogeneous Objects on Cluttered Tabletops. CoRR abs/2306.14240 (2023) - [i65]Andy Xu, Kai Gao, Si Wei Feng, Jingjin Yu:
Optimal and Stable Multi-Layer Object Rearrangement on a Tabletop. CoRR abs/2306.14251 (2023) - [i64]Teng Guo, Jingjin Yu:
Efficient Heuristics for Multi-Robot Path Planning in Crowded Environments. CoRR abs/2306.14409 (2023) - [i63]Kai Gao, Yan Ding, Shiqi Zhang, Jingjin Yu:
ORLA*: Mobile Manipulator-Based Object Rearrangement with Lazy A. CoRR abs/2309.13707 (2023) - [i62]Baichuan Huang, Xujia Zhang, Jingjin Yu:
Toward Optimal Tabletop Rearrangement with Multiple Manipulation Primitives. CoRR abs/2310.00167 (2023) - [i61]Baichuan Huang, Jingjin Yu, Siddarth Jain:
EARL: Eye-on-Hand Reinforcement Learner for Dynamic Grasping with Active Pose Estimation. CoRR abs/2310.06751 (2023) - [i60]Teng Guo, Jingjin Yu:
Bin Assignment and Decentralized Path Planning for Multi-Robot Parcel Sorting. CoRR abs/2310.17753 (2023) - [i59]Marcus Gozon, Jingjin Yu:
On Computing Makespan-Optimal Solutions for Generalized Sliding-Tile Puzzles. CoRR abs/2312.10887 (2023) - 2022
- [j17]Baichuan Huang, Shuai D. Han, Jingjin Yu, Abdeslam Boularias:
Visual Foresight Trees for Object Retrieval From Clutter With Nonprehensile Rearrangement. IEEE Robotics Autom. Lett. 7(1): 231-238 (2022) - [c60]Rui Wang, Kai Gao, Jingjin Yu, Kostas E. Bekris:
Lazy Rearrangement Planning in Confined Spaces. ICAPS 2022: 385-393 - [c59]Teng Guo, Si Wei Feng, Mario Szegedy, Jingjin Yu:
Rubik Tables, Stack Rearrangement, and Multi-Robot Path Planning. Allerton 2022: 1-4 - [c58]Jingjin Yu, Mario Szegedy:
Budgeted Steiner Networks: Three Terminals with Equal Path Weights. CCCG 2022: 322-329 - [c57]Baichuan Huang, Teng Guo, Abdeslam Boularias, Jingjin Yu:
Interleaving Monte Carlo Tree Search and Self-Supervised Learning for Object Retrieval in Clutter. ICRA 2022: 625-632 - [c56]Ewerton R. Vieira, Daniel Nakhimovich, Kai Gao, Rui Wang, Jingjin Yu, Kostas E. Bekris:
Persistent Homology for Effective Non-Prehensile Manipulation. ICRA 2022: 1918-1924 - [c55]Kai Gao, Darren Lau, Baichuan Huang, Kostas E. Bekris, Jingjin Yu:
Fast High-Quality Tabletop Rearrangement in Bounded Workspace. ICRA 2022: 1961-1967 - [c54]Yuhan Zhao, Baichuan Huang, Jingjin Yu, Quanyan Zhu:
Stackelberg Strategic Guidance for Heterogeneous Robots Collaboration. ICRA 2022: 4922-4928 - [c53]Si Wei Feng, Jingjin Yu:
Barrier Forming: Separating Polygonal Sets with Minimum Number of Lines. ICRA 2022: 5828-5834 - [c52]Shuai D. Han, Jingjin Yu:
Optimizing Space Utilization for More Effective Multi-Robot Path Planning. ICRA 2022: 10709-10715 - [c51]Baichuan Huang, Abdeslam Boularias, Jingjin Yu:
Parallel Monte Carlo Tree Search with Batched Rigid-body Simulations for Speeding up Long-Horizon Episodic Robot Planning. IROS 2022: 1153-1160 - [c50]Teng Guo, Si Wei Feng, Jingjin Yu:
Polynomial Time Near-Time-Optimal Multi-Robot Path Planning in Three Dimensions with Applications to Large-Scale UAV Coordination. IROS 2022: 10074-10080 - [c49]Kai Gao, Jingjin Yu:
Toward Efficient Task Planning for Dual-Arm Tabletop Object Rearrangement. IROS 2022: 10425-10431 - [c48]Xiao Zang, Miao Yin, Lingyi Huang, Jingjin Yu, Saman A. Zonouz, Bo Yuan:
Robot Motion Planning as Video Prediction: A Spatio-Temporal Neural Network-based Motion Planner. IROS 2022: 12492-12499 - [c47]Teng Guo, Jingjin Yu:
Sub-1.5 Time-Optimal Multi-Robot Path Planning on Grids in Polynomial Time. Robotics: Science and Systems 2022 - [i58]Teng Guo, Jingjin Yu:
Sub-1.5 Time-Optimal Multi-Robot Path Planning on Grids in Polynomial Time. CoRR abs/2201.08976 (2022) - [i57]Mario Szegedy, Jingjin Yu:
Budgeted Steiner Networks: Three Terminals with Equal Path Weights. CoRR abs/2201.11602 (2022) - [i56]Baichuan Huang, Teng Guo, Abdeslam Boularias, Jingjin Yu:
Self-Supervised Monte Carlo Tree Search Learning for Object Retrieval in Clutter. CoRR abs/2202.01426 (2022) - [i55]Yuhan Zhao, Baichuan Huang, Jingjin Yu, Quanyan Zhu:
Stackelberg Strategic Guidance for Heterogeneous Robots Collaboration. CoRR abs/2202.01877 (2022) - [i54]Ewerton R. Vieira, Daniel Nakhimovich, Kai Gao, Rui Wang, Jingjin Yu, Kostas E. Bekris:
Persistent Homology for Effective Non-Prehensile Manipulation. CoRR abs/2202.02937 (2022) - [i53]Rui Wang, Kai Gao, Jingjin Yu, Kostas E. Bekris:
Lazy Rearrangement Planning in Confined Spaces. CoRR abs/2203.10379 (2022) - [i52]Teng Guo, Siwei Feng, Jingjin Yu:
Polynomial Time Near-Time-Optimal Multi-Robot Path Planning in Three Dimensions with Applications to Large-Scale UAV Coordination. CoRR abs/2207.02735 (2022) - [i51]Baichuan Huang, Abdeslam Boularias, Jingjin Yu:
Parallel Monte Carlo Tree Search with Batched Rigid-body Simulations for Speeding up Long-Horizon Episodic Robot Planning. CoRR abs/2207.06649 (2022) - [i50]Kai Gao, Jingjin Yu:
Toward Efficient Task Planning for Dual-Arm Tabletop Object Rearrangement. CoRR abs/2207.08078 (2022) - [i49]Xiao Zang, Miao Yin, Lingyi Huang, Jingjin Yu, Saman A. Zonouz, Bo Yuan:
Robot Motion Planning as Video Prediction: A Spatio-Temporal Neural Network-based Motion Planner. CoRR abs/2208.11287 (2022) - [i48]Kai Gao, Jingjin Yu:
On the Utility of Buffers in Pick-n-Swap Based Lattice Rearrangement. CoRR abs/2209.05390 (2022) - [i47]Ewerton R. Vieira, Kai Gao, Daniel Nakhimovich, Kostas E. Bekris, Jingjin Yu:
Persistent Homology Guided Monte-Carlo Tree Search for Effective Non-Prehensile Manipulation. CoRR abs/2210.01283 (2022) - 2021
- [j16]Si Wei Feng, Teng Guo, Kostas E. Bekris, Jingjin Yu:
Team RuBot's experiences and lessons from the ARIAC. Robotics Comput. Integr. Manuf. 70: 102126 (2021) - [j15]Rahul Shome, Kiril Solovey, Jingjin Yu, Kostas E. Bekris, Dan Halperin:
Fast, High-Quality Two-Arm Rearrangement in Synchronous, Monotone Tabletop Setups. IEEE Trans Autom. Sci. Eng. 18(3): 888-901 (2021) - [c46]Shuai D. Han, Baichuan Huang, Sijie Ding, Changkyu Song, Si Wei Feng, Ming Xu, Hao Lin, Qingze Zou, Abdeslam Boularias, Jingjin Yu:
Toward Fully Automated Metal Recycling using Computer Vision and Non-Prehensile Manipulation. CASE 2021: 891-898 - [c45]Baichuan Huang, Shuai D. Han, Abdeslam Boularias, Jingjin Yu:
DIPN: Deep Interaction Prediction Network with Application to Clutter Removal. ICRA 2021: 4694-4701 - [c44]Rui Wang, Kai Gao, Daniel Nakhimovich, Jingjin Yu, Kostas E. Bekris:
Uniform Object Rearrangement: From Complete Monotone Primitives to Efficient Non-Monotone Informed Search. ICRA 2021: 6621-6627 - [c43]Teng Guo, Shuai D. Han, Jingjin Yu:
Spatial and Temporal Splitting Heuristics for Multi-Robot Motion Planning. ICRA 2021: 8009-8015 - [c42]Si Wei Feng, Kai Gao, Jie Gong, Jingjin Yu:
Sensor Placement for Globally Optimal Coverage of 3D-Embedded Surfaces. ICRA 2021: 8600-8606 - [c41]Kai Gao, Jingjin Yu:
Capacitated Vehicle Routing with Target Geometric Constraints. IROS 2021: 7925-7930 - [c40]Kai Gao, Siwei Feng, Jingjin Yu:
On Minimizing the Number of Running Buffers for Tabletop Rearrangement. Robotics: Science and Systems 2021 - [c39]Jingjin Yu:
Rearrangement on Lattices with Swaps: Optimality Structures and Efficient Algorithms. Robotics: Science and Systems 2021 - [c38]Mario Szegedy, Jingjin Yu:
On Rearrangement of Items Stored in Stacks. WAFR 2021: 518-533 - [e1]Steven M. LaValle, Ming Lin, Timo Ojala, Dylan A. Shell, Jingjin Yu:
Algorithmic Foundations of Robotics XIV, Proceedings of the Fourteenth Workshop on the Algorithmic Foundations of Robotics, WAFR 2021, Oulu, Finland, June 21-23, 2021. Springer Proceedings in Advanced Robotics 17, Springer 2021, ISBN 978-3-030-66722-1 [contents] - [i46]Rui Wang, Kai Gao, Daniel Nakhimovich, Jingjin Yu, Kostas E. Bekris:
Uniform Object Rearrangement: From Complete Monotone Primitives to Efficient Non-Monotone Informed Search. CoRR abs/2101.12241 (2021) - [i45]Si Wei Feng, Kai Gao, Jie Gong, Jingjin Yu:
Sensor Placement for Globally Optimal Coverage of 3D-Embedded Surfaces. CoRR abs/2103.10521 (2021) - [i44]Teng Guo, Shuai D. Han, Jingjin Yu:
Spatial and Temporal Splitting Heuristics for Multi-Robot Motion Planning. CoRR abs/2103.14111 (2021) - [i43]Baichuan Huang, Shuai D. Han, Jingjin Yu, Abdeslam Boularias:
Visual Foresight Tree for Object Retrieval from Clutter with Nonprehensile Rearrangement. CoRR abs/2105.02857 (2021) - [i42]Jingjin Yu:
Rearrangement on Lattices with Pick-n-Swaps: Optimality Structures and Efficient Algorithms. CoRR abs/2105.05366 (2021) - [i41]Kai Gao, Si Wei Feng, Jingjin Yu:
On Minimizing the Number of Running Buffers for Tabletop Rearrangement. CoRR abs/2105.06357 (2021) - [i40]Kai Gao, Jingjin Yu:
Capacitated Vehicle Routing with Target Geometric Constraints. CoRR abs/2107.10382 (2021) - [i39]Shuai D. Han, Jingjin Yu:
Optimizing Space Utilization for More Effective Multi-Robot Path Planning. CoRR abs/2109.04677 (2021) - [i38]Kai Gao, Darren Lau, Baichuan Huang, Kostas E. Bekris, Jingjin Yu:
Fast High-Quality Tabletop Rearrangement in Bounded Workspace. CoRR abs/2110.12325 (2021) - [i37]Si Wei Feng, Jingjin Yu:
Barrier Forming: Separating Polygonal Sets with Minimum Number of Lines. CoRR abs/2111.09151 (2021) - 2020
- [j14]Jingjin Yu:
Average case constant factor time and distance optimal multi-robot path planning in well-connected environments. Auton. Robots 44(3-4): 469-483 (2020) - [j13]Si Wei Feng, Jingjin Yu:
Optimal Perimeter Guarding With Heterogeneous Robot Teams: Complexity Analysis and Effective Algorithms. IEEE Robotics Autom. Lett. 5(2): 430-437 (2020) - [j12]Shuai D. Han, Si Wei Feng, Jingjin Yu:
Toward Fast and Optimal Robotic Pick-and-Place on a Moving Conveyor. IEEE Robotics Autom. Lett. 5(2): 446-453 (2020) - [j11]Shuai D. Han, Jingjin Yu:
DDM: Fast Near-Optimal Multi-Robot Path Planning Using Diversified-Path and Optimal Sub-Problem Solution Database Heuristics. IEEE Robotics Autom. Lett. 5(2): 1350-1357 (2020) - [c37]Georg von Zengen, Jingjin Yu, Lars C. Wolf:
Adaptive Real-Time Scheduling for Cooperative Cyber-Physical Systems. ICPS 2020: 79-86 - [c36]Wei N. Tang, Shuai D. Han, Jingjin Yu:
Computing High-Quality Clutter Removal Solutions for Multiple Robots. IROS 2020: 7963-7970 - [c35]Siwei Feng, Jingjin Yu:
Optimally Guarding Perimeters and Regions with Mobile Range Sensors. Robotics: Science and Systems 2020 - [i36]Mario Szegedy, Jingjin Yu:
On Rearrangement of Items Stored in Stacks. CoRR abs/2002.04979 (2020) - [i35]Georg von Zengen, Jingjin Yu, Lars C. Wolf:
Adaptive Real-Time Scheduling for Cooperative Cyber-Physical Systems. CoRR abs/2002.07535 (2020) - [i34]Si Wei Feng, Jingjin Yu:
Optimally Guarding Perimeters and Regions with Mobile Range Sensors. CoRR abs/2002.08477 (2020) - [i33]Wei N. Tang, Shuai D. Han, Jingjin Yu:
Computing High-Quality Clutter Removal Solutions for Multiple Robots. CoRR abs/2007.04856 (2020) - [i32]Baichuan Huang, Shuai D. Han, Abdeslam Boularias, Jingjin Yu:
DIPN: Deep Interaction Prediction Network with Application to Clutter Removal. CoRR abs/2011.04692 (2020)
2010 – 2019
- 2019
- [c34]Rahul Shome, Wei N. Tang, Changkyu Song, Chaitanya Mitash, Hristiyan Kourtev, Jingjin Yu, Abdeslam Boularias, Kostas E. Bekris:
Towards Robust Product Packing with a Minimalistic End-Effector. ICRA 2019: 9007-9013 - [c33]Shuai D. Han, Jingjin Yu:
Integer Programming as a General Solution Methodology for Path-Based Optimization in Robotics: Principles, Best Practices, and Applications. IROS 2019: 1890-1897 - [c32]Wei N. Tang, Jingjin Yu:
Taming Combinatorial Challenges in Clutter Removal. ISRR 2019: 291-310 - [c31]Shuai D. Han, Jingjin Yu:
Effective Heuristics for Multi-Robot Path Planning in Warehouse Environments. MRS 2019: 10-12 - [c30]Si Wei Feng, Shuai D. Han, Jingjin Yu:
Efficient Algorithms for Optimal Perimeter Guarding. Robotics: Science and Systems 2019 - [i31]Shuai D. Han, Jingjin Yu:
Integer Programming as a General Solution Methodology for Path-Based Optimization in Robotics: Principles and Best Practices. CoRR abs/1902.02652 (2019) - [i30]Rahul Shome, Wei N. Tang, Changkyu Song, Chaitanya Mitash, Hristiyan Kourtev, Jingjin Yu, Abdeslam Boularias, Kostas E. Bekris:
Towards Robust Product Packing with a Minimalistic End-Effector. CoRR abs/1903.00984 (2019) - [i29]Shuai D. Han, Jingjin Yu:
DDM*: Fast Near-Optimal Multi-Robot Path Planning using Diversified-Path and Optimal Sub-Problem Solution Database Heuristics. CoRR abs/1904.02598 (2019) - [i28]Si Wei Feng, Shuai D. Han, Kai Gao, Jingjin Yu:
Efficient Algorithms for Optimal Perimeter Guarding. CoRR abs/1905.04434 (2019) - [i27]Wei N. Tang, Jingjin Yu:
Taming Combinatorial Challenges in Optimal Clutter Removal Tasks. CoRR abs/1905.13530 (2019) - [i26]Shuai D. Han, Si Wei Feng, Jingjin Yu:
Toward Fast and Optimal Robotic Pick-and-Place on a Moving Conveyor. CoRR abs/1912.08009 (2019) - [i25]Si Wei Feng, Jingjin Yu:
Optimal Perimeter Guarding with Heterogeneous Robot Teams: Complexity Analysis and Effective Algorithms. CoRR abs/1912.08591 (2019) - 2018
- [j10]Shuai D. Han, Nicholas M. Stiffler, Athanasios Krontiris, Kostas E. Bekris, Jingjin Yu:
Complexity Results and Fast Methods for Optimal Tabletop Rearrangement with Overhand Grasps. Int. J. Robotics Res. 37(13-14) (2018) - [j9]Shuai D. Han, Nicholas M. Stiffler, Kostas E. Bekris, Jingjin Yu:
Efficient, High-Quality Stack Rearrangement. IEEE Robotics Autom. Lett. 3(3): 1608-1615 (2018) - [c29]Shuai D. Han, Edgar J. Rodriguez, Jingjin Yu:
SEAR: A Polynomial- Time Multi-Robot Path Planning Algorithm with Expected Constant-Factor Optimality Guarantee. IROS 2018: 1-9 - [c28]Jingjin Yu:
Constant Factor Time Optimal Multi-Robot Routing on High-Dimensional Grids. Robotics: Science and Systems 2018 - [c27]Rahul Shome, Kiril Solovey, Jingjin Yu, Kostas E. Bekris, Dan Halperin:
Fast, High-Quality Dual-Arm Rearrangement in Synchronous, Monotone Tabletop Setups. WAFR 2018: 778-795 - [c26]Rupesh Chinta, Shuai D. Han, Jingjin Yu:
Coordinating the Motion of Labeled Discs with Optimality Guarantees under Extreme Density. WAFR 2018: 817-834 - [i24]Jingjin Yu:
Constant Factor Time Optimal Multi-Robot Routing on High-Dimensional Grids in Mostly Sub-Quadratic Time. CoRR abs/1801.10465 (2018) - [i23]Rupesh Chinta, Shuai D. Han, Jingjin Yu:
Coordinating the Motion of Labeled Discs with Optimality Guarantees under Extreme Density. CoRR abs/1807.03347 (2018) - [i22]Rahul Shome, Kiril Solovey, Jingjin Yu, Kostas E. Bekris, Dan Halperin:
Fast, High-Quality Dual-Arm Rearrangement in Synchronous, Monotone Tabletop Setups. CoRR abs/1810.12202 (2018) - 2017
- [c25]Jingjin Yu, Shuai D. Han, Wei N. Tang, Daniela Rus:
A portable, 3D-printing enabled multi-vehicle platform for robotics research and education. ICRA 2017: 1475-1480 - [c24]Jingjin Yu:
Expected constant-factor optimal multi-robot path planning in well-connected environments. MRS 2017: 48-55 - [c23]Shuai D. Han, Nicholas M. Stiffler, Athanasios Krontiris, Kostas E. Bekris, Jingjin Yu:
High-Quality Tabletop Rearrangement with Overhand Grasps: Hardness Results and Fast Methods. Robotics: Science and Systems 2017 - [i21]Shuai D. Han, Nicholas M. Stiffler, Athanasios Krontiris, Kostas E. Bekris, Jingjin Yu:
High-Quality Tabletop Rearrangement with Overhand Grasps: Hardness Results and Fast Methods. CoRR abs/1705.09180 (2017) - [i20]Jingjin Yu:
Constant Factor Optimal Multi-Robot Path Planning in Well-Connected Environments. CoRR abs/1706.07255 (2017) - [i19]Shuai D. Han, Nicholas M. Stiffler, Kostas E. Bekris, Jingjin Yu:
Efficient, High-Quality Stack Rearrangement. CoRR abs/1706.09949 (2017) - [i18]Shuai D. Han, Edgar J. Rodriguez, Jingjin Yu:
SEAR: A Polynomial-Time Expected Constant-Factor Optimal Algorithmic Framework for Multi-Robot Path Planning. CoRR abs/1709.08215 (2017) - [i17]Shuai D. Han, Nicholas M. Stiffler, Athanasios Krontiris, Kostas E. Bekris, Jingjin Yu:
Complexity Results and Fast Methods for Optimal Tabletop Rearrangement with Overhand Grasps. CoRR abs/1711.07369 (2017) - 2016
- [j8]Jingjin Yu:
Intractability of Optimal Multirobot Path Planning on Planar Graphs. IEEE Robotics Autom. Lett. 1(1): 33-40 (2016) - [j7]Jingjin Yu, Mac Schwager, Daniela Rus:
Correlated Orienteering Problem and its Application to Persistent Monitoring Tasks. IEEE Trans. Robotics 32(5): 1106-1118 (2016) - [j6]Jingjin Yu, Steven M. LaValle:
Optimal Multirobot Path Planning on Graphs: Complete Algorithms and Effective Heuristics. IEEE Trans. Robotics 32(5): 1163-1177 (2016) - [i16]Jingjin Yu, Shuai D. Han, Daniela Rus:
A Portable, 3D-Printing Enabled Multi-Vehicle Platform for Robotics Research and Education. CoRR abs/1609.04745 (2016) - 2015
- [j5]Jingjin Yu, Soon-Jo Chung, Petros G. Voulgaris:
Target Assignment in Robotic Networks: Distance Optimality Guarantees and Hierarchical Strategies. IEEE Trans. Autom. Control. 60(2): 327-341 (2015) - [j4]Jingjin Yu, Sertac Karaman, Daniela Rus:
Persistent Monitoring of Events With Stochastic Arrivals at Multiple Stations. IEEE Trans. Robotics 31(3): 521-535 (2015) - [c22]Jingjin Yu, Javed A. Aslam, Sertac Karaman, Daniela Rus:
Anytime planning of optimal schedules for a mobile sensing robot. IROS 2015: 5279-5286 - [c21]Jingjin Yu, Daniela Rus:
An Effective Algorithmic Framework for Near Optimal Multi-robot Path Planning. ISRR (1) 2015: 495-511 - [c20]Kiril Solovey, Jingjin Yu, Or Zamir, Dan Halperin:
Motion Planning for Unlabeled Discs with Optimality Guarantees. Robotics: Science and Systems 2015 - [i15]Jingjin Yu:
Intractability of Optimal Multi-Robot Path Planning on Planar Graphs. CoRR abs/1504.02072 (2015) - [i14]Kiril Solovey, Jingjin Yu, Or Zamir, Dan Halperin:
Motion Planning for Unlabeled Discs with Optimality Guarantees. CoRR abs/1504.05218 (2015) - [i13]Jingjin Yu, Daniela Rus:
An Effective Algorithmic Framework for Near Optimal Multi-Robot Path Planning. CoRR abs/1505.00200 (2015) - [i12]Jingjin Yu, Steven M. LaValle:
Optimal Multi-Robot Path Planning on Graphs: Structure and Computational Complexity. CoRR abs/1507.03289 (2015) - [i11]Jingjin Yu, Steven M. LaValle:
Optimal Multi-Robot Path Planning on Graphs: Complete Algorithms and Effective Heuristics. CoRR abs/1507.03290 (2015) - 2014
- [c19]Jingjin Yu, Soon-Jo Chung, Petros G. Voulgaris:
Distance optimal target assignment in robotic networks under communication and sensing constraints. ICRA 2014: 1098-1105 - [c18]Jingjin Yu, Sertac Karaman, Daniela Rus:
Persistent monitoring of events with stochastic arrivals at multiple stations. ICRA 2014: 5758-5765 - [c17]Jingjin Yu, Mac Schwager, Daniela Rus:
Correlated Orienteering Problem and its application to informative path planning for persistent monitoring tasks. IROS 2014: 342-349 - [c16]Jingjin Yu, Soon-Jo Chung, Petros G. Voulgaris:
Traveled distance minimization and hierarchical strategies for robotic networks. ISCCSP 2014: 491-496 - [c15]Jingjin Yu, Daniela Rus:
Pebble Motion on Graphs with Rotations: Efficient Feasibility Tests and Planning Algorithms. WAFR 2014: 729-746 - [i10]Jingjin Yu, Mac Schwager, Daniela Rus:
Correlated Orienteering Problem and its Application to Informative Path Planning for Persistent Monitoring Tasks. CoRR abs/1402.1896 (2014) - [i9]Jingjin Yu, Javed A. Aslam, Sertac Karaman, Daniela Rus:
Optimal Tourist Problem and Anytime Planning of Trip Itineraries. CoRR abs/1409.8536 (2014) - 2013
- [b1]Jingjin Yu:
Combinatorial structures and filter design in information spaces. University of Illinois Urbana-Champaign, USA, 2013 - [j3]Lawrence H. Erickson, Jingjin Yu, Yaonan Huang, Steven M. LaValle:
Counting Moving Bodies Using Sparse Sensor Beams. IEEE Trans Autom. Sci. Eng. 10(4): 853-861 (2013) - [c14]Jingjin Yu, Steven M. LaValle:
Structure and Intractability of Optimal Multi-Robot Path Planning on Graphs. AAAI 2013: 1443-1449 - [c13]Jingjin Yu, Steven M. LaValle:
Fast, Near-Optimal Computation for Multi-Robot Path Planning on Graphs. AAAI (Late-Breaking Developments) 2013 - [c12]Jingjin Yu, Steven M. LaValle:
Shortest path set induced vertex ordering and its application to distributed distance optimal formation path planning and control on graphs. CDC 2013: 2775-2780 - [c11]Max Katsev, Jingjin Yu, Steven M. LaValle:
Efficient formation path planning on large graphs. ICRA 2013: 3606-3611 - [c10]Jingjin Yu, Steven M. LaValle:
Planning optimal paths for multiple robots on graphs. ICRA 2013: 3612-3617 - [i8]Jingjin Yu:
A Linear Time Algorithm for the Feasibility of Pebble Motion on Graphs. CoRR abs/1301.2342 (2013) - [i7]Jingjin Yu, Soon-Jo Chung, Petros G. Voulgaris:
Target Assignment in Robotic Networks: Distance Optimality Guarantees and Hierarchical Strategies. CoRR abs/1308.3956 (2013) - [i6]Jingjin Yu, Sertac Karaman, Daniela Rus:
Persistent Monitoring of Events with Stochastic Arrivals at Multiple Stations. CoRR abs/1309.6041 (2013) - 2012
- [j2]Jingjin Yu, Steven M. LaValle, Daniel Liberzon:
Rendezvous Without Coordinates. IEEE Trans. Autom. Control. 57(2): 421-434 (2012) - [j1]Jingjin Yu, Steven M. LaValle:
Shadow Information Spaces: Combinatorial Filters for Tracking Targets. IEEE Trans. Robotics 28(2): 440-456 (2012) - [c9]Jingjin Yu, Steven M. LaValle:
Time Optimal Multi-Agent Path Planning on Graphs. MAPF@AAAI 2012 - [c8]Jingjin Yu, Steven M. LaValle:
Distance optimal formation control on graphs with a tight convergence time guarantee. CDC 2012: 4023-4028 - [c7]Jingjin Yu, Steven M. LaValle:
Multi-agent Path Planning and Network Flow. WAFR 2012: 157-173 - [c6]Lawrence H. Erickson, Jingjin Yu, Yaonan Huang, Steven M. LaValle:
Counting Moving Bodies Using Sparse Sensor Beams. WAFR 2012: 427-442 - [i5]Jingjin Yu, Steven M. LaValle:
Distance Optimal Formation Control on Graphs with a Tight Convergence Time Guarantee. CoRR abs/1204.3820 (2012) - [i4]Jingjin Yu, Steven M. LaValle:
Planning Optimal Paths for Multi-agent Systems on Graphs. CoRR abs/1204.3830 (2012) - [i3]Jingjin Yu, Steven M. LaValle:
Multi-agent Path Planning and Network Flow. CoRR abs/1204.5717 (2012) - [i2]Jingjin Yu:
Shortest Path Induced Vertex Ordering and its Application to Multi-agent Formation Path Planning. CoRR abs/1205.0207 (2012) - [i1]Jingjin Yu:
Diameters of Permutation Groups on Graphs, Multi-agent Path Planning, and Integer Multiflow on Directed Acyclic Graphs. CoRR abs/1205.5263 (2012) - 2011
- [c5]Jingjin Yu, Steven M. LaValle:
Story validation and approximate path inference with a sparse network of heterogeneous sensors. ICRA 2011: 4980-4985 - 2010
- [c4]Jingjin Yu, Steven M. LaValle:
Probabilistic shadow information spaces. ICRA 2010: 3543-3549 - [c3]Jingjin Yu, Steven M. LaValle:
Cyber Detectives: Determining When Robots or People Misbehave. WAFR 2010: 391-407
2000 – 2009
- 2008
- [c2]Jingjin Yu, Steven M. LaValle, Daniel Liberzon:
Rendezvous without coordinates. CDC 2008: 1803-1808 - [c1]Jingjin Yu, Steven M. LaValle:
Tracking hidden agents through shadow information spaces. ICRA 2008: 2331-2338
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-28 20:27 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
