Alert button
Picture for Zhongqiang Ren

Zhongqiang Ren

Alert button

Heuristic Search for Path Finding with Refuelling

Sep 19, 2023
Anushtup Nandy, Zhongqiang Ren, Sivakumar Rathinam, Howie Choset

This paper considers a generalization of the Path Finding (PF) with refueling constraints referred to as the Refuelling Path Finding (RF-PF) problem. Just like PF, the RF-PF problem is defined over a graph, where vertices are gas stations with known fuel prices, and edge costs depend on the gas consumption between the corresponding vertices. RF-PF seeks a minimum-cost path from the start to the goal vertex for a robot with a limited gas tank and a limited number of refuelling stops. While RF-PF is polynomial-time solvable, it remains a challenge to quickly compute an optimal solution in practice since the robot needs to simultaneously determine the path, where to make the stops, and the amount to refuel at each stop. This paper develops a heuristic search algorithm called Refuel A* (RF-A* ) that iteratively constructs partial solution paths from the start to the goal guided by a heuristic function while leveraging dominance rules for state pruning during planning. RF-A* is guaranteed to find an optimal solution and runs more than an order of magnitude faster than the existing state of the art (a polynomial time algorithm) when tested in large city maps with hundreds of gas stations.

* 7 pages, 6 figures, ICRA 2024 submission, path planning, robotics 
Viaarxiv icon

Solving Multi-Agent Target Assignment and Path Finding with a Single Constraint Tree

Jul 02, 2023
Yimin Tang, Zhongqiang Ren, Jiaoyang Li, Katia Sycara

Figure 1 for Solving Multi-Agent Target Assignment and Path Finding with a Single Constraint Tree
Figure 2 for Solving Multi-Agent Target Assignment and Path Finding with a Single Constraint Tree
Figure 3 for Solving Multi-Agent Target Assignment and Path Finding with a Single Constraint Tree
Figure 4 for Solving Multi-Agent Target Assignment and Path Finding with a Single Constraint Tree

Combined Target-Assignment and Path-Finding problem (TAPF) requires simultaneously assigning targets to agents and planning collision-free paths for agents from their start locations to their assigned targets. As a leading approach to address TAPF, Conflict-Based Search with Target Assignment (CBS-TA) leverages both K-best target assignments to create multiple search trees and Conflict-Based Search (CBS) to resolve collisions in each search tree. While being able to find an optimal solution, CBS-TA suffers from scalability due to the duplicated collision resolution in multiple trees and the expensive computation of K-best assignments. We therefore develop Incremental Target Assignment CBS (ITA-CBS) to bypass these two computational bottlenecks. ITA-CBS generates only a single search tree and avoids computing K-best assignments by incrementally computing new 1-best assignments during the search. We show that, in theory, ITA-CBS is guaranteed to find an optimal solution and, in practice, is computationally efficient.

Viaarxiv icon

Enhanced Multi-Objective A* with Partial Expansion

Dec 06, 2022
Valmiki Kothare, Zhongqiang Ren, Sivakumar Rathinam, Howie Choset

Figure 1 for Enhanced Multi-Objective A* with Partial Expansion
Figure 2 for Enhanced Multi-Objective A* with Partial Expansion
Figure 3 for Enhanced Multi-Objective A* with Partial Expansion
Figure 4 for Enhanced Multi-Objective A* with Partial Expansion

The Multi-Objective Shortest Path Problem, typically posed on a graph, determines a set of paths from a start vertex to a destination vertex while optimizing multiple objectives. In general, there does not exist a single solution path that can simultaneously optimize all the objectives and the problem thus seeks to find a set of so-called Pareto-optimal solutions. To address this problem, several Multi-Objective A* (MOA*) algorithms were recently developed to quickly compute solutions with quality guarantees. However, these MOA* algorithms often suffer from high memory usage, especially when the branching factor (i.e., the number of neighbors of any vertex) of the graph is large. This work thus aims at reducing the high memory consumption of MOA* with little increase in the runtime. In this paper, we first extend the notion of "partial expansion" (PE) from single-objective to multi-objective and then fuse this new PE technique with EMOA*, a recent runtime efficient MOA* algorithm. Furthermore, the resulting algorithm PE-EMOA* can balance between runtime and memory efficiency by tuning a user-defined hyper-parameter.

* 11 pages, 5 figures, Submitted to ICAPS 2023 
Viaarxiv icon

PyPose: A Library for Robot Learning with Physics-based Optimization

Sep 30, 2022
Chen Wang, Dasong Gao, Kuan Xu, Junyi Geng, Yaoyu Hu, Yuheng Qiu, Bowen Li, Fan Yang, Brady Moon, Abhinav Pandey, Aryan, Jiahe Xu, Tianhao Wu, Haonan He, Daning Huang, Zhongqiang Ren, Shibo Zhao, Taimeng Fu, Pranay Reddy, Xiao Lin, Wenshan Wang, Jingnan Shi, Rajat Talak, Han Wang, Huai Yu, Shanzhao Wang, Ananth Kashyap, Rohan Bandaru, Karthik Dantu, Jiajun Wu, Luca Carlone, Marco Hutter, Sebastian Scherer

Figure 1 for PyPose: A Library for Robot Learning with Physics-based Optimization
Figure 2 for PyPose: A Library for Robot Learning with Physics-based Optimization
Figure 3 for PyPose: A Library for Robot Learning with Physics-based Optimization
Figure 4 for PyPose: A Library for Robot Learning with Physics-based Optimization

Deep learning has had remarkable success in robotic perception, but its data-centric nature suffers when it comes to generalizing to ever-changing environments. By contrast, physics-based optimization generalizes better, but it does not perform as well in complicated tasks due to the lack of high-level semantic information and the reliance on manual parametric tuning. To take advantage of these two complementary worlds, we present PyPose: a robotics-oriented, PyTorch-based library that combines deep perceptual models with physics-based optimization techniques. Our design goal for PyPose is to make it user-friendly, efficient, and interpretable with a tidy and well-organized architecture. Using an imperative style interface, it can be easily integrated into real-world robotic applications. Besides, it supports parallel computing of any order gradients of Lie groups and Lie algebras and $2^{\text{nd}}$-order optimizers, such as trust region methods. Experiments show that PyPose achieves 3-20$\times$ speedup in computation compared to state-of-the-art libraries. To boost future research, we provide concrete examples across several fields of robotics, including SLAM, inertial navigation, planning, and control.

Viaarxiv icon

MUI-TARE: Multi-Agent Cooperative Exploration with Unknown Initial Position

Sep 22, 2022
Jingtian Yan, Xingqiao Lin, Zhongqiang Ren, Shiqi Zhao, Jieqiong Yu, Chao Cao, Peng Yin, Ji Zhang, Sebastian Scherer

Figure 1 for MUI-TARE: Multi-Agent Cooperative Exploration with Unknown Initial Position
Figure 2 for MUI-TARE: Multi-Agent Cooperative Exploration with Unknown Initial Position
Figure 3 for MUI-TARE: Multi-Agent Cooperative Exploration with Unknown Initial Position
Figure 4 for MUI-TARE: Multi-Agent Cooperative Exploration with Unknown Initial Position

Multi-agent exploration of a bounded 3D environment with unknown initial positions of agents is a challenging problem. It requires quickly exploring the environments as well as robustly merging the sub-maps built by the agents. We take the view that the existing approaches are either aggressive or conservative: Aggressive strategies merge two sub-maps built by different agents together when overlap is detected, which can lead to incorrect merging due to the false-positive detection of the overlap and is thus not robust. Conservative strategies direct one agent to revisit an excessive amount of the historical trajectory of another agent for verification before merging, which can lower the exploration efficiency due to the repeated exploration of the same space. To intelligently balance the robustness of sub-map merging and exploration efficiency, we develop a new approach for lidar-based multi-agent exploration, which can direct one agent to repeat another agent's trajectory in an \emph{adaptive} manner based on the quality indicator of the sub-map merging process. Additionally, our approach extends the recent single-agent hierarchical exploration strategy to multiple agents in a \emph{cooperative} manner by planning for agents with merged sub-maps together to further improve exploration efficiency. Our experiments show that our approach is up to 50\% more efficient than the baselines on average while merging sub-maps robustly.

* 8 pages, 8 figures, Submitted to IEEE RAL 
Viaarxiv icon

A Local Optimization Framework for Multi-Objective Ergodic Search

Jul 06, 2022
Zhongqiang Ren, Akshaya Kesarimangalam Srinivasan, Howard Coffin, Ian Abraham, Howie Choset

Figure 1 for A Local Optimization Framework for Multi-Objective Ergodic Search
Figure 2 for A Local Optimization Framework for Multi-Objective Ergodic Search
Figure 3 for A Local Optimization Framework for Multi-Objective Ergodic Search
Figure 4 for A Local Optimization Framework for Multi-Objective Ergodic Search

Robots have the potential to perform search for a variety of applications under different scenarios. Our work is motivated by humanitarian assistant and disaster relief (HADR) where often it is critical to find signs of life in the presence of conflicting criteria, objectives, and information. We believe ergodic search can provide a framework for exploiting available information as well as exploring for new information for applications such as HADR, especially when time is of the essence. Ergodic search algorithms plan trajectories such that the time spent in a region is proportional to the amount of information in that region, and is able to naturally balance exploitation (myopically searching high-information areas) and exploration (visiting all locations in the search space for new information). Existing ergodic search algorithms, as well as other information-based approaches, typically consider search using only a single information map. However, in many scenarios, the use of multiple information maps that encode different types of relevant information is common. Ergodic search methods currently do not possess the ability for simultaneous nor do they have a way to balance which information gets priority. This leads us to formulate a Multi-Objective Ergodic Search (MOES) problem, which aims at finding the so-called Pareto-optimal solutions, for the purpose of providing human decision makers various solutions that trade off between conflicting criteria. To efficiently solve MOES, we develop a framework called Sequential Local Ergodic Search (SLES) that converts a MOES problem into a "weight space coverage" problem. It leverages the recent advances in ergodic search methods as well as the idea of local optimization to efficiently approximate the Pareto-optimal front. Our numerical results show that SLES runs distinctly faster than the baseline methods.

* Robotics: Science and Systems 2022 
Viaarxiv icon

Enhanced Multi-Objective A* Using Balanced Binary Search Trees

Feb 18, 2022
Zhongqiang Ren, Sivakumar Rathinam, Maxim Likhachev, Howie Choset

Figure 1 for Enhanced Multi-Objective A* Using Balanced Binary Search Trees
Figure 2 for Enhanced Multi-Objective A* Using Balanced Binary Search Trees
Figure 3 for Enhanced Multi-Objective A* Using Balanced Binary Search Trees
Figure 4 for Enhanced Multi-Objective A* Using Balanced Binary Search Trees

This work addresses the Multi-Objective Shortest Path Problem (MO-SPP): Given a graph where each edge is associated with a non-negative cost vector, MO-SPP aims to find all the Pareto-optimal paths connecting the given start and goal nodes. To solve MO-SPP, the popular multi-objective A* (MOA*) like algorithms maintain a "frontier" set at any node during the search to keep track of the non-dominated paths that reach that node. The computational efficiency of MOA* algorithms directly depend on how efficiently one can maintain the frontier sets. Recently, several techniques have been developed in the literature to address this issue mainly for two objectives. In this work, we introduce a new method to efficiently maintain these frontiers for multiple objectives by leveraging balanced binary search trees. We provide extensive simulation results for problems with three, four and five objectives to show that our method outperforms existing techniques by an order of magnitude in general.

Viaarxiv icon

A Lower Bounding Framework for Motion Planning amid Dynamic Obstacles in 2D

Feb 15, 2022
Zhongqiang Ren, Sivakumar Rathinam, Howie Choset

Figure 1 for A Lower Bounding Framework for Motion Planning amid Dynamic Obstacles in 2D
Figure 2 for A Lower Bounding Framework for Motion Planning amid Dynamic Obstacles in 2D
Figure 3 for A Lower Bounding Framework for Motion Planning amid Dynamic Obstacles in 2D
Figure 4 for A Lower Bounding Framework for Motion Planning amid Dynamic Obstacles in 2D

This work considers a Motion Planning Problem with Dynamic Obstacles (MPDO) in 2D that requires finding a minimum-arrival-time collision-free trajectory for a point robot between its start and goal locations amid dynamic obstacles moving along known trajectories. Existing methods, such as continuous Dijkstra paradigm, can find an optimal solution by restricting the shape of the obstacles or the motion of the robot, while this work makes no such assumptions. Other methods, such as search-based planners and sampling-based approaches can compute a feasible solution to this problem but do not provide approximation bounds. Since finding the optimum is challenging for MPDO, this paper develops a framework that can provide tight lower bounds to the optimum. These bounds acts as proxies for the optimum which can then be use to bound the deviation of a feasible solution from the optimum. To accomplish this, we develop a framework that consists of (i) a bi-level discretization approach that converts the MPDO to a relaxed path planning problem, and (ii) an algorithm that can solve the relaxed problem to obtain lower bounds. We also present preliminary numerical results to corroborate the performance of the proposed framework. These results show that the bounds obtained by our approach for some instances are three times larger than a naive baseline approach showcasing potential advantages of the proposed approach.

Viaarxiv icon

Subdimensional Expansion Using Attention-Based Learning For Multi-Agent Path Finding

Sep 29, 2021
Lakshay Virmani, Zhongqiang Ren, Sivakumar Rathinam, Howie Choset

Figure 1 for Subdimensional Expansion Using Attention-Based Learning For Multi-Agent Path Finding
Figure 2 for Subdimensional Expansion Using Attention-Based Learning For Multi-Agent Path Finding
Figure 3 for Subdimensional Expansion Using Attention-Based Learning For Multi-Agent Path Finding
Figure 4 for Subdimensional Expansion Using Attention-Based Learning For Multi-Agent Path Finding

Multi-Agent Path Finding (MAPF) finds conflict-free paths for multiple agents from their respective start to goal locations. MAPF is challenging as the joint configuration space grows exponentially with respect to the number of agents. Among MAPF planners, search-based methods, such as CBS and M*, effectively bypass the curse of dimensionality by employing a dynamically-coupled strategy: agents are planned in a fully decoupled manner at first, where potential conflicts between agents are ignored; and then agents either follow their individual plans or are coupled together for planning to resolve the conflicts between them. In general, the number of conflicts to be resolved decides the run time of these planners and most of the existing work focuses on how to efficiently resolve these conflicts. In this work, we take a different view and aim to reduce the number of conflicts (and thus improve the overall search efficiency) by improving each agent's individual plan. By leveraging a Visual Transformer, we develop a learning-based single-agent planner, which plans for a single agent while paying attention to both the structure of the map and other agents with whom conflicts may happen. We then develop a novel multi-agent planner called LM* by integrating this learning-based single-agent planner with M*. Our results show that for both "seen" and "unseen" maps, in comparison with M*, LM* has fewer conflicts to be resolved and thus, runs faster and enjoys higher success rates. We empirically show that MAPF solutions computed by LM* are near-optimal. Our code is available at https://github.com/lakshayvirmani/learning-assisted-mstar .

* 7 pages 
Viaarxiv icon

Multi-objective Conflict-based Search Using Safe-interval Path Planning

Aug 02, 2021
Zhongqiang Ren, Sivakumar Rathinam, Howie Choset

Figure 1 for Multi-objective Conflict-based Search Using Safe-interval Path Planning
Figure 2 for Multi-objective Conflict-based Search Using Safe-interval Path Planning
Figure 3 for Multi-objective Conflict-based Search Using Safe-interval Path Planning
Figure 4 for Multi-objective Conflict-based Search Using Safe-interval Path Planning

This paper addresses a generalization of the well known multi-agent path finding (MAPF) problem that optimizes multiple conflicting objectives simultaneously such as travel time and path risk. This generalization, referred to as multi-objective MAPF (MOMAPF), arises in several applications ranging from hazardous material transportation to construction site planning. In this paper, we present a new multi-objective conflict-based search (MO-CBS) approach that relies on a novel multi-objective safe interval path planning (MO-SIPP) algorithm for its low-level search. We first develop the MO-SIPP algorithm, show its properties and then embed it in MO-CBS. We present extensive numerical results to show that (1) there is an order of magnitude improvement in the average low level search time, and (2) a significant improvement in the success rates of finding the Pareto-optimal front can be obtained using the proposed approach in comparison with the state of the art. Finally, we also provide a case study to demonstrate the potential application of the proposed algorithms for construction site planning.

* 9 pages 
Viaarxiv icon