Paper Citation Record · LEDGER

Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic

As of 5 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 0 inbound Pith citation observations for arXiv:2508.19168.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2508.19168 v1

Coverage vector

measured 37 of 37 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-05T15:59:51.220439Z

measured 37 of 37 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-05T06:32:48.257954+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

37 of 37 outbound references displayed

verified exact0
verified fuzzy23
unresolved14
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 28cfdd82-0e46-4dbc-a2b6-dad48b133dc4 · outbound

This paper cites Asymptotically optimal sampling- based motion planning methods,.

Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic Asymptotically optimal sampling- based motion planning methods,

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T15:59:51.583108Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 3ee3b194-8481-4311-8be3-3e5f81f4bb8d · outbound

This paper cites A formal basis for the heuristic determination of minimum cost paths,.

Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic A formal basis for the heuristic determination of minimum cost paths,

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-05T15:59:51.115358Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ea82f072-7b54-453e-82ff-d4823635c3a6 · outbound

This paper cites Dynamic programming, princeton univ,.

Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic Dynamic programming, princeton univ,

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T15:59:51.569554Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 37588df9-ab75-48fc-abaa-9594ab6cab5d · outbound

This paper cites Analysis of probabilistic roadmaps for path planning,.

Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic Analysis of probabilistic roadmaps for path planning,

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T15:59:51.560880Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 918cff78-9be0-40f8-86e2-f1fdd4e087b5 · outbound

This paper cites Rapidly-exploring random trees: A new tool for path planning,.

Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic Rapidly-exploring random trees: A new tool for path planning,

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T15:59:51.552442Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 0da5eaea-0c4f-443c-9286-840a70b05265 · outbound

This paper cites RRT-connect: An efficient approach to single-query path planning,.

Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic RRT-connect: An efficient approach to single-query path planning,

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T15:59:51.543629Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation f25a5775-d53e-4232-85cb-017ab052ca29 · outbound

This paper cites Tree- based grafting approach for bidirectional motion planning with local subsets optimization,.

Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic Tree- based grafting approach for bidirectional motion planning with local subsets optimization,

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-05T15:59:51.131253Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 69e9a670-591b-499d-b689-45dc78ba5c46 · outbound

This paper cites Approaches for heuristically biasing RRT growth,.

Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic Approaches for heuristically biasing RRT growth,

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T15:59:51.530436Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 18ef62ac-1e98-4c2d-8e23-3054a088021b · outbound

This paper cites Bidirectional sampling-based motion plan- ning without two-point boundary value solution,.

Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic Bidirectional sampling-based motion plan- ning without two-point boundary value solution,

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-05T15:59:51.136987Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 706f0705-bca0-4a85-8057-bbec2f7891f8 · outbound

This paper cites Adaptively informed trees (AIT) and effort informed trees (EIT): Asymmetric bidirectional sampling- based path planning,.

Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic Adaptively informed trees (AIT*) and effort informed trees (EIT*): Asymmetric bidirectional sampling- based path planning,

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-05T15:59:51.139854Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 49d1876e-485a-403a-9097-32760c5bdeec · outbound

This paper cites Sampling-based algorithms for optimal motion planning,.

Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic Sampling-based algorithms for optimal motion planning,

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-05T15:59:51.142584Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 058dc4f1-8a60-4d92-82d4-469b6d53f2ef · outbound

This paper cites Informed RRT*: Optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic,.

Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic Informed RRT*: Optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic,

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T15:59:51.507400Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation d89ac7e0-5584-4ba0-9eda-bcf56c24d78f · outbound

This paper cites Informed sampling for asymptotically optimal path planning,.

Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic Informed sampling for asymptotically optimal path planning,

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T15:59:51.498637Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 645fdd18-aed5-41c9-b856-d193a466d87d · outbound

This paper cites Hierarchical rejection sampling for informed kinodynamic planning in high-dimensional spaces,.

Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic Hierarchical rejection sampling for informed kinodynamic planning in high-dimensional spaces,

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T15:59:51.489926Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 8cc6a6e3-16ed-442b-b43f-5e5c5955a896 · outbound

This paper cites Gener- alizing informed sampling for asymptotically-optimal sampling-based kinodynamic planning via markov chain monte carlo,.

Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic Gener- alizing informed sampling for asymptotically-optimal sampling-based kinodynamic planning via markov chain monte carlo,

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T15:59:51.480853Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 85af7b8f-59d8-4a5a-b570-8b1106eb816b · outbound

This paper cites Elliptical k-nearest neighbors: Path optimization via coulomb’s law and invalid vertices in c-space obstacles,.

Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic Elliptical k-nearest neighbors: Path optimization via coulomb’s law and invalid vertices in c-space obstacles,

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-05T15:59:51.157859Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 406d1954-8c01-4f98-8c01-1e72bfff29ab · outbound

This paper cites Energy-efficient path planning of reconfigurable robots in complex environments,.

Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic Energy-efficient path planning of reconfigurable robots in complex environments,

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-05T15:59:51.160608Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1f2d4e02-ad86-4512-8ff4-77924720b05f · outbound

This paper cites Non-parametric informed exploration for sampling-based motion planning,.

Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic Non-parametric informed exploration for sampling-based motion planning,

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T15:59:51.462936Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation a0236816-2fe3-4c59-bfa7-0d57bb62a52e · outbound

This paper cites Batch informed trees (BIT*): Sampling-based optimal planning via the heuristically guided search of implicit random geometric graphs,.

Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic Batch informed trees (BIT*): Sampling-based optimal planning via the heuristically guided search of implicit random geometric graphs,

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T15:59:51.454308Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation ce45fb5b-ec16-47aa-b84d-27107770cbbc · outbound

This paper cites Batch informed trees (BIT*): Informed asymptotically optimal anytime search,.

Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic Batch informed trees (BIT*): Informed asymptotically optimal anytime search,

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T15:59:51.445636Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation f58f18c1-478a-489b-bf5b-a54986f0818c · outbound

This paper cites Penrose, Random geometric graphs.

Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic Penrose, Random geometric graphs

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-05T15:59:51.172217Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 72f30d90-bd67-4357-87e1-c6931a5acfb9 · outbound

This paper cites Advanced BIT* (ABIT*): Sampling- based planning with advanced graph-search techniques,.

Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic Advanced BIT* (ABIT*): Sampling- based planning with advanced graph-search techniques,

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T15:59:51.432498Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 9debc243-63b9-4387-8a05-6c5e3b4e6d40 · outbound

This paper cites Flexible informed trees (FIT*): Adaptive batch-size approach in informed sampling- based path planning,.

Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic Flexible informed trees (FIT*): Adaptive batch-size approach in informed sampling- based path planning,

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-05T15:59:51.178130Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 36130420-6d1b-47ca-a015-dbe8a2294da6 · outbound

This paper cites Adaptively informed trees (AIT*): Fast asymptotically optimal path planning through adaptive heuristics,.

Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic Adaptively informed trees (AIT*): Fast asymptotically optimal path planning through adaptive heuristics,

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-05T15:59:51.181180Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fa349668-3cfe-4188-9852-b8c8e652811d · outbound

This paper cites Preserving and combining knowledge in robotic lifelong reinforcement learning,.

Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic Preserving and combining knowledge in robotic lifelong reinforcement learning,

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-05T15:59:51.184731Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8cb0d8e6-b829-4ef1-a12f-6b1a0a987ee4 · outbound

This paper cites Estimated informed anytime search for sampling-based planning via adaptive sampler,.

Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic Estimated informed anytime search for sampling-based planning via adaptive sampler,

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-05T15:59:51.187520Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2db40c9e-7f2f-4daf-ad86-2bba2881b9af · outbound

This paper cites Meta-reinforcement learning in non-stationary and dynamic environments,.

Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic Meta-reinforcement learning in non-stationary and dynamic environments,

Reference 27

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T15:59:51.405386Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation e79f5615-a745-42fa-a1eb-117a6fb70793 · outbound

This paper cites Solving robotic manipulation with sparse reward reinforcement learn- ing via graph-based diversity and proximity,.

Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic Solving robotic manipulation with sparse reward reinforcement learn- ing via graph-based diversity and proximity,

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T15:59:51.396658Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 9174ef6a-b7b3-4e33-b044-cffd417a2ba4 · outbound

This paper cites Lateral flexion of a compliant spine improves motor performance in a bioinspired mouse robot,.

Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic Lateral flexion of a compliant spine improves motor performance in a bioinspired mouse robot,

Reference 29

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T15:59:51.388140Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 97d2d39c-76a8-4ba4-aa02-442deb901180 · outbound

This paper cites Cloud- native fog robotics: Model-based deployment and evaluation of real- time applications,.

Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic Cloud- native fog robotics: Model-based deployment and evaluation of real- time applications,

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T15:59:51.377852Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 24f96f36-4f23-4b03-b69c-07c2bd7eab42 · outbound

This paper cites Motion planning for robotics: A review for sampling-based planners,.

Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic Motion planning for robotics: A review for sampling-based planners,

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-05T15:59:51.202236Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation eaabf4fb-62e0-49f4-8d56-f8d5658c9389 · outbound

This paper cites Complex robotic manipulation via graph-based hindsight goal generation,.

Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic Complex robotic manipulation via graph-based hindsight goal generation,

Reference 32

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T15:59:51.364154Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation bc71ba6f-ae89-411f-a8f8-fd63648248b4 · outbound

This paper cites Contact-aware shaping and maintenance of deformable lin- ear objects with fixtures,.

Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic Contact-aware shaping and maintenance of deformable lin- ear objects with fixtures,

Reference 33

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T15:59:51.355212Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation b36d262a-940f-4c55-badd-8e3e4566f67d · outbound

This paper cites Context-based meta- reinforcement learning with bayesian nonparametric models,.

Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic Context-based meta- reinforcement learning with bayesian nonparametric models,

Reference 34

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T15:59:51.345332Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation c8aa4a1c-42d8-43b8-9cb0-4e4340933b7d · outbound

This paper cites The open motion planning library,.

Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic The open motion planning library,

Reference 35

Resolution: unresolved; no resolver link, observed 2026-08-05T15:59:51.214086Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2faa1015-fd64-4a0f-b844-8fb1b9b21354 · outbound

This paper cites Benchmarking motion planning algorithms: An extensible infrastructure for analysis and visualization,.

Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic Benchmarking motion planning algorithms: An extensible infrastructure for analysis and visualization,

Reference 36

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T15:59:51.256404Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 316d8095-1ba4-4c8e-95a4-8ef8b77d6991 · outbound

This paper cites Planner developer tools (PDT): Reproducible experiments and statistical analysis for developing and testing motion planners,.

Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic Planner developer tools (PDT): Reproducible experiments and statistical analysis for developing and testing motion planners,

Reference 37

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T15:59:51.245065Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Pith citing papers

No inbound Pith citation observations are available.