Jingjin Yu

CoRR, 2024

Asymptotically-Optimal Multi-Query Path Planning for a Polygonal Robot.

[BibT_eX]

[DOI]

Duo Zhang

Zihe Ye

CoRR, 2024

Expected 1.x-Makespan-Optimal MAPF on Grids in Low-Poly Time.

[BibT_eX]

[DOI]

CoRR, 2024

Toward Holistic Planning and Control Optimization for Dual-Arm Rearrangement.

[BibT_eX]

[DOI]

CoRR, 2024

Targeted Parallelization of Conflict-Based Search for Multi-Robot Path Planning.

[BibT_eX]

[DOI]

CoRR, 2024

Toward Optimal Tabletop Rearrangement with Multiple Manipulation Primitives.

[BibT_eX]

[DOI]

Baichuan Huang

Xujia Zhang

Proceedings of the IEEE International Conference on Robotics and Automation, 2024

Well-Connected Set and Its Application to Multi-Robot Path Planning.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Robotics and Automation, 2024

Decentralized Lifelong Path Planning for Multiple Ackerman Car-Like Robots.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Robotics and Automation, 2024

On Computing Makespan-Optimal Solutions for Generalized Sliding-Tile Puzzles.

[BibT_eX]

[DOI]

Marcus Gozon

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Rearrangement on lattices with pick-n-swaps: Optimality structures and efficient algorithms.

[BibT_eX]

[DOI]

Int. J. Robotics Res., September, 2023

Minimizing running buffers for tabletop object rearrangement: Complexity, fast algorithms, and applications.

[BibT_eX]

[DOI]

Int. J. Robotics Res., September, 2023

Selected papers from WAFR2020.

[BibT_eX]

[DOI]

Ming C. Lin

Int. J. Robotics Res., May, 2023

Rubik Tables and object rearrangement.

[BibT_eX]

[DOI]

Int. J. Robotics Res., May, 2023

Algorithms and Systems for Manipulating Multiple Objects.

[BibT_eX]

[DOI]

IEEE Trans. Robotics, February, 2023

Bin Assignment and Decentralized Path Planning for Multi-Robot Parcel Sorting.

[BibT_eX]

[DOI]

CoRR, 2023

ORLA*: Mobile Manipulator-Based Object Rearrangement with Lazy A.

[BibT_eX]

[DOI]

CoRR, 2023

Efficient Algorithms for Boundary Defense with Heterogeneous Defenders.

[BibT_eX]

[DOI]

CoRR, 2023

An Initial Study of Budgeted Steiner Networks.

[BibT_eX]

[DOI]

Comput. Geom. Topol., 2023

DynGMP: Graph Neural Network-Based Motion Planning in Unpredictable Dynamic Environments.

[BibT_eX]

[DOI]

IROS, 2023

Optimal and Stable Multi-Layer Object Rearrangement on a Tabletop.

[BibT_eX]

[DOI]

IROS, 2023

EARL: Eye-on-Hand Reinforcement Learner for Dynamic Grasping with Active Pose Estimation.

[BibT_eX]

[DOI]

Baichuan Huang

Siddarth Jain

IROS, 2023

Efficient Heuristics for Multi-Robot Path Planning in Crowded Environments.

[BibT_eX]

[DOI]

IROS, 2023

Effectively Rearranging Heterogeneous Objects on Cluttered Tabletops.

[BibT_eX]

[DOI]

Justin Yu

Tanay Sandeep Punjabi

IROS, 2023

Toward Efficient Physical and Algorithmic Design of Automated Garages.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Robotics and Automation, 2023

On the Utility of Buffers in Pick-n-Swap Based Lattice Rearrangement.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Robotics and Automation, 2023

Optimal Allocation of Many Robot Guards for Sweep-Line Coverage.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Robotics and Automation, 2023

2022

Visual Foresight Trees for Object Retrieval From Clutter With Nonprehensile Rearrangement.

[BibT_eX]

[DOI]

IEEE Robotics Autom. Lett., 2022

Persistent Homology Guided Monte-Carlo Tree Search for Effective Non-Prehensile Manipulation.

[BibT_eX]

[DOI]

CoRR, 2022

Self-Supervised Monte Carlo Tree Search Learning for Object Retrieval in Clutter.

[BibT_eX]

[DOI]

CoRR, 2022

Sub-1.5 Time-Optimal Multi-Robot Path Planning on Grids in Polynomial Time.

[BibT_eX]

[DOI]

Proceedings of the Robotics: Science and Systems XVIII, New York City, NY, USA, June 27, 2022

Robot Motion Planning as Video Prediction: A Spatio-Temporal Neural Network-based Motion Planner.

[BibT_eX]

[DOI]

Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, 2022

Parallel Monte Carlo Tree Search with Batched Rigid-body Simulations for Speeding up Long-Horizon Episodic Robot Planning.

[BibT_eX]

[DOI]

Baichuan Huang

Abdeslam Boularias

Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, 2022

Polynomial Time Near-Time-Optimal Multi-Robot Path Planning in Three Dimensions with Applications to Large-Scale UAV Coordination.

[BibT_eX]

[DOI]

Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, 2022

Toward Efficient Task Planning for Dual-Arm Tabletop Object Rearrangement.

[BibT_eX]

[DOI]

Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, 2022

Stackelberg Strategic Guidance for Heterogeneous Robots Collaboration.

[BibT_eX]

[DOI]

Proceedings of the 2022 International Conference on Robotics and Automation, 2022

Persistent Homology for Effective Non-Prehensile Manipulation.

[BibT_eX]

[DOI]

Proceedings of the 2022 International Conference on Robotics and Automation, 2022

Interleaving Monte Carlo Tree Search and Self-Supervised Learning for Object Retrieval in Clutter.

[BibT_eX]

[DOI]

Proceedings of the 2022 International Conference on Robotics and Automation, 2022

Optimizing Space Utilization for More Effective Multi-Robot Path Planning.

[BibT_eX]

[DOI]

Proceedings of the 2022 International Conference on Robotics and Automation, 2022

Fast High-Quality Tabletop Rearrangement in Bounded Workspace.

[BibT_eX]

[DOI]

Proceedings of the 2022 International Conference on Robotics and Automation, 2022

Barrier Forming: Separating Polygonal Sets with Minimum Number of Lines.

[BibT_eX]

[DOI]

Proceedings of the 2022 International Conference on Robotics and Automation, 2022

Budgeted Steiner Networks: Three Terminals with Equal Path Weights.

[BibT_eX]

Proceedings of the 34th Canadian Conference on Computational Geometry, 2022

Rubik Tables, Stack Rearrangement, and Multi-Robot Path Planning.

[BibT_eX]

[DOI]

Proceedings of the 58th Annual Allerton Conference on Communication, 2022

Lazy Rearrangement Planning in Confined Spaces.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

2021

Fast, High-Quality Two-Arm Rearrangement in Synchronous, Monotone Tabletop Setups.

[BibT_eX]

[DOI]

IEEE Trans Autom. Sci. Eng., 2021

Team RuBot's experiences and lessons from the ARIAC.

[BibT_eX]

[DOI]

Robotics Comput. Integr. Manuf., 2021

Visual Foresight Tree for Object Retrieval from Clutter with Nonprehensile Rearrangement.

[BibT_eX]

[DOI]

CoRR, 2021

On Rearrangement of Items Stored in Stacks.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Foundations of Robotics XIV, 2021

Rearrangement on Lattices with Swaps: Optimality Structures and Efficient Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Robotics: Science and Systems XVII, Virtual Event, July 12-16, 2021., 2021

On Minimizing the Number of Running Buffers for Tabletop Rearrangement.

[BibT_eX]

[DOI]

Siwei Feng

Proceedings of the Robotics: Science and Systems XVII, Virtual Event, July 12-16, 2021., 2021

Capacitated Vehicle Routing with Target Geometric Constraints.

[BibT_eX]

[DOI]

Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, 2021

Uniform Object Rearrangement: From Complete Monotone Primitives to Efficient Non-Monotone Informed Search.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Robotics and Automation, 2021

DIPN: Deep Interaction Prediction Network with Application to Clutter Removal.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Robotics and Automation, 2021

Spatial and Temporal Splitting Heuristics for Multi-Robot Motion Planning.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Robotics and Automation, 2021

Sensor Placement for Globally Optimal Coverage of 3D-Embedded Surfaces.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Robotics and Automation, 2021

Toward Fully Automated Metal Recycling using Computer Vision and Non-Prehensile Manipulation.

[BibT_eX]

[DOI]

Proceedings of the 17th IEEE International Conference on Automation Science and Engineering, 2021

2020

DDM: Fast Near-Optimal Multi-Robot Path Planning Using Diversified-Path and Optimal Sub-Problem Solution Database Heuristics.

[BibT_eX]

[DOI]

IEEE Robotics Autom. Lett., 2020

Toward Fast and Optimal Robotic Pick-and-Place on a Moving Conveyor.

[BibT_eX]

[DOI]

IEEE Robotics Autom. Lett., 2020

Optimal Perimeter Guarding With Heterogeneous Robot Teams: Complexity Analysis and Effective Algorithms.

[BibT_eX]

[DOI]

IEEE Robotics Autom. Lett., 2020

Average case constant factor time and distance optimal multi-robot path planning in well-connected environments.

[BibT_eX]

[DOI]

Auton. Robots, 2020

Optimally Guarding Perimeters and Regions with Mobile Range Sensors.

[BibT_eX]

[DOI]

Siwei Feng

Proceedings of the Robotics: Science and Systems XVI, 2020

Computing High-Quality Clutter Removal Solutions for Multiple Robots.

[BibT_eX]

[DOI]

Wei N. Tang

Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, 2020

Adaptive Real-Time Scheduling for Cooperative Cyber-Physical Systems.

[BibT_eX]

[DOI]

Georg von Zengen

Lars C. Wolf

Proceedings of the IEEE Conference on Industrial Cyberphysical Systems, 2020

2019

Taming Combinatorial Challenges in Optimal Clutter Removal Tasks.

[BibT_eX]

[DOI]

Wei N. Tang

CoRR, 2019

Efficient Algorithms for Optimal Perimeter Guarding.

[BibT_eX]

[DOI]

CoRR, 2019

Integer Programming as a General Solution Methodology for Path-Based Optimization in Robotics: Principles and Best Practices.

[BibT_eX]

[DOI]

CoRR, 2019

Efficient Algorithms for Optimal Perimeter Guarding.

[BibT_eX]

[DOI]

Proceedings of the Robotics: Science and Systems XV, 2019

Effective Heuristics for Multi-Robot Path Planning in Warehouse Environments.

[BibT_eX]

[DOI]

Proceedings of the 2019 International Symposium on Multi-Robot and Multi-Agent Systems, 2019

Taming Combinatorial Challenges in Clutter Removal.

[BibT_eX]

[DOI]

Wei N. Tang

Proceedings of the Robotics Research, 2019

Integer Programming as a General Solution Methodology for Path-Based Optimization in Robotics: Principles, Best Practices, and Applications.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2019

Towards Robust Product Packing with a Minimalistic End-Effector.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Robotics and Automation, 2019

2018

Efficient, High-Quality Stack Rearrangement.

[BibT_eX]

[DOI]

IEEE Robotics Autom. Lett., 2018

Complexity Results and Fast Methods for Optimal Tabletop Rearrangement with Overhand Grasps.

[BibT_eX]

[DOI]

Int. J. Robotics Res., 2018

Constant Factor Time Optimal Multi-Robot Routing on High-Dimensional Grids in Mostly Sub-Quadratic Time.

[BibT_eX]

[DOI]

CoRR, 2018

Fast, High-Quality Dual-Arm Rearrangement in Synchronous, Monotone Tabletop Setups.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Foundations of Robotics XIII, 2018

Coordinating the Motion of Labeled Discs with Optimality Guarantees under Extreme Density.

[BibT_eX]

[DOI]

Rupesh Chinta

Proceedings of the Algorithmic Foundations of Robotics XIII, 2018

Constant Factor Time Optimal Multi-Robot Routing on High-Dimensional Grids.

[BibT_eX]

[DOI]

Proceedings of the Robotics: Science and Systems XIV, 2018

SEAR: A Polynomial- Time Multi-Robot Path Planning Algorithm with Expected Constant-Factor Optimality Guarantee.

[BibT_eX]

[DOI]

Edgar J. Rodriguez

Proceedings of the 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2018

2017

SEAR: A Polynomial-Time Expected Constant-Factor Optimal Algorithmic Framework for Multi-Robot Path Planning.

[BibT_eX]

[DOI]

Edgar J. Rodriguez

CoRR, 2017

Constant Factor Optimal Multi-Robot Path Planning in Well-Connected Environments.

[BibT_eX]

[DOI]

CoRR, 2017

High-Quality Tabletop Rearrangement with Overhand Grasps: Hardness Results and Fast Methods.

[BibT_eX]

[DOI]

Proceedings of the Robotics: Science and Systems XIII, 2017

Expected constant-factor optimal multi-robot path planning in well-connected environments.

[BibT_eX]

[DOI]

Proceedings of the 2017 International Symposium on Multi-Robot and Multi-Agent Systems (MRS), 2017

A portable, 3D-printing enabled multi-vehicle platform for robotics research and education.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Conference on Robotics and Automation, 2017

2016

Correlated Orienteering Problem and its Application to Persistent Monitoring Tasks.

[BibT_eX]

[DOI]

Mac Schwager

IEEE Trans. Robotics, 2016

Optimal Multirobot Path Planning on Graphs: Complete Algorithms and Effective Heuristics.

[BibT_eX]

[DOI]

IEEE Trans. Robotics, 2016

Intractability of Optimal Multirobot Path Planning on Planar Graphs.

[BibT_eX]

[DOI]

IEEE Robotics Autom. Lett., 2016

A Portable, 3D-Printing Enabled Multi-Vehicle Platform for Robotics Research and Education.

[BibT_eX]

[DOI]

CoRR, 2016

2015

Persistent Monitoring of Events With Stochastic Arrivals at Multiple Stations.

[BibT_eX]

[DOI]

Sertac Karaman

IEEE Trans. Robotics, 2015

Target Assignment in Robotic Networks: Distance Optimality Guarantees and Hierarchical Strategies.

[BibT_eX]

[DOI]

Soon-Jo Chung

Petros G. Voulgaris

IEEE Trans. Autom. Control., 2015

Optimal Multi-Robot Path Planning on Graphs: Complete Algorithms and Effective Heuristics.

[BibT_eX]

[DOI]

CoRR, 2015

Optimal Multi-Robot Path Planning on Graphs: Structure and Computational Complexity.

[BibT_eX]

[DOI]

CoRR, 2015

Intractability of Optimal Multi-Robot Path Planning on Planar Graphs.

[BibT_eX]

[DOI]

CoRR, 2015

Motion Planning for Unlabeled Discs with Optimality Guarantees.

[BibT_eX]

[DOI]

Proceedings of the Robotics: Science and Systems XI, Sapienza University of Rome, 2015

An Effective Algorithmic Framework for Near Optimal Multi-robot Path Planning.

[BibT_eX]

[DOI]

Proceedings of the Robotics Research, 2015

Anytime planning of optimal schedules for a mobile sensing robot.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2015

2014

Optimal Tourist Problem and Anytime Planning of Trip Itineraries.

[BibT_eX]

[DOI]

CoRR, 2014

Pebble Motion on Graphs with Rotations: Efficient Feasibility Tests and Planning Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Foundations of Robotics XI, 2014

Traveled distance minimization and hierarchical strategies for robotic networks.

[BibT_eX]

[DOI]

Soon-Jo Chung

Petros G. Voulgaris

Proceedings of the 6th International Symposium on Communications, 2014

Correlated Orienteering Problem and its application to informative path planning for persistent monitoring tasks.

[BibT_eX]

[DOI]

Mac Schwager

Proceedings of the 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2014

Distance optimal target assignment in robotic networks under communication and sensing constraints.

[BibT_eX]

[DOI]

Soon-Jo Chung

Petros G. Voulgaris

Proceedings of the 2014 IEEE International Conference on Robotics and Automation, 2014

2013

Combinatorial structures and filter design in information spaces

[BibT_eX]

[DOI]

PhD thesis, 2013

Counting Moving Bodies Using Sparse Sensor Beams.

[BibT_eX]

[DOI]

IEEE Trans Autom. Sci. Eng., 2013

A Linear Time Algorithm for the Feasibility of Pebble Motion on Graphs

[BibT_eX]

[DOI]

CoRR, 2013

Planning optimal paths for multiple robots on graphs.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Conference on Robotics and Automation, 2013

Efficient formation path planning on large graphs.

[BibT_eX]

[DOI]

Max Katsev

Proceedings of the 2013 IEEE International Conference on Robotics and Automation, 2013

Shortest path set induced vertex ordering and its application to distributed distance optimal formation path planning and control on graphs.

[BibT_eX]

[DOI]

Proceedings of the 52nd IEEE Conference on Decision and Control, 2013

Fast, Near-Optimal Computation for Multi-Robot Path Planning on Graphs.

[BibT_eX]

[DOI]

Proceedings of the Late-Breaking Developments in the Field of Artificial Intelligence, 2013

Structure and Intractability of Optimal Multi-Robot Path Planning on Graphs.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2012

Shadow Information Spaces: Combinatorial Filters for Tracking Targets.

[BibT_eX]

[DOI]

IEEE Trans. Robotics, 2012

Rendezvous Without Coordinates.

[BibT_eX]

[DOI]

Daniel Liberzon

IEEE Trans. Autom. Control., 2012

Diameters of Permutation Groups on Graphs, Multi-agent Path Planning, and Integer Multiflow on Directed Acyclic Graphs

[BibT_eX]

[DOI]

CoRR, 2012

Shortest Path Induced Vertex Ordering and its Application to Multi-agent Formation Path Planning

[BibT_eX]

[DOI]

CoRR, 2012

Planning Optimal Paths for Multi-agent Systems on Graphs

[BibT_eX]

[DOI]

CoRR, 2012

Multi-agent Path Planning and Network Flow.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Foundations of Robotics X, 2012

Distance optimal formation control on graphs with a tight convergence time guarantee.

[BibT_eX]

[DOI]

Proceedings of the 51th IEEE Conference on Decision and Control, 2012

Time Optimal Multi-Agent Path Planning on Graphs.

[BibT_eX]

[DOI]

Proceedings of the Multiagent Pathfinding, Papers from the 2012 AAAI Workshop, 2012

2011

Story validation and approximate path inference with a sparse network of heterogeneous sensors.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Robotics and Automation, 2011

2010

Cyber Detectives: Determining When Robots or People Misbehave.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Foundations of Robotics IX, 2010

Probabilistic shadow information spaces.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Robotics and Automation, 2010

2008

Tracking hidden agents through shadow information spaces.

[BibT_eX]

[DOI]