{"id":"W2041075843","doi":"10.1109/rose.2012.6402624","title":"Rigorous movement of convex polygons on a path using multiple robots","year":2012,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Path (computing); Robot; Object (grammar); Orientation (vector space); Computer science; Motion planning; Task (project management); Boundary (topology); Computer vision; Regular polygon; Trajectory; Point (geometry); Artificial intelligence; Mathematics; Geometry; Engineering; Physics","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.0008342345,0.001085157,0.001040461,0.0006829476,0.00093262,0.001125267,0.001618192,0.00121779,0.002684527],"category_scores_gemma":[0.002935513,0.0008361625,0.001340995,0.0004967512,0.001925749,0.001537507,0.002496083,0.001478285,0.0005391617],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001139349,"about_ca_system_score_gemma":0.001192483,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004877544,"about_ca_topic_score_gemma":0.004019642,"domain_scores_codex":[0.9991581,0.0001654351,0.00004690199,0.0001496019,0.0004046254,0.00007524667],"domain_scores_gemma":[0.9989229,0.0004835808,0.0001582535,0.0002260049,0.0001381049,0.00007112028],"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.00004297038,0.00001963,0.000301685,0.00006784311,0.00001530371,0.0001535624,0.0001577743,0.9410161,0.005059943,0.03135845,0.0004303726,0.02137638],"study_design_scores_gemma":[0.00001381017,0.00002372302,0.00004963299,0.000007207648,0.000002201081,0.00003272113,0.00002216883,0.9901446,0.00108782,0.006586575,0.002020709,0.000008828983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00941313,0.00004280058,0.9882377,0.00007408279,0.00002180139,0.00004431514,0.00002301694,0.000303158,0.001840027],"genre_scores_gemma":[0.1910838,0.0001335102,0.8046779,0.00003580987,0.00002094818,0.0001862632,0.0001144802,0.0002086447,0.003538604],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004877544,"threshold_uncertainty_score":0.009698272,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04465167941110011,"score_gpt":0.2729980049512949,"score_spread":0.2283463255401948,"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."}}