On the public citation graph

Rapidly-Exploring Random Tree Based on Particle Attraction for Complicated Environments

0 signed · 15 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-540-68405-3_18openalex-extracted

RESAMPL: A Region-Sensitive Adaptive Motion Planner

inferredcites →https://doi.org/10.1007/s10846-017-0641-3openalex-extracted

A Learning-based Multi-RRT Approach for Robot Path Planning in Narrow Passages

inferredcites →https://doi.org/10.1109/70.508439openalex-extracted

Probabilistic roadmaps for path planning in high-dimensional configuration spaces

inferredcites →https://doi.org/10.1109/access.2018.2871222openalex-extracted

Path Planning of Industrial Robot Based on Improved RRT Algorithm in Complex Environments

inferredcites →https://doi.org/10.1109/coase.2012.6386513openalex-extracted

Extended RRT-based path planning for flying robots in complex 3D environments with narrow passages

inferredcites →https://doi.org/10.1109/icma49215.2020.9233539openalex-extracted

Robot Path Planning Algorithm based on Bi-RRT and Potential Field

inferredcites →https://doi.org/10.1109/icra.2018.8460186openalex-extracted

Rapidly-Exploring Random Vines (RRV) for Motion Planning in Configuration Spaces with Narrow Passages

inferredcites →https://doi.org/10.1109/jas.2021.1004252openalex-extracted

An Adaptive Rapidly-Exploring Random Tree

inferredcites →https://doi.org/10.1109/robio49542.2019.8961757openalex-extracted

Locally Guided Multiple Bi-RRT∗ for Fast Path Planning in Narrow Passages

inferredcites →https://doi.org/10.1109/robot.1999.772447openalex-extracted

The Gaussian sampling strategy for probabilistic roadmap planners

inferredcites →https://doi.org/10.1109/robot.2000.844730openalex-extracted

RRT-connect: An efficient approach to single-query path planning

inferredcites →https://doi.org/10.1109/robot.2005.1570709openalex-extracted

Dynamic-Domain RRTs: Efficient Exploration by Controlling the Sampling Domain

inferredcites →https://doi.org/10.1177/0278364911403335openalex-extracted

Linear dimensionality reduction in random motion planning

inferredcites →https://doi.org/10.1177/0278364911406761openalex-extracted

Sampling-based algorithms for optimal motion planning

inferredcites →https://doi.org/10.48550/arxiv.1109.3145openalex-extracted

Sample-Based Planning with Volumes in Configuration Space

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.