{"id":"W2112695860","doi":"10.1142/s021819590800257x","title":"BOUNDED-VELOCITY APPROXIMATION OF MOBILE EUCLIDEAN 2-CENTRES","year":2008,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia; McGill University","funders":"Mitacs; Simon Fraser University","keywords":"Euclidean geometry; Bounded function; Mathematics; Euclidean distance; Plane (geometry); RADIUS; Closeness; Combinatorics; Set (abstract data type); Trajectory; Geometry; Mathematical analysis; Computer science; Physics","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.00048449,0.0001616599,0.0002956776,0.0007528035,0.0001505628,0.00008343391,0.001660075,0.00006962079,0.00002588562],"category_scores_gemma":[0.00008929809,0.0001625664,0.0001936251,0.0008298893,0.0001595892,0.0007025825,0.0001738557,0.0002337626,0.00004069025],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001535964,"about_ca_system_score_gemma":0.0004045412,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000938834,"about_ca_topic_score_gemma":2.084042e-7,"domain_scores_codex":[0.9970371,0.00007173135,0.00103134,0.0002493673,0.00142901,0.0001814778],"domain_scores_gemma":[0.9957055,0.0004975302,0.001159686,0.0002583906,0.0022453,0.0001335183],"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.00005009574,0.00149363,0.007577267,0.00004815294,0.0006494256,0.00008361635,0.001564857,0.7334273,0.0005439445,0.137188,0.001859232,0.1155145],"study_design_scores_gemma":[0.00567682,0.0007826817,0.1249439,0.0003065788,0.0001250907,0.00733358,0.0004371998,0.5091983,0.005999454,0.2770423,0.06677017,0.001383941],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02975166,0.0002575141,0.9681044,0.0004209817,0.0003899717,0.0002700763,0.00002801119,0.00004834598,0.0007290654],"genre_scores_gemma":[0.5617,0.0000425121,0.4377254,0.0001097135,0.0002839685,0.00003654547,0.000034474,0.00000908016,0.00005828682],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5319484,"threshold_uncertainty_score":0.6629265,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0178978071153125,"score_gpt":0.2866266356797827,"score_spread":0.2687288285644702,"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."}}