{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006250678,0.0006014635,0.0006016538,0.0007593684,0.0006494949,0.0006304916,0.001579622,0.000781747,0.001833794],"category_scores_gemma":[0.003057243,0.0004991685,0.0003567922,0.0008172488,0.0007300528,0.001235361,0.001201054,0.0006633284,0.0005503522],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005597046,"about_ca_system_score_gemma":0.0007688877,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003324849,"about_ca_topic_score_gemma":0.004929225,"domain_scores_codex":[0.9992423,0.0002157332,0.00003638818,0.000162898,0.0003040342,0.00003870876],"domain_scores_gemma":[0.9993663,0.0002561184,0.00007725877,0.0001083266,0.0001511919,0.00004074249],"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.00007930226,0.00006604841,0.0008240812,0.0001910429,0.00004749062,0.0002312146,0.0003485175,0.5205772,0.01607415,0.06613558,0.00399186,0.3914336],"study_design_scores_gemma":[0.00001610544,0.0000606866,0.0001403479,0.000009800729,0.000009880858,0.000135742,0.0000322305,0.9784544,0.003577196,0.01238321,0.005159308,0.00002124649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004107897,0.00008399391,0.9945327,0.00005957015,0.00001290976,0.00004294717,0.00001772198,0.0002422893,0.0009000349],"genre_scores_gemma":[0.1823701,0.0001751223,0.8153657,0.00005013572,0.00002368974,0.0002292361,0.0001185773,0.0001084463,0.00155892],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003324849,"threshold_uncertainty_score":0.00661099,"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."}}