Zhongqiang Ren

Orcid: 0000-0003-2880-8653

According to our database1, Zhongqiang Ren authored at least 44 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
DMS*: Towards Minimizing Makespan for Multi-Agent Combinatorial Path Finding.
IEEE Robotics Autom. Lett., September, 2024

Search-Based Path Planning among Movable Obstacles.
CoRR, 2024

A Complete Algorithm for a Moving Target Traveling Salesman Problem with Obstacles.
CoRR, 2024

PWTO: A Heuristic Approach for Trajectory Optimization in Complex Terrains.
CoRR, 2024

Imperative Learning: A Self-supervised Neural-Symbolic Learning Framework for Robot Autonomy.
CoRR, 2024

Propagative Distance Optimization for Constrained Inverse Kinematics.
CoRR, 2024

iMTSP: Solving Min-Max Multiple Traveling Salesman Problem with Imperative Learning.
CoRR, 2024

A Mixed-Integer Conic Program for the Moving-Target Traveling Salesman Problem based on a Graph of Convex Sets.
CoRR, 2024

A Short Summary of Multi-Agent Combinatorial Path Finding with Heterogeneous Task Duration (Extended Abstract).
Proceedings of the Seventeenth International Symposium on Combinatorial Search, 2024

Heuristic Search for the Orienteering Problem with Time-Varying Reward.
Proceedings of the Seventeenth International Symposium on Combinatorial Search, 2024

2023
ERCA*: A New Approach for the Resource Constrained Shortest Path Problem.
IEEE Trans. Intell. Transp. Syst., December, 2023

A Pareto-Optimal Local Optimization Framework for Multiobjective Ergodic Search.
IEEE Trans. Robotics, October, 2023

CBSS: A New Approach for Multiagent Combinatorial Path Finding.
IEEE Trans. Robotics, August, 2023

Representation granularity enables time-efficient autonomous exploration in large, complex worlds.
Sci. Robotics, July, 2023

MUI-TARE: Cooperative Multi-Agent Exploration With Unknown Initial Position.
IEEE Robotics Autom. Lett., July, 2023

A Conflict-Based Search Framework for Multiobjective Multiagent Path Finding.
IEEE Trans Autom. Sci. Eng., April, 2023

DMS*: Minimizing Makespan for Multi-Agent Combinatorial Path Finding.
CoRR, 2023

C*: A New Bounding Approach for the Moving-Target Traveling Salesman Problem.
CoRR, 2023

Multi-Agent Combinatorial Path Finding with Heterogeneous Task Duration.
CoRR, 2023

Heuristic Search for Path Finding with Refuelling.
CoRR, 2023

Search Algorithms for Multi-Agent Teamwise Cooperative Path Finding [Extended Abstract].
Proceedings of the Sixteenth International Symposium on Combinatorial Search, 2023

Solving Multi-Agent Target Assignment and Path Finding with a Single Constraint Tree.
Proceedings of the International Symposium on Multi-Robot and Multi-Agent Systems, 2023

Multi-Agent Multi-Objective Ergodic Search Using Branch and Bound.
IROS, 2023

Search Algorithms for Multi-Agent Teamwise Cooperative Path Finding.
Proceedings of the IEEE International Conference on Robotics and Automation, 2023


Binary Branching Multi-Objective Conflict-Based Search for Multi-Agent Path Finding.
Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

2022
Multi-Objective Safe-Interval Path Planning With Dynamic Obstacles.
IEEE Robotics Autom. Lett., 2022

Multi-Objective Path-Based D* Lite.
IEEE Robotics Autom. Lett., 2022

Enhanced Multi-Objective A* with Partial Expansion.
CoRR, 2022

PyPose: A Library for Robot Learning with Physics-based Optimization.
CoRR, 2022

MUI-TARE: Multi-Agent Cooperative Exploration with Unknown Initial Position.
CoRR, 2022

Enhanced Multi-Objective A* Using Balanced Binary Search Trees.
CoRR, 2022

A Lower Bounding Framework for Motion Planning Amid Dynamic Obstacles in 2D.
Proceedings of the Algorithmic Foundations of Robotics XV, 2022

Enhanced Multi-Objective A* Using Balanced Binary Search Trees.
Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

A Local Optimization Framework for Multi-Objective Ergodic Search.
Proceedings of the Robotics: Science and Systems XVIII, New York City, NY, USA, June 27, 2022

Conflict-Based Steiner Search for Multi-Agent Combinatorial Path Finding.
Proceedings of the Robotics: Science and Systems XVIII, New York City, NY, USA, June 27, 2022

2021
Subdimensional Expansion for Multi-Objective Multi-Agent Path Finding.
IEEE Robotics Autom. Lett., October, 2021

Subdimensional Expansion Using Attention-Based Learning For Multi-Agent Path Finding.
CoRR, 2021

Multi-objective Conflict-based Search Using Safe-interval Path Planning.
CoRR, 2021

Multi-Objective Path-Based D* Lite.
CoRR, 2021

Loosely Synchronized Search for Multi-agent Path Finding with Asynchronous Actions.
Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, 2021

MS*: A New Exact Algorithm for Multi-agent Simultaneous Multi-goal Sequencing and Path Finding.
Proceedings of the IEEE International Conference on Robotics and Automation, 2021

Multi-objective Conflict-based Search for Multi-agent Path Finding.
Proceedings of the IEEE International Conference on Robotics and Automation, 2021

2017
Deformed state lattice planning.
Proceedings of the 2017 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2017


  Loading...