Skip to content

Author

Jianing Hu

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

2026

Scene Interaction-Aware Path Planning for Mobile Robots With Planar Interaction Capabilities

By actively interacting with surroundings and modifying environmental conditions, mobile robots with planar interaction capabilities can achieve comprehensive autonomous planning in complex, multi-connected domain scenarios. This study introduces a scene interaction-aware planning framework that empowers agents to reshape their environment and resolve navigation challenges across disconnected domains. The framework characterizes bidirectional agent-environment relationships and decomposes the cross-domain planning problem into three interconnected sub-problems: domain-transition sequencing, interaction process planning, and static path search. Correspondingly, a hierarchical multi-layer graph search algorithm is proposed, where higher-level strategic searches utilize lower-level feasibility results while providing global guidance. Theoretical analysis demonstrates that this hierarchical approach transforms the traditionally exponential “Navigation Among Movable Obstacles” (NAMO) problem into a computationally tractable task with linear complexity relative to the number of interactive objects. The efficacy of the algorithm is validated through extensive benchmarks in scenarios containing up to 45 interactive objects. Comparative results show that our method outperforms grid-based and sampling-based planners, achieving superior path quality and a higher execution success rate in high-fidelity simulations. Physical experiments using a perception-driven mobile platform further confirm the robustness and practical utility of the proposed method in unstructured real-world environments. Note to Practitioners—The autonomy of uncrewed systems in complex environments is limited by the static characteristics of the environment, which restricts their application scope and task execution capabilities. The method proposed in this paper enables mobile manipulator robotic systems to actively change the state of the environment through interaction, thereby enhancing their autonomous planning capabilities. To use this method, the geometric information of purely static obstacles and interactive elements in the scene, as well as the interaction models of these elements, such as pushing, pulling, and rotation, must be provided. Since this method explicitly plans the interaction process, it is necessary to model the kinematic characteristics of the agent and the interaction characteristics of the interactive elements. This method is suitable for multi-connected domain path planning problems that require consideration of scene interaction, such as uncrewed vehicle path planning tasks in disaster rescue, warehousing logistics, and other scenarios.

Jianing Hu, Weiran Yao, Zirui Wu et al. · 0 citations
Sep 2026

CB-BSH: Multi-Agent Motion Planning With Heterogeneous Kinematics and Geometric Envelopes

This letter addresses the collision-free planning problem for heterogeneous multi-agent systems. Heterogeneity primarily refers to two aspects: differences in geometric configurations and variations in kinematic models. For non-point-mass agent models, it is essential to consider both geometric constraints arising from their physical dimensions and kinematic constraints. The proposed planning algorithm is an improvement upon the Conflict-Based Search (CBS) framework, consisting of high-level conflict detection and low-level single-agent path planning. The low-level planner employs a bidirectional space-time Hybrid A* algorithm (BSH) to accommodate the requirements of different kinematic models. The high-level planner introduces the concept of geometric envelopes to design conflict detection and constraint resolution methods in continuous space, effectively handling collision detection and conflict resolution among heterogeneous agents. To alleviate the computational burden caused by the high dimensionality of the search tree in CBS-like algorithms, a heuristic high-level node selection strategy is also proposed. Experimental results demonstrate that, compared to priority-based planning methods, the proposed approach yields more cost-effective planning solutions but more computational overhead while exhibiting an efficiency-optimality trade-off.

Jianing Hu, Weiran Yao, Haoyu Tian et al. · 0 citations