{"id":"W2171388963","doi":"10.1109/isvd.2007.33","title":"Pursuit-Evasion Voronoi Diagrams in \\ell_1","year":2007,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Voronoi diagram; Pursuer; Pursuit-evasion; Traverse; Plane (geometry); Combinatorics; Partition (number theory); Point (geometry); Path (computing); Mathematics; Time complexity; Metric (unit); Computer science; Algorithm; Discrete mathematics; Mathematical optimization; Geometry; Engineering; Geography","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.001128577,0.0001097068,0.0001246354,0.0001504456,0.00004183767,0.00008327533,0.0008442046,0.00007099366,0.00001560042],"category_scores_gemma":[0.00006220975,0.00009391872,0.00003432298,0.0004838173,0.00002280468,0.0003019158,0.0002086752,0.0001442076,0.0002866852],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000665111,"about_ca_system_score_gemma":0.00002887072,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001300808,"about_ca_topic_score_gemma":0.00004765273,"domain_scores_codex":[0.9986578,0.00003055151,0.000232168,0.0003361416,0.0003131039,0.0004302213],"domain_scores_gemma":[0.9991903,0.0001574056,0.00004106222,0.0004724037,0.00002540392,0.0001134358],"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.000009136865,0.0002891249,0.04789579,0.00001442444,0.00001073053,0.000651479,0.001747089,0.003317632,0.001950262,0.04689224,0.003822842,0.8933992],"study_design_scores_gemma":[0.001205262,0.0002320673,0.4706412,0.00007796963,0.000003959758,0.00008590781,0.0001259279,0.5066082,0.008863011,0.005063388,0.006366801,0.0007263511],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01752061,0.00006842938,0.9650252,0.0005480118,0.0005635786,0.0001102939,1.283033e-7,0.0002271689,0.01593654],"genre_scores_gemma":[0.4629388,0.000006441032,0.5346927,0.0004926517,0.00009689881,0.000004567223,0.000001808653,0.000009456585,0.001756648],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8926729,"threshold_uncertainty_score":0.3829894,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01328353588927298,"score_gpt":0.2565565891737532,"score_spread":0.2432730532844802,"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."}}