Repositório Institucional da Universidade Federal de Sergipe
metadata only
Uma extensão do algoritmo RRT para a representação compacta do espaço de configurações em alta dimensionalidade
Path planning in high-dimensional spaces is one of the main challenges in modern robotics, due to the complexity of the con guration space (Cspace) and the high computational cost associated with its exploration. Sampling-based probabilistic methods, such as the Rapidly-exploring Random Tree (RRT
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Optimizing H-Graph Hybridization for Diffusion-Guided RRT#1117609
- Iterated sampling importance resampling with adaptive number of proposals#785094
- Iterated sampling importance resampling with adaptive number of proposals#783504
- Distributed Model-Based Diffusion For Scalable Multi-Robot Trajectory Optimization#1123172
- Ergodic Trajectory Planning with Dynamic Sensor Footprints#1070737
Record · ID 1135566
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive