{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008468772,0.0001149719,0.0001314719,0.0001570414,0.00004557224,0.00007573736,0.0006184291,0.00006379931,0.000007652473],"category_scores_gemma":[0.00005232109,0.0001041088,0.00002900372,0.0003800312,0.00002060891,0.0003115312,0.0001673662,0.0001736667,0.00008396271],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005244808,"about_ca_system_score_gemma":0.00003528275,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007025978,"about_ca_topic_score_gemma":0.000001279527,"domain_scores_codex":[0.998717,0.00002520958,0.0002380337,0.0003207504,0.0002249152,0.0004740839],"domain_scores_gemma":[0.9993261,0.0001491967,0.00004398165,0.0003512352,0.00001985639,0.0001096401],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002662541,0.0004383954,0.225066,0.00002635866,0.00003199581,0.004721434,0.01068283,0.1855223,0.0008224268,0.05509682,0.008316246,0.5092486],"study_design_scores_gemma":[0.000401055,0.00008550285,0.1861292,0.00003974005,0.000001218345,0.00004960904,0.000107526,0.8109168,0.0007778999,0.0002715511,0.0009454263,0.000274481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03629221,0.00007461353,0.9513901,0.0001405566,0.0003354627,0.00007634192,2.114953e-7,0.0002388925,0.0114516],"genre_scores_gemma":[0.4284415,7.082426e-7,0.5710291,0.0001831333,0.0000510899,0.000002637779,9.854336e-7,0.000005293064,0.0002855324],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6253945,"threshold_uncertainty_score":0.4245436,"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."}}