Skip to content

Self-Supervised Bio-Inspired Robotic Trajectory Planning with Obstacle Avoidance

Jul 2026 · arXiv.org · Vol abs/2607.20743 · 0 citations · 11 references
Computer Science

TL;DR

This follow-up work tests the feasibility of the neuro-inspired self-supervised learning framework for trajectory planning that leverages forward and inverse models as the internal supervisory mechanism in an environment that contains an obstacle, and demonstrates the tendency of the planner to exploit the learning signal provided by the forward and inverse models.

Abstract

Trajectory planning is a fundamental problem in robotics, requiring the generation of collision-free and efficient trajectories in a potentially complex environment. While sampling-based planners remain the dominant approach, they are often computationally expensive, particularly in high-dimensional spaces and obstacle-rich environments. Methods based on model learning offer a promising alternative, enabling efficient planning through a bounded number of forward passes through a neural trajectory planner, but commonly suffer from low sample efficiency or limited generalisation due to their reliance on exploration or expert demonstrations. This follow-up work tests our neuro-inspired self-supervised learning framework for trajectory planning that leverages forward and inverse models as the internal supervisory mechanism in an environment that contains an obstacle. Experimental results demonstrate the feasibility of the approach while revealing a tendency of our planner to exploit the learning signal provided by the forward and inverse models. To address this issue, additional training regimes and mitigation strategies are proposed and evaluated.

View source

Similar papers

Jul 2026

FARO: Feasibility-Aware Robot Motion Optimization

This paper proposes a nested kino-dynamic framework for rapid feasibility checking and dynamically consistent trajectory generation given a candidate contact sequence and shows that the generated trajectories can be tracked using a reinforcement learning (RL)-based controller and are of sufficiently high quality for ex...

Michal Ciebielski, Shafeef Omar, Aaron M. Johnson et al. · 0 citations
Review Open access Aug 2026

Robot Path Planning in Complex Environments: Methods, Challenges and Future Directions

It is argued that the future of robot path planning will be dominated by hybrid systems that combine global planning, local replanning, optimization, and learning-based prediction, enabling robots to operate more safely, intelligently, and adaptively in complex real-world environments.

Chanyu Wang · 0 citations
Review Aug 2026

VIP: Variation-based Iterative-learning Planning for Robotic Navigation

Extensive simulations and real-world experiments demonstrate that the proposed framework can efficiently generate and iteratively improve motion plans for different planning objectives, robotic platforms, and swarm configurations, highlighting its effectiveness, computational efficiency, and scalability as a general pl...

Shu-Li Lv, Pengda Mao, Chen Min et al. · 0 citations
Preprint Jul 2026

Model-Based Diffusion Optimal Control for Multi-Robot Motion Planning

This work introduces Model-Based Diffusion Optimal Control (MDOC), a model-based diffusion planner that efficiently produces dynamically feasible trajectories without relying on data, and shows that MDOC's safety mechanism naturally scales to multi-robot planning settings through Conflict-Based Search.

Zhilin He, Yorai Shaoul, Jiaoyang Li · 1 citation · ⚡1
Conference Jul 2026

Deep Imitation Learning for Efficient Path-Following of Hyper-Redundant Robots

Hyper-redundant robots are essential for navigation in highly constrained environments, yet their high-dimensional kinematics impose a severe computational burden on real-time motion planning. While optimization-based methods ensure tracking precision, their high computational latency makes them unsuitable for online f...

Nailong Bu, Ningyuan Luo, Chao-Yuan Liu et al. · 0 citations
Aug 2026

Deep reinforcement learning–based safe path planning for leader–follower robots

This work proposes a modified Multi-Agent Twin-Delayed Deep Deterministic Policy Gradient (M-MATD3) algorithm, specifically designed to mitigate common issues such as overestimation bias and high variance observed in standard MATD3.

Ehsan Kazemi Tameh, Mohammadreza Estarki, Saeed Khodaygan · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.