Détail du document
Identifiant

oai:arXiv.org:2410.20279

Sujet
Computer Science - Robotics
Auteur
Huang, Xi Sóti, Gergely Zhou, Hongyi Ledermann, Christoph Hein, Björn Kröger, Torsten
Catégorie

Computer Science

Année

2024

Date de référencement

30/10/2024

Mots clés
planning tree hiro informed robot heuristics
Métrique

Résumé

With the goal of efficiently computing collision-free robot motion trajectories in dynamically changing environments, we present results of a novel method for Heuristics Informed Robot Online Path Planning (HIRO).

Dividing robot environments into static and dynamic elements, we use the static part for initializing a deterministic roadmap, which provides a lower bound of the final path cost as informed heuristics for fast path-finding.

These heuristics guide a search tree to explore the roadmap during runtime.

The search tree examines the edges using a fuzzy collision checking concerning the dynamic environment.

Finally, the heuristics tree exploits knowledge fed back from the fuzzy collision checking module and updates the lower bound for the path cost.

As we demonstrate in real-world experiments, the closed-loop formed by these three components significantly accelerates the planning procedure.

An additional backtracking step ensures the feasibility of the resulting paths.

Experiments in simulation and the real world show that HIRO can find collision-free paths considerably faster than baseline methods with and without prior knowledge of the environment.

Huang, Xi,Sóti, Gergely,Zhou, Hongyi,Ledermann, Christoph,Hein, Björn,Kröger, Torsten, 2024, HIRO: Heuristics Informed Robot Online Path Planning Using Pre-computed Deterministic Roadmaps

Document

Ouvrir

Partager

Source

Articles recommandés par ES/IODE IA

Multiplexed live-cell imaging for drug responses in patient-derived organoid models of cancer
cell organoid patient-derived kinetic system effects cancer pdo models