{"id":"W2033954340","doi":"10.1109/robot.2004.1307265","title":"A Delaunay triangulation based node connection strategy for probabilistic roadmap planners","year":2004,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Delaunay triangulation; Probabilistic roadmap; Node (physics); Probabilistic logic; Constrained Delaunay triangulation; Computer science; Bowyer–Watson algorithm; Set (abstract data type); Connection (principal bundle); Motion planning; Point (geometry); Mathematical optimization; Topology (electrical circuits); Theoretical computer science; Algorithm; Artificial intelligence; Mathematics; Robot; Engineering","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003478447,0.0001389452,0.0001482822,0.000117067,0.0001267508,0.0001310678,0.0003092648,0.00008523384,0.000006348313],"category_scores_gemma":[0.0001865402,0.0001249009,0.00006491941,0.00027911,0.00002304821,0.0003154665,0.0000200682,0.00007086846,0.00002743754],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001448727,"about_ca_system_score_gemma":0.000234478,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009466356,"about_ca_topic_score_gemma":0.00001175629,"domain_scores_codex":[0.9988377,0.00003797754,0.0002475246,0.0003941231,0.0002011952,0.0002814847],"domain_scores_gemma":[0.999186,0.0001868107,0.00009387192,0.0003343426,0.0001073207,0.00009168469],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000195218,0.00005739361,0.00004777595,0.00001687084,0.000008480603,0.000005406349,0.0001097623,0.9658483,0.0002631667,0.0304291,0.0001532981,0.003040966],"study_design_scores_gemma":[0.001883603,0.0002601066,0.001196252,0.00002641664,0.000009546904,0.00001344648,0.00002417013,0.9817807,0.001559692,0.01294905,0.0001035114,0.0001934732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004249674,0.00001022385,0.9926112,0.001016025,0.0003964595,0.0005644564,0.00000450346,0.0003895301,0.0007579026],"genre_scores_gemma":[0.5433733,1.331993e-7,0.4560856,0.000229404,0.00006660674,0.0000759462,0.0000282381,0.000009317601,0.000131384],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5391237,"threshold_uncertainty_score":0.5093311,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04531969362830141,"score_gpt":0.2862175437736189,"score_spread":0.2408978501453175,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}