{"id":"W4239201751","doi":"10.22215/etd/2012-07106","title":"Rigorous movement of convex polygons on a path using multiple robots","year":2012,"lang":"en","type":"dissertation","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University; Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Regular polygon; Path (computing); Combinatorics; Computer science; Movement (music); Mathematics; Art; Geometry; Programming language","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002460103,0.00034087,0.0004709238,0.0002464731,0.00009531691,0.00005354831,0.0008165889,0.0002472241,0.00003052096],"category_scores_gemma":[0.00005925443,0.0003082912,0.0001313201,0.0002572473,0.00001988612,0.0001973039,0.00008474589,0.0002660744,0.00005200718],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001064592,"about_ca_system_score_gemma":0.0001821151,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001002401,"about_ca_topic_score_gemma":0.00002793649,"domain_scores_codex":[0.9978899,0.00006907183,0.0004767796,0.0004914812,0.0006186919,0.0004540301],"domain_scores_gemma":[0.9983156,0.0001513047,0.0004495029,0.0008005335,0.0001358491,0.0001471625],"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.0005026508,0.008644105,0.0283103,0.003173795,0.002509913,0.0006772451,0.06336108,0.2902596,0.1129329,0.1053112,0.009710718,0.3746065],"study_design_scores_gemma":[0.0009137312,0.0003114063,0.03006803,0.0007623461,0.00008314401,0.00001243199,0.0004388946,0.9472515,0.01860159,0.0004985217,0.00008258926,0.0009758275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06421295,0.000511352,0.9155485,0.00004716353,0.005403926,0.000821389,0.00003885376,0.0003485205,0.01306735],"genre_scores_gemma":[0.4363042,0.000009355418,0.5570871,0.0002955972,0.0002048693,0.00003129992,0.000271124,0.00006250352,0.005733897],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6569919,"threshold_uncertainty_score":0.9999369,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03313720056815581,"score_gpt":0.2832851746616655,"score_spread":0.2501479740935098,"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."}}