{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002915361,0.0001344955,0.0001902057,0.0000919833,0.00006760292,0.00002650532,0.0004380278,0.00005011474,0.00001519207],"category_scores_gemma":[0.00004978507,0.0001128918,0.000053074,0.0002054303,0.00003094675,0.0002730535,0.000174812,0.00008929138,0.00004716173],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005688925,"about_ca_system_score_gemma":0.00004151201,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003395924,"about_ca_topic_score_gemma":0.000001036478,"domain_scores_codex":[0.9987471,0.00005400544,0.0002359189,0.0002193547,0.0003305614,0.0004131153],"domain_scores_gemma":[0.9990328,0.0001321301,0.0001126869,0.0005305471,0.00004338789,0.0001484777],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006518423,0.005053108,0.3129269,0.000172898,0.0004203396,0.0001476577,0.01773176,0.3087682,0.07201008,0.1723592,0.005277559,0.1050671],"study_design_scores_gemma":[0.0004599867,0.000124864,0.01669491,0.00004799406,0.000007460801,0.00001374905,0.00005962542,0.9690635,0.01304108,0.0002004839,0.00007109838,0.0002152853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05420573,0.00007433177,0.9427627,0.00009583616,0.0006446547,0.0001485938,0.000003695054,0.0001214262,0.001943062],"genre_scores_gemma":[0.6021346,7.763948e-7,0.3973197,0.000366446,0.00004736874,0.000002899619,9.212328e-7,0.000006216589,0.0001210073],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6602953,"threshold_uncertainty_score":0.4603594,"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."}}