{"id":"W2143102370","doi":"10.1109/isvd.2007.43","title":"Voronoi diagram in optimal path planning","year":2007,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":141,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Voronoi diagram; Smoothness; Disjoint sets; Path (computing); Computer science; Centroidal Voronoi tessellation; Motion planning; Diagram; Relation (database); Algorithm; Computational geometry; Mathematical optimization; Path length; Mathematics; Data mining; Artificial intelligence; Combinatorics; Geometry","routes":{"ca_aff":true,"ca_fund":true,"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.0008488722,0.0005072559,0.000996801,0.001143755,0.0005251809,0.001112682,0.001046833,0.0007525072,0.002253873],"category_scores_gemma":[0.003847166,0.00042881,0.0004821212,0.001512235,0.0009712883,0.002027728,0.00117886,0.0009094198,0.0006782008],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008320438,"about_ca_system_score_gemma":0.0009788885,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004383943,"about_ca_topic_score_gemma":0.003144527,"domain_scores_codex":[0.9990591,0.0003450654,0.00004131491,0.000145635,0.0003520901,0.00005672978],"domain_scores_gemma":[0.9991465,0.0005701747,0.00004312205,0.00007489414,0.0001313635,0.00003392937],"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.00009590158,0.00002383899,0.0004913696,0.0002706248,0.00004665978,0.0001177238,0.00012114,0.5837933,0.002247379,0.2573555,0.003065065,0.1523714],"study_design_scores_gemma":[0.00003701187,0.00003701882,0.0001374477,0.00003343134,0.0000148409,0.0001056665,0.00002599458,0.8086858,0.00187838,0.1704396,0.018582,0.00002268501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002259311,0.001125318,0.9946466,0.0000831127,0.00005475219,0.00002307255,0.0000411373,0.0001711534,0.001595411],"genre_scores_gemma":[0.244725,0.002534206,0.7493553,0.0000747525,0.0001263018,0.0001606645,0.0003288064,0.0001649293,0.002529888],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004383943,"threshold_uncertainty_score":0.008716881,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01898327563348483,"score_gpt":0.2818411438605739,"score_spread":0.262857868227089,"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."}}