DAMON: Dynamic Amorphous Obstacle Navigation using Topological Manifold Learning and Variational Autoencoding
Apan Dastider, Mingjie Lin

TL;DR
DAMON introduces a novel manifold learning and variational autoencoding approach for dynamic obstacle avoidance, enabling faster, more efficient motion planning in robotic systems with lower computational costs.
Contribution
It presents a new low-dimensional graph-based method that significantly improves obstacle avoidance efficiency and performance over existing sampling-based techniques.
Findings
Outperforms RRT, RRT*, Dynamic RRT*, L2RRT, and MpNet in speed and smoothness.
Enables learning and avoiding unseen obstacles in real-time.
Reduces computational overhead and memory usage.
Abstract
DAMON leverages manifold learning and variational autoencoding to achieve obstacle avoidance, allowing for motion planning through adaptive graph traversal in a pre-learned low-dimensional hierarchically-structured manifold graph that captures intricate motion dynamics between a robotic arm and its obstacles. This versatile and reusable approach is applicable to various collaboration scenarios. The primary advantage of DAMON is its ability to embed information in a low-dimensional graph, eliminating the need for repeated computation required by current sampling-based methods. As a result, it offers faster and more efficient motion planning with significantly lower computational overhead and memory footprint. In summary, DAMON is a breakthrough methodology that addresses the challenge of dynamic obstacle avoidance in robotic systems and offers a promising solution for safe and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRobotic Path Planning Algorithms · Human Pose and Action Recognition · Robotic Locomotion and Control
