Wei Han Chen*, Yuchen Liu*, Alexiy Buynitsky, and Ahmed H. Qureshi
*denotes equal contribution
Abstract
Robot navigation in large, complex, and unknown indoor environments is a challenging problem. The existing approaches, such as traditional sampling-based methods, struggle with resolution control and scalability, while imitation learning-based methods require a large amount of demonstration data. Active Neural Time Fields (ANTFields) have recently emerged as a promising solution by using local observations to learn cost-to-go functions without relying on demonstrations. Despite their potential, these methods are hampered by challenges such as spectral bias and catastrophic forgetting, which diminish their effectiveness in complex scenarios. To address these issues, our approach decomposes the planning problem into a hierarchical structure. At the high level, a sparse graph captures the environment’s global connectivity, while at the low level, a planner based on neural fields navigates local obstacles by solving the Eikonal PDE. This physics-informed strategy overcomes common pitfalls like spectral bias and neural field fitting difficulties, resulting in a smooth and precise representation of the cost landscape. We validate our framework in large-scale environments, demonstrating its enhanced adaptability and precision compared to previous methods, and highlighting its potential for online exploration, mapping, and real-world navigation.
Overview
We propose mNTFields, a modular neural learning framework for scalable motion planning. Our pipeline constructs a navigation graph online during the exploration phase, which can then be leveraged for long-horizon path planning. The exploration phase begins with processing a local depth observation to build a global occupancy map. Then, room segmentation is performed to create new nodes in the navigation graph, where each node corresponds to a modular subnetwork. These subnetworks are trained using the normalized observation data. Finally, a path is planned towards the next best viewpoint to facilitate further exploration. During the path planning phase, a graph search is performed on the navigation graph. The corresponding subnetworks are queried to generate path segments, which are then concatenated to construct a full long-horizon path.