2026· IEEE Transactions on Automation Science and Engineering· Vol 23, pp. 12606-12620· 0 citations· 37 references
Computer Science
Abstract
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.
Autonomous navigation in dynamic environments is a critical challenge, particularly when spaces are shared with other mobile agents whose future trajectories are known. While traditional grid-based planners efficiently find collision-free paths, their reliance on stop-and-turn mechanics over $2^k$-connected grids produ...
Multi-Agent Path Finding (MAPF) studies how to compute collision-free routes for multiple robots moving simultaneously on a shared map, a setting in which naive shortest-path behavior often leads to bottlenecks, deadlocks, and costly replanning. This paper proposes a hierarchical, reservation-based, multi-resolution pl...
Gicu Rata, Liviu Octavian Mafteiu-Scai· SAR Journal - Science and Re...· 0 citations
Autonomous robot exploration in unknown environments is often constrained by the inefficiency of locally optimal strategies that evaluate frontier candidates individually for next-best-view (NBV) selection. To address this limitation, we propose an Efficient Traversal Path Planning (ETPP) framework. During exploration,...
Ling-Li Yu, Cheng-Xiang Peng, Jia-Wei Luo et al.· Italian National Conference...· 0 citations
This paper provides a formalization of what constitutes a sufficient scene graph for planning by modeling planning over scene graphs within an information-spaces framework through the definition of scene graph transition systems and relevant action semantics for navigation and manipulation.
A hybrid path planning algorithm that integrates an improved Bidirectional Rapidly-exploring Random Tree (BI-RRT) for global guidance with an enhanced Dynamic Window Approach (DWA) for local execution that improves search efficiency and maintains 100% success rate across tested environments.
The results support a descriptive efficiency advantage for the integrated intelligent-control stack under the evaluated conditions, without establishing universal superiority or a formal safety guarantee.