{"id":"W4385357007","doi":"10.1007/978-3-031-38906-1_28","title":"Shortest Coordinated Motion for Square Robots","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Square (algebra); Obstacle; Computer science; Robot; Motion (physics); Euclidean geometry; Least-squares function approximation; Motion planning; Algorithm; Plane (geometry); Artificial intelligence; Mathematics; Geometry; Statistics; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008585046,0.0006334991,0.0005138634,0.0004799769,0.0002780609,0.0004000884,0.0007022162,0.0004166224,0.00523201],"category_scores_gemma":[0.0005403645,0.0003718905,0.0003286964,0.0009296595,0.0004210903,0.0005613203,0.000869604,0.0007158461,0.001319692],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004262887,"about_ca_system_score_gemma":0.0003703769,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002122461,"about_ca_topic_score_gemma":0.002545774,"domain_scores_codex":[0.9998757,0.00001647547,0.000004655823,0.00003223895,0.00005791417,0.00001306652],"domain_scores_gemma":[0.9999218,0.00002952191,0.000009240018,0.00001209501,0.00001677459,0.00001049595],"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.00009402981,0.00003795254,0.0001840734,0.0003027479,0.0000384404,0.00009368947,0.0001687118,0.4498891,0.01511511,0.1077469,0.02561359,0.4007156],"study_design_scores_gemma":[0.0000470805,0.0001305963,0.0004539904,0.00004866899,0.00001807494,0.0001423598,0.00007758118,0.734213,0.003548585,0.2091637,0.05213091,0.00002549626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01498238,0.002332256,0.9512438,0.0001976061,0.0002667482,0.00004541062,0.0001940063,0.001216185,0.02952158],"genre_scores_gemma":[0.343844,0.003554808,0.5857129,0.0001256727,0.0001386225,0.000286688,0.001085146,0.0006893604,0.06456283],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00523201,"threshold_uncertainty_score":0.01750278,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03417938870758149,"score_gpt":0.2703383494041565,"score_spread":0.236158960696575,"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."}}