Digital Commons Michigan Techmetadata only
Parallel, Asymptotically Optimal Algorithms for Moving Target Traveling Salesman Problems
combinatorial search, dubins car, motion planning, parallelization, traveling salesman problem (tsp)
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗
Record · ID 451646
Conceptio Open Knowledge Archive — every document is proof-bundled with source, license, and retrieval metadata.